arXiv:2503.04263cs.LGmath.CA2025-03被引 4

提出两种新型连续抗对称模型,实现多项式复杂度的通用逼近。

Bi-Lipschitz Ansatz for Anti-Symmetric Functions

  • 基于双利普希茨嵌入和框架平均投影构建抗对称结构
  • 在多项式复杂度下实现对利普希茨抗对称函数的定量逼近
  • 适合量子多体系统模拟,兼具稳定性与可训练性

为应对神经网络模拟量子多体系统的需要,现有抗对称模型或计算复杂度过高,或存在不连续问题。本文提出两种新抗对称结构:一是基于自然度量下的双利普希茨嵌入,二是基于框架平均法的模块化抗对称投影框架。二者均保证连续性,并在问题规模的多项式复杂度下实现通用逼近。同时,给出了逼近精度为ε时所需参数数量的量化上界。初步实验表明其在学习抗对称函数方面表现更优。

原文摘要 · Abstract (English)

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.

抗对称模型量子模拟神经网络通用逼近

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。