Bi-Lipschitz Ansatz for Anti-Symmetric Functions
Not on the map. Why?
Abstract (arXiv)
Motivated by applications to the simulation of quantum many-body systems by neural networks, researchers have suggested several models which are antisymmetric by construction, and can approximate all antisymmetric functions. However, these works either require very high computational complexity to attain universal approximation, or suffer from discontinuities. In this paper, we introduce two antisymmetric ansatzes which do not suffer from these disadvantages. The first is based on a bi-Lipschitz embedding with respect to a naturally defined metric. The second is a modular anti-symmetrizing projection framework based on the frame-averaging methodology. Both approaches yield continuous antisymmetric models which attain universal approximation guarantees with a polynomial complexity in problem size. Moreover, for both approaches, we obtain quantitative approximation results that bound the number of parameters required to approximate Lipschitz antisymmetric functions to a given accuracy ε. We also provide preliminary experimental evidence suggesting improved performance in learning antisymmetric functions.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 12 of its 32 references that are in the map. First posted on arXiv 6 Mar 2025.
Builds on
12 of 32 references.
References · 12
- 2017Deep Setscited by 1,394
- 2019Ab-Initio Solution of the Many-Electron Schr"odinger Equation with Deep Neural Networkscited by 195
- 2021Frame Averaging for Invariant and Equivariant Network Designcited by 166
- 2018Optimal approximation of continuous functions by very deep ReLU networkscited by 165
- 2019Deep neural network solution of the electronic Schr"odinger equationcited by 124
- 2019Deep Network Approximation Characterized by Number of Neuronscited by 120
- 2015Provable approximation properties for deep neural networkscited by 60
- 2024Equivariant Frames and the Impossibility of Continuous Canonicalizationcited by 41
- 2022Low Dimensional Invariant Embeddings for Universal Geometric Learningcited by 38
- 2023Neural Injective Functions for Multisets, Measures and Graphs via a Finite Witness Theoremcited by 33
- 2022Permutation Invariant Representations with Applications to Graph Deep Learningcited by 20
- 2020On Representing (Anti)Symmetric Functionscited by 12
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.
- 2025Quantitative Bounds for Sorting-Based Permutation-Invariant Embeddingscited by 2
- 2025Toward bilipshiz geometric modelscited by 1
- 2026Quantitative Approximation Rates for Group Equivariant Learningcited by 1
- 2026Quantitative Approximation Rates for Group Equivariant Learning23 Feb 2026
- 2025Toward bilipshiz geometric models13 Nov 2025
- 2025Quantitative Bounds for Sorting-Based Permutation-Invariant Embeddings25 Oct 2025