Spectral tensor-train decomposition

Abstract

The accurate approximation of high-dimensional functions is an essential task in uncertainty quantification and many other fields. We propose a new function approximation scheme based on a spectral extension of the tensor-train (TT) decomposition. We first define a functional version of the TT decomposition and analyze its properties. We obtain results on the convergence of the decomposition, revealing links between the regularity of the function, the dimension of the input space, and the TT ranks. We also show that the regularity of the target function is preserved by the univariate functions (i.e., the "cores") comprising the functional TT decomposition. This result motivates an approximation scheme employing polynomial approximations of the cores. For functions with appropriate regularity, the resulting \textit{spectral tensor-train decomposition} combines the favorable dimension-scaling of the TT decomposition with the spectral convergence rate of polynomial approximations, yielding efficient and accurate surrogates for high-dimensional functions. To construct these decompositions, we use the sampling algorithm \texttt{TT-DMRG-cross} to obtain the TT decomposition of tensors resulting from suitable discretizations of the target function. We assess the performance of the method on a range of numerical examples: a modifed set of Genz functions with dimension up to $100$, and functions with mixed Fourier modes or with local features. We observe significant improvements in performance over an anisotropic adaptive Smolyak approach. The method is also used to approximate the solution of an elliptic PDE with random input data. The open source software and examples presented in this work are available online.

33 pages, 19 figures

References in corpus (2)

• Enabling High-Dimensional Hierarchical Uncertainty Quantification by ANOVA and Tensor-Train Decomposition
• Computation of the Response Surface in the Tensor Train data format

Cited by in corpus (28)

• Enabling High-Dimensional Hierarchical Uncertainty Quantification by ANOVA and Tensor-Train Decomposition
• Long-term Forecasting using Higher Order Tensor RNNs
• Tensor Networks for Big Data Analytics and Large-Scale Optimization Problems
• Gradient-based Optimization for Regression in the Functional Tensor-Train Format
• Deep composition of tensor-trains using squared inverse Rosenblatt transports
• Functional Tucker approximation using Chebyshev interpolation
• Dynamic tensor approximation of high-dimensional nonlinear PDEs
• Ergodic Exploration using Tensor Train: Applications in Insertion Tasks
• Tensor-train approximation of the chemical master equation and its application for parameter inference
• FFT-based homogenisation accelerated by low-rank tensor approximations
• Efficient uncertainty quantification of a fully nonlinear and dispersive water wave model with random inputs
• Probabilistic Power Flow Computation via Low-Rank and Sparse Tensor Recovery
• Tensor rank reduction via coordinate flows
• Performance of the low-rank tensor-train SVD (TT-SVD) for large dense tensors on modern multi-core CPUs
• Fast global spectral methods for three-dimensional partial differential equations
• Learning to solve Bayesian inverse problems: An amortized variational inference approach using Gaussian and Flow guides
• Improved resource-tunable near-term quantum algorithms for transition probabilities, with applications in physics and variational quantum linear algebra
• Approximation in the extended functional tensor train format
• The State Preparation of Multivariate Normal Distributions using Tree Tensor Network
• Adaptive Gaussian Process Regression for Efficient Building of Surrogate Models in Inverse Problems
• Approximate and integrate: Variance reduction in Monte Carlo integration via function approximation
• Probabilistic partition of unity networks for high-dimensional regression problems
• Tensor Ring Decomposition: Optimization Landscape and One-loop Convergence of Alternating Least Squares
• Visualization of High-dimensional Scalar Functions Using Principal Parameterizations
• Approximating maps into manifolds with lower curvature bounds
• Tensor Approximation of Advanced Metrics for Sensitivity Analysis
• Spectral Tensor Train Parameterization of Deep Learning Layers
• A survey of unsupervised learning methods for high-dimensional uncertainty quantification in black-box-type problems