Deep Networks on Toroids: Removing Symmetries Reveals the Structure of Flat Regions in the Landscape Geometry
Fabrizio Pittorino, Antonio Ferraro, Gabriele Perugini, Christoph, Feinauer, Carlo Baldassi, Riccardo Zecchina

TL;DR
This paper investigates deep neural network landscapes by removing symmetries to analyze the geometry of function space, revealing insights into flat minima, mode connectivity, and generalization across various architectures.
Contribution
It introduces a standardized parameterization on a toroidal space that removes symmetries, enabling a geometric analysis of minima and their connectivity in neural networks.
Findings
Flatter minima are closer in function space and linked by low-barrier geodesics.
Minimizers found by gradient variants can be connected by simple polygonal paths.
Connectivity results extend to networks with binary weights and activations.
Abstract
We systematize the approach to the investigation of deep neural network landscapes by basing it on the geometry of the space of implemented functions rather than the space of parameters. Grouping classifiers into equivalence classes, we develop a standardized parameterization in which all symmetries are removed, resulting in a toroidal topology. On this space, we explore the error landscape rather than the loss. This lets us derive a meaningful notion of the flatness of minimizers and of the geodesic paths connecting them. Using different optimization algorithms that sample minimizers with different flatness we study the mode connectivity and relative distances. Testing a variety of state-of-the-art architectures and benchmark datasets, we confirm the correlation between flatness and generalization performance; we further show that in function space flatter minima are closer to each…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
