mlsanityData to 14 Oct 2026

Not all solutions are created equal: An analytical dissociation of functional and representational similarity in deep linear neural networks

arXiv 2609.38998 ↗First posted 30 Sep 2026cs.LG q-bio.NCcited by 1

Not on the map. Why?

Abstract (arXiv)

A foundational principle of connectionism is that perception, action, and cognition emerge from parallel computations among simple, interconnected units that generate and rely on neural representations. Accordingly, researchers employ multivariate pattern analysis to decode and compare the neural codes of artificial and biological networks, aiming to uncover their functions. However, there is limited analytical understanding of how a network's representation and function relate, despite this being essential to any quantitative notion of underlying function or functional similarity. We address this question using analysable two-layer linear networks and numerical simulations in non-linear networks. We find that function and representation are dissociated, allowing representational similarity without functional similarity and vice versa. Further, we show that neither robustness to input noise nor the level of generalization error constrain representations to the task. In contrast, networks robust to parameter noise have limited representational flexibility and must employ task-specific representations. Our findings suggest that representational alignment reflects computational advantages beyond functional alignment alone, with significant implications for interpreting and comparing the representations of connectionist systems.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 44 of its 94 references that are in the map. First posted on arXiv 30 Sep 2026.

Builds on

44 of 94 references.

References · 44

  1. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  2. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
  3. 2016Understanding deep learning requires rethinking generalizationcited by 1,674
  4. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,105
  5. 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 763
  6. 2018On Lazy Training in Differentiable Programmingcited by 675
  7. 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 659
  8. 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 342
  9. 2020Kernel and Rich Regimes in Overparametrized Modelscited by 306
  10. 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 291
  11. 2018On the Optimization of Deep Networks: Implicit Acceleration by Overparameterizationcited by 284
  12. 2020Implicit Bias of Gradient Descent for Wide Two-layer Neural Networks Trained with the Logistic Losscited by 268
32 more
  1. 2017High-dimensional dynamics of generalization error in neural networkscited by 241
  2. 2018A mathematical theory of semantic development in deep neural networkscited by 186
  3. 2018A Convergence Analysis of Gradient Descent for Deep Linear Neural Networkscited by 184
  4. 2023Similarity of Neural Network Models: A Survey of Functional and Representational Measurescited by 131
  5. 2020What shapes feature representations? Exploring datasets, architectures, and trainingcited by 126
  6. 2015Path-SGD: Path-Normalized Optimization in Deep Neural Networkscited by 120
  7. 2021Generalized Shape Metrics on Neural Representationscited by 112
  8. 2017Stochastic gradient descent performs variational inference, converges to limit cycles for deep networkscited by 109
  9. 2020On Linear Identifiability of Learned Representationscited by 105
  10. 2018An analytic theory of generalization dynamics and transfer learning in deep linear networkscited by 85
  11. 2020Convolutional Neural Networks as a Model of the Visual System: Past, Present, and Futurecited by 83
  12. 2021Desiderata for Representation Learning: A Causal Perspectivecited by 76
  13. 2020A Unifying View on Implicit Bias in Training Linear Neural Networkscited by 75
  14. 2022High-dimensional limit theorems for SGD: Effective dynamics and critical scalingcited by 70
  15. 2021Classifying high-dimensional Gaussian mixtures: Where kernel methods fail and neural networks succeedcited by 69
  16. 2017Deep linear neural networks with arbitrary loss: All local minima are globalcited by 65
  17. 2022On the Symmetries of Deep Learning Models and their Internal Representationscited by 64
  18. 2024From Lazy to Rich: Exact Learning Dynamics in Deep Linear Networkscited by 49
  19. 2022The neuroconnectionist research programmecited by 48
  20. 2020Implicit Regularization in ReLU Networks with the Square Losscited by 45
  21. 2021Parameter identifiability of a deep feedforward ReLU neural networkcited by 24
  22. 2024Learned feature representations are biased by complexity, learning order, position, and morecited by 23
  23. 2023Six Lectures on Linearized Neural Networkscited by 20
  24. 2019Neural network identifiability for a family of sigmoidal nonlinearitiescited by 14
  25. 2024All or None: Identifiable Linear Properties of Next-token Predictors in Language Modelingcited by 14
  26. 2024Features are fate: a theory of transfer learning in high-dimensional regressioncited by 13
  27. 2024Evaluating Representational Similarity Measures from the Lens of Functional Correspondencecited by 12
  28. 2023System identification of neural systems: If we got it right, would we know?cited by 9
  29. 2024Identifiable Object-Centric Representation Learning via Probabilistic Slot Attentioncited by 9
  30. 2023Stochastic Gradient Descent-Induced Drift of Representation in a Two-Layer Neural Networkcited by 6
  31. 2020If deep learning is the answer, then what is the question?cited by 2
  32. 2022On Pitfalls of Identifiability in Unsupervised Learning. A Note on: "Desiderata for Representation Learning: A Causal Perspective"cited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.