Exact and Efficient Representation of Totally Anti-Symmetric Functions

• URL: http://arxiv.org/abs/2311.05064v1
• Date: Thu, 9 Nov 2023 00:03:11 GMT
• Title: Exact and Efficient Representation of Totally Anti-Symmetric Functions
• Authors: Ziang Chen, Jianfeng Lu
• Abstract summary: We prove that this ansatz can exactly represent every anti-symmetric and continuous function. The number of basis functions has efficient scaling with respect to dimension.
• Score: 11.339994986470895
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper concerns the long-standing question of representing (totally) anti-symmetric functions in high dimensions. We propose a new ansatz based on the composition of an odd function with a fixed set of anti-symmetric basis functions. We prove that this ansatz can exactly represent every anti-symmetric and continuous function and the number of basis functions has efficient scaling with respect to dimension (number of particles).

Related papers

• Symmetry & Critical Points [7.23389716633927]
  Critical points of an invariant function may or may not be symmetric. We prove, however, that if a symmetric critical point exists adjacent to it are generic.
  arXiv  Detail & Related papers  (2024-08-26T17:36:51Z)
• $\widetilde{O}(N^2)$ Representation of General Continuous Anti-symmetric Function [41.1983944775617]
  In quantum mechanics, the wave function of fermion systems such as many-body electron systems are anti-symmetric and continuous. We prove that our ansatz can represent any AS continuous functions, and can accommodate the determinant-based structure proposed by Hutter.
  arXiv  Detail & Related papers  (2024-02-23T07:59:41Z)
• A Unified Framework for Discovering Discrete Symmetries [17.687122467264487]
  We consider the problem of learning a function respecting a symmetry from among a class of symmetries. We develop a unified framework that enables symmetry discovery across a broad range of subgroups.
  arXiv  Detail & Related papers  (2023-09-06T10:41:30Z)
• Anti-symmetric Barron functions and their approximation with sums of determinants [1.8076403084528587]
  A fundamental problem in quantum physics is to encode functions that are completely anti-symmetric under permutations of identical particles. By explicitly encoding the anti-symmetric structure, we prove that the anti-symmetric functions which belong to the Barron space can be efficiently approximated with sums of determinants.
  arXiv  Detail & Related papers  (2023-03-22T18:31:15Z)
• Kernel-based off-policy estimation without overlap: Instance optimality beyond semiparametric efficiency [53.90687548731265]
  We study optimal procedures for estimating a linear functional based on observational data. For any convex and symmetric function class $mathcalF$, we derive a non-asymptotic local minimax bound on the mean-squared error.
  arXiv  Detail & Related papers  (2023-01-16T02:57:37Z)
• Towards Antisymmetric Neural Ansatz Separation [48.80300074254758]
  We study separations between two fundamental models of antisymmetric functions, that is, functions $f$ of the form $f(x_sigma(1), ldots, x_sigma(N)) These arise in the context of quantum chemistry, and are the basic modeling tool for wavefunctions of Fermionic systems.
  arXiv  Detail & Related papers  (2022-08-05T16:35:24Z)
• Learning PSD-valued functions using kernel sums-of-squares [94.96262888797257]
  We introduce a kernel sum-of-squares model for functions that take values in the PSD cone. We show that it constitutes a universal approximator of PSD functions, and derive eigenvalue bounds in the case of subsampled equality constraints. We then apply our results to modeling convex functions, by enforcing a kernel sum-of-squares representation of their Hessian.
  arXiv  Detail & Related papers  (2021-11-22T16:07:50Z)
• Causal Inference Under Unmeasured Confounding With Negative Controls: A Minimax Learning Approach [84.29777236590674]
  We study the estimation of causal parameters when not all confounders are observed and instead negative controls are available. Recent work has shown how these can enable identification and efficient estimation via two so-called bridge functions.
  arXiv  Detail & Related papers  (2021-03-25T17:59:19Z)
• A Functional Perspective on Learning Symmetric Functions with Neural Networks [48.80300074254758]
  We study the learning and representation of neural networks defined on measures. We establish approximation and generalization bounds under different choices of regularization. The resulting models can be learned efficiently and enjoy generalization guarantees that extend across input sizes.
  arXiv  Detail & Related papers  (2020-08-16T16:34:33Z)
• On Representing (Anti)Symmetric Functions [19.973896010415977]
  We derive natural approximations in the symmetric case, and approximations based on a single generalized Slater in the anti-symmetric case. We provide a complete and explicit proof of the Equivariant MultiLayer Perceptron, which implies universality of symmetric universalitys and the FermiNet.
  arXiv  Detail & Related papers  (2020-07-30T08:23:33Z)
• Invariant Feature Coding using Tensor Product Representation [75.62232699377877]
  We prove that the group-invariant feature vector contains sufficient discriminative information when learning a linear classifier. A novel feature model that explicitly consider group action is proposed for principal component analysis and k-means clustering.
  arXiv  Detail & Related papers  (2019-06-05T07:15:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.