Topological obstruction to the training of shallow ReLU neural networks
Marco Nurisso, Pierrick Leroy, Francesco Vaccarino
Abstract
Studying the interplay between the geometry of the loss landscape and the optimization trajectories of simple neural networks is a fundamental step for understanding their behavior in more complex settings. This paper reveals the presence of topological obstruction in the loss landscape of shallow ReLU neural networks trained using gradient flow. We discuss how the homogeneous nature of the ReLU activation function constrains the training trajectories to lie on a product of quadric hypersurfaces whose shape depends on the particular initialization of the network's parameters. When the neural network's output is a single scalar, we prove that these quadrics can have multiple connected components, limiting the set of reachable parameters during training. We analytically compute the number of these components and discuss the possibility of mapping one to the other through neuron rescaling and permutation. In this simple setting, we find that the non-connectedness results in a topological obstruction, which, depending on the initialization, can make the global optimum unreachable. We validate this result with numerical experiments.
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 fb9d4234-3394-4c79-9086-bba7fd498628Cited by top-tier papers2
- Topology and geometry of the learning space of ReLU networks: connectivity and singularitiesMarco Nurisso, Pierrick Leroy, Giovanni Petri, Francesco VaccarinoICLR 2026 · 6 citations
- On the Epistemic Uncertainty of Overparametrized Neural NetworksDavid RügamerICML 2026
Builds on13
- 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
- Deep learning versus kernel learning: an empirical study of loss landscape geometry and the time evolution of the Neural Tangent KernelStanislav Fort, Gintare Karolina Dziugaite, Mansheej Paul, Sepideh Kharaghani et al.NeurIPS 2020 · 255 citations
- On the Origin of Implicit Regularization in Stochastic Gradient DescentSamuel L. Smith, Benoit Dherin, David G. T. Barrett, Soham DeICLR 2021 · 235 citations
- Implicit Gradient RegularizationDavid G. T. Barrett, Benoit DherinICLR 2021 · 235 citations
Related papers
- Loss Landscape of Shallow ReLU-like Neural Networks: Stationary Points, Saddle Escape, and Network EmbeddingZhengqing Wu, Berfin Simsek, François Gaston GedICLR 2025
- SAD Neural Networks: Divergent Gradient Flows and Asymptotic Optimality via o-minimal StructuresJulian Kranz, Davide Gallon, Steffen Dereich, Arnulf JentzenNeurIPS 2025 · 5 citations
- Does a sparse ReLU network training problem always admit an optimum ?Quoc-Tung Le, Rémi Gribonval, Elisa RicciettiNeurIPS 2023 · 5 citations
- Spurious Valleys and Clustering Behavior of Neural NetworksSamuele PollaciICML 2023 · 1 citation
- On the Expected Complexity of Maxout NetworksHanna Tseran, Guido MontúfarNeurIPS 2021 · 19 citations
