aiqbench analysis
This paper is a theoretical study of linear neural networks, examining the geometry of all weight configurations that produce the same overall linear map. It contributes a stratification, dimension results, and a barcode-based description of how these weight sets connect, which is mainly relevant to researchers studying loss landscapes, optimization dynamics, and the implicit structure of deep linear models. The results are foundational rather than product-facing, so their practical impact on deployed systems will depend on how far the linear-network insights transfer to nonlinear architectures.
The Geometry of the Set of Equivalent Linear Neural Networks
arXiv:2404.14855v2 Announce Type: replace Abstract: We characterize the geometry of the set of all weight vectors for which a fully-connected linear neural network computes the same linear transformation $W$. Said another way, the set of all sequences of matrices (of predetermined sizes) whose product is $W$. This set of weight vectors is an algebraic variety in the Euclidean weight space, called the fiber of $W$ under the matrix multiplication map. Sometimes this variety is a manifold, but usually not. The rank stratification of a fiber is a natural partition of the fiber into smooth manifolds of various dimensions called strata. We derive the dimensions of these strata and characterize how they are connected to each other. They satisfy the frontier condition: if a stratum intersects the closure of another stratum, then the former stratum is a subset of the closure of the latter stratum. This subset relationship can be expressed as a partial order with a single minimal element, a stratum that is included in the closure of every other stratum. Hence the strata can be arranged in a hierarchy represented by a directed acyclic graph that represents that partial order; we give an algorithm that computes that graph. A key result describes the relationship between this partial order and the ranks of certain matrices in the network. We derive the tangent and normal subspaces of the strata, and we construct elegant bases for those subspaces. Each stratum represents a different pattern of information flow through the network, expressed as a barcode, borrowed from the study of persistent homology. The topology of a stratum depends solely on its barcode. So does its geometry, up to a linear transformation in weight space. Connections among the strata are best understood through "barcode moves," which can be expressed as simple modifications of the barcodes.
Abstract:We characterize the geometry of the set of all weight vectors for which a fully-connected linear neural network computes the same linear transformation $W$. Said another way, the set of all sequences of matrices (of predetermined sizes) whose product is $W$. This set of weight vectors is an algebraic variety in the Euclidean weight space, called the fiber of $W$ under the matrix multiplication map. Sometimes this variety is a manifold, but usually not. The rank stratification of a fiber is a natural partition of the fiber into smooth manifolds of various dimensions called strata. We derive the dimensions of these strata and characterize how they are connected to each other. They satisfy the frontier condition: if a stratum intersects the closure of another stratum, then the former stratum is a subset of the closure of the latter stratum. This subset relationship can be expressed as a partial order with a single minimal element, a stratum that is included in the closure of every other stratum. Hence the strata can be arranged in a hierarchy represented by a directed acyclic graph that represents that partial order; we give an algorithm that computes that graph. A key result describes the relationship between this partial order and the ranks of certain matrices in the network. We derive the tangent and normal subspaces of the strata, and we construct elegant bases for those subspaces. Each stratum represents a different pattern of information flow through the network, expressed as a barcode, borrowed from the study of persistent homology. The topology of a stratum depends solely on its barcode. So does its geometry, up to a linear transformation in weight space. Connections among the strata are best understood through "barcode moves," which can be expressed as simple modifications of the barcodes.
Machine Learning (cs.LG); Computational Geometry (cs.CG)
arXiv:2404.14855 [cs.LG]
(or arXiv:2404.14855v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2404.14855 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 391 words
Related coverage

PIRAMID: Progress and Plans
LessWrong · Jul 27, 2026

Exploding variance of means of exponentials: least-squares to the rescue – Machine Learning Research Blog
francisbach.com · Sep 27, 2026
Broken scale symmetries in undercomplete linear autoencoders
arXiv · Oct 5, 2026
FOSLS-deRhaNN: native de Rham neural classes for H(div) and H(curl) with applications to first-order system least-squares neural network methods for partial differential equations
arXiv · Oct 7, 2026