arXiv Machine Learning

Spectral symmetry fingerprints in equivariant representations

Hugging Face Trending Papers
Aug 12

Reducing Symmetry Increase in Equivariant Neural Networks

Equivariant Neural Networks (ENNs) have empowered numerous applications in scientific fields. Despite their remarkable capacity for representing geometric structures, ENNs suffer from degraded expressivity when processing symmetric inputs: the output representations are invariant to transformations that extend beyond the input's symmetries.

arXiv Machine Learning
Oct 8

Eigenvalues of the Hessian in Deep Learning: The Origin of Symmetry and Its Breaking

The paper investigates why Hessian spectra of trained deep learning models consistently show a bulk of eigenvalues near zero and a few isolated outliers. It proposes that these patterns arise from a hidden, highly symmetric reference configuration; when the model is perturbed (e.g., by architecture, data, or metric changes), the symmetry is broken, producing the observed cluster hierarchy. The authors analyze this mechanism in three‑layer ReLU networks and extend it to convolutional, graph, transformer models, the NTK, and related matrices such as layerwise Hessians and the Gauss‑Newton matrix.

By Yossi Arjevani
arXiv Machine Learning
Jun 16

Graph Learning Should Move Beyond Restrictive Views of Spectral and Message-Passing GNNs

arXiv:2602. 10031v2 Announce Type: replace Abstract: Graph neural networks (GNNs) are commonly divided into message-passing neural networks (MPNNs) and spectral GNNs, reflecting two largely separate research traditions in machine learning and signal processing.

By Antonis Vasileiou, Juan Cervino, Pascal Frossard, Charilaos I. Kanatsoulis, Christopher Morris, Michael T. Schaub, Pierre Vandergheynst, Zhiyang Wang, Guy Wolf, Ron Levie
arXiv Machine Learning
Oct 2

Parameter symmetries determine representational geometry in overparameterized nonlinear networks

The paper investigates how parameter symmetries in overparameterized nonlinear neural networks affect representational geometry. It shows that these symmetries can be described by three basic feature transformations—addition, duplication, and scaling—allowing a closed‑form decomposition of representations into essential and auxiliary parts. The study further demonstrates that implementation‑level selection rules can resolve the resulting degeneracy, producing identifiable geometries that reflect feature contributions to the network’s function.

By Marvin Theiss, Lukas Braun, Andrew M. Saxe, Erin Grant