流形上逼近Sobolev类的维度祝福
Blessing of Dimensionality for Approximating Sobolev Classes on Manifolds
AI总结:
本文研究流形上逼近有界Sobolev类所需的统计复杂度下界,证明该下界仅依赖于流形的曲率、体积和单射半径等内在性质,而与嵌入环境维度无关。
摘要:
流形假说认为,自然的高维数据位于或围绕在一个低维流形上。近年来,统计方法和基于学习的方法在极高维度上的成功从经验上支持了这一假说,表明典型的最坏情况分析并不能提供实用的保证。因此,分析的一个自然步骤是假设流形假说成立,并推导出与数据可能嵌入的任何环境维度无关的界。最近,这一方向的理论意义已在ReLU网络的泛化和Langevin方法的收敛性方面得到探讨。在这项工作中,我们考虑用有限统计复杂度的函数进行最优一致逼近。虽然文献中已经存在使用ReLU神经网络的一致逼近上界,但我们考虑相反的方向:用下界来量化流形上逼近的基本难度。特别地,我们证明了在紧流形上逼近一类有界Sobolev函数所需的统计复杂度具有下界,而且该下界仅依赖于流形的内在性质,例如曲率、体积和单射半径。
英文摘要:
The manifold hypothesis says that natural high-dimensional data lie on or around a low-dimensional manifold. The recent success of statistical and learning-based methods in very high dimensions empirically supports this hypothesis, suggesting that typical worst-case analysis does not provide practical guarantees. A natural step for analysis is thus to assume the manifold hypothesis and derive bounds that are independent of any ambient dimensions that the data may be embedded in. Theoretical implications in this direction have recently been explored in terms of generalization of ReLU networks and convergence of Langevin methods. In this work, we consider optimal uniform approximations with functions of finite statistical complexity. While upper bounds on uniform approximation exist in the literature using ReLU neural networks, we consider the opposite: lower bounds to quantify the fundamental difficulty of approximation on manifolds. In particular, we demonstrate that the statistical complexity required to approximate a class of bounded Sobolev functions on a compact manifold is bounded from below, and moreover that this bound is dependent only on the intrinsic properties of the manifold, such as curvature, volume, and injectivity radius.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。