Functional Equivalence and Path Connectivity of Reducible Hyperbolic Tangent Networks
Matthew Farrugia-Roberts
Abstract
Understanding the learning process of artificial neural networks requires clarifying the structure of the parameter space within which learning takes place. A neural network parameter's functional equivalence class is the set of parameters implementing the same input--output function. For many architectures, almost all parameters have a simple and well-documented functional equivalence class. However, there is also a vanishing minority of reducible parameters, with richer functional equivalence classes caused by redundancies among the network's units. In this paper, we give an algorithmic characterisation of unit redundancies and reducible functional equivalence classes for a single-hidden-layer hyperbolic tangent architecture. We show that such functional equivalence classes are piecewise-linear path-connected sets, and that for parameters with a majority of redundant units, the sets have a diameter of at most 7 linear segments.
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 4aaf4ae3-94d8-457c-8a75-606bf18e08aaCited by top-tier papers2
- Optimizing Neural Network Representations of Boolean NetworksJoshua Russell, Ignacio Gavier, Devdhar Patel, Edward A. Rietman et al.ICLR 2025
- Connecting the Dots: Is Mode-Connectedness the Key to Feasible Sample-Based Inference in Bayesian Neural Networks?Emanuel Sommer, Lisa Wimmer, Theodore Papamarkou, Ludwig Bothmann et al.ICML 2024
Builds on2
Related papers
- Compelling ReLU Networks to Exhibit Exponentially Many Linear Regions at Initialization and During TrainingMax Milkert, David Hyde, Forrest J. LaineICML 2025
- Hidden Symmetries of ReLU NetworksJ. Elisenda Grigsby, Kathryn Lindsey, David RolnickICML 2023 · 35 citations
- Exploring the Complexity of Deep Neural Networks through Functional EquivalenceGuohao ShenICML 2024 · 6 citations
- Towards Lower Bounds on the Depth of ReLU Neural NetworksChristoph Hertrich, Amitabh Basu, Marco Di Summa, Martin SkutellaNeurIPS 2021 · 70 citations
- Going Beyond Neural Network Feature Similarity: The Network Feature Complexity and Its Interpretation Using Category TheoryYiting Chen, Zhanpeng Zhou, Junchi YanICLR 2024 · 13 citations
