Learning (Approximately) Equivariant Networks via Constrained Optimization
Andrei Manolache, Luiz F.O. Chamon, Mathias Niepert

TL;DR
This paper introduces ACE, a constrained optimization method that gradually enforces equivariance in neural networks, improving their adaptability, performance, and robustness when perfect symmetry assumptions are not fully met in real data.
Contribution
The paper proposes a homotopy-inspired approach to smoothly transition from flexible to equivariant models, addressing limitations of strict equivariance and heuristic relaxations.
Findings
ACE improves accuracy and robustness across multiple architectures.
It enhances sample efficiency compared to strictly equivariant models.
ACE demonstrates better handling of symmetry-breaking in real data.
Abstract
Equivariant neural networks are designed to respect symmetries through their architecture, boosting generalization and sample efficiency when those symmetries are present in the data distribution. Real-world data, however, often departs from perfect symmetry because of noise, structural variation, measurement bias, or other symmetry-breaking effects. Strictly equivariant models may struggle to fit the data, while unconstrained models lack a principled way to leverage partial symmetries. Even when the data is fully symmetric, enforcing equivariance can hurt training by limiting the model to a restricted region of the parameter space. Guided by homotopy principles, where an optimization problem is solved by gradually transforming a simpler problem into a complex one, we introduce Adaptive Constrained Equivariance (ACE), a constrained optimization approach that starts with a flexible,…
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
Taxonomy
TopicsFace and Expression Recognition · Neural Networks and Applications · Machine Learning and Algorithms
