arXiv Analytics

Sign in

arXiv:2209.14808 [math.NA]AbstractReferencesReviewsResources

Optimization of Functions Given in the Tensor Train Format

Andrei Chertkov, Gleb Ryzhakov, Georgii Novikov, Ivan Oseledets

Published 2022-09-29Version 1

Tensor train (TT) format is a common approach for computationally efficient work with multidimensional arrays, vectors, matrices, and discretized functions in a wide range of applications, including computational mathematics and machine learning. In this work, we propose a new algorithm for TT-tensor optimization, which leads to very accurate approximations for the minimum and maximum tensor element. The method consists in sequential tensor multiplications of the TT-cores with an intelligent selection of candidates for the optimum. We propose the probabilistic interpretation of the method, and make estimates on its complexity and convergence. We perform extensive numerical experiments with random tensors and various multivariable benchmark functions with the number of input dimensions up to $100$. Our approach generates a solution close to the exact optimum for all model problems, while the running time is no more than $50$ seconds on a regular laptop.

Comments: 16 page, 3 figures, 3 tables
Categories: math.NA, cs.NA, math.OC
Subjects: 65D15, 65K10
Related articles: Most relevant | Search more
arXiv:2102.08143 [math.NA] (Published 2021-02-16)
Solution of the Fokker-Planck equation by cross approximation method in the tensor train format
arXiv:2208.03380 [math.NA] (Published 2022-08-05)
Black box approximation in the tensor train format initialized by ANOVA decomposition
arXiv:2102.00104 [math.NA] (Published 2021-01-29)
Performance of low-rank approximations in tensor train format (TT-SVD) for large dense tensors