Comparing the functional behavior of neural network models, whether it is a single network over time or two (or more networks) during or post-training, is an essential step in understanding what they are learning (and what they are not), and for identifying strategies for regularization or efficiency improvements. Despite recent progress, e.g., comparing vision transformers to CNNs, systematic comparison of function, especially across different networks, remains difficult and is often carried out layer by layer. Approaches such as canonical correlation analysis (CCA) are applicable in principle, but have been sparingly used so far. In this paper, we revisit a (less widely known) from statistics, called distance correlation (and its partial variant), designed to evaluate correlation between feature spaces of different dimensions. We describe the steps necessary to carry out its deployment for large scale models -- this opens the door to a surprising array of applications ranging from conditioning one deep model w.r.t. another, learning disentangled representations as well as optimizing diverse models that would directly be more robust to adversarial attacks. Our experiments suggest a versatile regularizer (or constraint) with many advantages, which avoids some of the common difficulties one faces in such analyses.
Divergent Traning
Disentanglement
Informative Comparisons between Networks (Partial Distance Correlation)
Paper and Bibtex
[Paper]
|
|
Citation On the Versatile Uses of Partial Distance Correlation in Deep Learning Xingjian Zhen, Zihang Meng, Rudrasis Chakraborty, Vikas Singh European Conference on Computer Vision (ECCV), 2022.
[Bibtex]
@inproceedings{zhen2022versatile,
author = {Zhen, Xingjian and Meng, Zihang and Chakraborty, Rudrasis and Singh, Vikas},
title = {On the Versatile Uses of Partial Distance Correlation in Deep Learning},
booktitle = {Proceedings of the European conference on computer vision (ECCV)},
year = {2022}}
|
|
|
|
Acknowledgements
Research supported in part by NIH grants RF1 AG059312, RF1 AG062336, and RF1AG059869, and NSF grant CCF #1918211.
We would like to thank Joong Ho Kim for helping us to build this demo webpage.
|