Approximation by tree tensor networks in high dimensions: Sobolev and compositional functions
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 n...
Saved in:
Main Authors | , , |
---|---|
Format | Journal Article |
Language | English |
Published |
2023
|
Subjects | |
Online Access | Get full text |
DOI | 10.48550/arxiv.2112.01474 |
Cover
Loading…
Summary: | 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. |
---|---|
DOI: | 10.48550/arxiv.2112.01474 |