Quasi-Equivariant Metanetworks
Viet-Hoang Tran, An Nguyen The, Benoît Guérand, Thieu Vo, Tan Minh Nguyen
Abstract
Metanetworks are neural architectures designed to operate directly on pretrained weights to perform downstream tasks. However, the parameter space serves only as a proxy for the underlying function class, and the parameter-function mapping is inherently non-injective: distinct parameter configurations may yield identical input-output behaviors. As a result, metanetworks that rely solely on raw parameters risk overlooking the intrinsic symmetries of the architecture. Reasoning about functional identity is therefore essential for effective metanetwork design, motivating the development of equivariant metanetworks, which incorporate equivariance principles to respect architectural symmetries. Existing approaches, however, typically enforce strict equivariance, which imposes rigid constraints and often leads to sparse and less expressive models. To address this limitation, we introduce the novel concept of quasi-equivariance, which allows metanetworks to move beyond the rigidity of strict equivariance while still preserving functional identity. We lay down a principled basis for this framework and demonstrate its broad applicability across diverse neural architectures, including feedforward, convolutional, and transformer networks. Through empirical evaluation, we show that quasi-equivariant metanetworks achieve good trade-offs between symmetry preservation and representational expressivity. These findings advance the theoretical understanding of weight-space learning and provide a principled foundation for the design of more expressive and functionally robust metanetworks.
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 706bf990-2db0-41cd-8cca-2c517b9efb39Cited by top-tier papers2
- Tree-sliced Sobolev IPMViet-Hoang Tran, Thanh Q. Tran, Thanh T. Chu, Duy-Tung Pham et al.ICLR 2026
- Revisiting Tree-Sliced Wasserstein Distance Through the Lens of the Fermat-Weber ProblemViet-Hoang Tran, Thanh Q. Tran, Thanh T. Chu, Trung-Khang Tran et al.ICLR 2026
Builds on37
- Implicit Neural Representations with Periodic Activation FunctionsVincent Sitzmann, Julien N. P. Martel, Alexander W. Bergman, David B. Lindell et al.NeurIPS 2020 · 4,008 citations
- E(n) Equivariant Graph Neural NetworksVictor Garcia Satorras, Emiel Hoogeboom, Max WellingICML 2021 · 1,432 citations
- Fast Model Editing at ScaleEric Mitchell, Charles Lin, Antoine Bosselut, Chelsea Finn et al.ICLR 2022 · 527 citations
- Editable Neural NetworksAnton Sinitsin, Vsevolod Plokhotnyuk, Dmitry V. Pyrkin, Sergei Popov et al.ICLR 2020 · 210 citations
- From data to functa: Your data point is a function and you can treat it like oneEmilien Dupont, Hyunjik Kim, S. M. Ali Eslami, Danilo Jimenez Rezende et al.ICML 2022 · 209 citations
Related papers
- Graph Metanetworks for Processing Diverse Neural ArchitecturesDerek Lim, Haggai Maron, Marc T. Law, Jonathan Lorraine et al.ICLR 2024 · 47 citations
- On the Expressive Power of Permutation-Equivariant Weight-Space NetworksAdir Dayan, Yam Eitan, Haggai MaronICML 2026
- Equivariant Architectures for Learning in Deep Weight SpacesAviv Navon, Aviv Shamsian, Idan Achituve, Ethan Fetaya et al.ICML 2023 · 101 citations
- Graph Neural Networks for Learning Equivariant Representations of Neural NetworksMiltiadis Kofinas, Boris Knyazev, Yan Zhang, Yunlu Chen et al.ICLR 2024 · 57 citations
- Relaxing Equivariance Constraints with Non-stationary Continuous FiltersTycho F. A. van der Ouderaa, David W. Romero, Mark van der WilkNeurIPS 2022 · 51 citations
