mlsanityData to 7 Oct 2026

Functional Equivalence and Path Connectivity of Reducible Hyperbolic Tangent Networks

arXiv 2305.05089 ↗First posted 8 May 2023cs.NE cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 12 of its 43 references that are in the map. First posted on arXiv 8 May 2023.

Builds on

12 of 43 references.

References · 12

  1. 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
  2. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
  3. 2021Geometry of the Loss Landscape in Overparameterized Neural Networks: Symmetries and Invariancescited by 125
  4. 2019Explaining Landscape Connectivity of Low-cost Solutions for Multilayer Netscited by 63
  5. 2019Weight-space symmetry in deep networks gives rise to permutation saddles, connected by equal-loss valleys across the loss landscapecited by 61
  6. 2020Deep Learning is Singular, and That's Goodcited by 49
  7. 2019Semi-flat minima and saddle points by embedding neural networks to overparameterizationcited by 29
  8. 2021Parameter identifiability of a deep feedforward ReLU neural networkcited by 24
  9. 2021An Embedding of ReLU Networks and an Analysis of their Identifiabilitycited by 20
  10. 2020Affine symmetries and neural network identifiabilitycited by 17
  11. 2019Neural network identifiability for a family of sigmoidal nonlinearitiescited by 14
  12. 2019Frivolous Units: Wider Networks Are Not Really That Widecited by 10

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 1; 2025: 1; 2026: 1.

5 papers.