Going Beyond Neural Network Feature Similarity: The Network Feature Complexity and Its Interpretation Using Category Theory
Yiting Chen, Zhanpeng Zhou, Junchi Yan
Abstract
The behavior of neural networks still remains opaque, and a recently widely noted phenomenon is that networks often achieve similar performance when initialized with different random parameters. This phenomenon has attracted significant attention in measuring the similarity between features learned by distinct networks. However, feature similarity could be vague in describing the same feature since equivalent features hardly exist. In this paper, we expand the concept of equivalent feature and provide the definition of what we call functionally equivalent features. These features produce equivalent output under certain transformations. Using this definition, we aim to derive a more intrinsic metric for the so-called feature complexity regarding the redundancy of features learned by a neural network at each layer. We offer a formal interpretation of our approach through the lens of category theory, a well-developed area in mathematics. To quantify the feature complexity, we further propose an efficient algorithm named Iterative Feature Merging. Our experimental results validate our ideas and theories from various perspectives. We empirically demonstrate that the functionally equivalence widely exists among different features learned by the same neural network and we could reduce the number of parameters of the network without affecting the performance. We have also drawn several interesting empirical findings, including: 1) the larger the network, the more redundant features it learns; 2) in particular, we show how to prune the networks based on our finding using direct equivalent feature merging, without fine-tuning which is often needed in peer network pruning methods; 3) same structured networks with higher feature complexity achieve better performance; 4) through the layers of a neural network, the feature complexity first increase then decrease; 5) for the image classification task, a group of functionally equivalent features may correspond to a specific low-level semantic meaning. Source code will be made publicly available.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers7
- On the Emergence of Cross-Task Linearity in Pretraining-Finetuning ParadigmZhanpeng Zhou, Zijun Chen, Yilan Chen, Bo Zhang et al.ICML 2024 · 26 citations
- Understanding Visual Feature Reliance through the Lens of ComplexityThomas Fel, Louis Béthune, Andrew K. Lampinen, Thomas Serre et al.NeurIPS 2024 · 20 citations
- Unveiling The Matthew Effect Across Channels: Assessing Layer Width Sufficiency via Weight Norm VarianceYiting Chen, Jiazi Bu, Junchi YanNeurIPS 2024 · 4 citations
- Enriching Disentanglement: From Logical Definitions to Quantitative MetricsYivan Zhang, Masashi SugiyamaNeurIPS 2024 · 4 citations
- Cut Less, Fold More: Model Compression through the Lens of Projection GeometryOlga Saukh, Dong Wang, Haris Sikic, Yun Cheng et al.ICLR 2026 · 4 citations
Builds on14
- Pruning neural networks without any data by iteratively conserving synaptic flowHidenori Tanaka, Daniel Kunin, Daniel L. K. Yamins, Surya GanguliNeurIPS 2020 · 884 citations
- Linear Mode Connectivity and the Lottery Ticket HypothesisJonathan Frankle, Gintare Karolina Dziugaite, Daniel M. Roy, Michael CarbinICML 2020 · 750 citations
- Do Wide and Deep Networks Learn the Same Things? Uncovering How Neural Network Representations Vary with Width and DepthThao Nguyen, Maithra Raghu, Simon KornblithICLR 2021 · 323 citations
- The Role of Permutation Invariance in Linear Mode Connectivity of Neural NetworksRahim Entezari, Hanie Sedghi, Olga Saukh, Behnam NeyshaburICLR 2022 · 301 citations
- Generalized Shape Metrics on Neural RepresentationsAlex H. Williams, Erin Kunz, Simon Kornblith, Scott W. LindermanNeurIPS 2021 · 182 citations
Related papers
- Neuron Merging: Compensating for Pruned NeuronsWoojeong Kim, Suhyun Kim, Mincheol Park, Geunseok JeonNeurIPS 2020 · 42 citations
- Exploring the Complexity of Deep Neural Networks through Functional EquivalenceGuohao ShenICML 2024 · 6 citations
- Interpreting and Disentangling Feature Components of Various Complexity from DNNsJie Ren, Mingjie Li, Zexu Liu, Quanshi ZhangICML 2021 · 20 citations
- Rethinking the Pruning Criteria for Convolutional Neural NetworkZhongzhan Huang, Wenqi Shao, Xinjiang Wang, Liang Lin et al.NeurIPS 2021 · 75 citations
- Convolutional Neural Network Pruning With Structural Redundancy ReductionZi Wang, Chengcheng Li, Xiangyang WangCVPR 2021
