高维函数的树张量网络近似:Sobolev函数与组合函数
Approximation by tree tensor networks in high dimensions: Sobolev and compositional functions
AI总结:
本文提出利用树张量网络近似高维函数,特别是Sobolev函数和组合函数,解决了维度诅咒问题并提供了构造性编码方法。
摘要:
本文关注高维函数从多个模型类中完全离散树张量网络近似的收敛估计。对于具有标准或混合Sobolev正则性的函数,获得新的估计,这些估计推广并细化已知结果,基于多变量函数的线性宽度概念。在本文的主要结果中,这些技术应用于具有组合结构的函数类,这类函数已知特别适合由深度神经网络近似。如本文所示,此类函数也可通过树张量网络近似,而不受维度诅咒——然而,这需要某些条件,特别是对底层树的深度有一定的限制。此外,还给出了将组合函数构造性地编码到树张量网络中的方法。
英文摘要:
This paper is concerned with convergence estimates for fully discrete tree tensor network approximations of high-dimensional functions from several model classes. For functions having standard or mixed Sobolev regularity, new estimates generalizing and refining known results are obtained, based on notions of linear widths of multivariate functions. In the main results of this paper, such techniques are applied to classes of functions with compositional structure, which are known to be particularly suitable for approximation by deep neural networks. As shown here, such functions can also be approximated by tree tensor networks without a curse of dimensionality -- however, subject to certain conditions, in particular on the depth of the underlying tree. In addition, a constructive encoding of compositional functions in tree tensor networks is given.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。