Constructive TT-representation of the tensors given as index interaction functions with applications

06/08/2022
by   Gleb Ryzhakov, et al.
0

This paper presents a method to build explicit tensor-train (TT) representations. We show that a wide class of tensors can be explicitly represented with sparse TT-cores, obtaining, in many cases, optimal TT-ranks. Numerical experiments show that our method outperforms the existing ones in several practical applications, including game theory problems. Theoretical estimations of the number of operations show that in some problems, such as permanent calculation, our methods are close to the known optimal asymptotics, which are obtained by a completely different type of methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/29/2022

Optimization of Functions Given in the Tensor Train Format

Tensor train (TT) format is a common approach for computationally effici...
research
11/12/2020

Parallel Algorithms for Tensor Train Arithmetic

We present efficient and scalable parallel algorithms for performing mat...
research
04/12/2020

Tensor extrapolation methods with applications

In this paper, we mainly develop the well-known vector and matrix polyno...
research
10/10/2021

Tensor Arnoldi-Tikhonov and GMRES-type methods for ill-posed problems with a t-product structure

This paper describes solution methods for linear discrete ill-posed prob...
research
08/27/2021

Provable Tensor-Train Format Tensor Completion by Riemannian Optimization

The tensor train (TT) format enjoys appealing advantages in handling str...
research
06/28/2018

Sparse Sampling for Inverse Problems with Tensors

We consider the problem of designing sparse sampling strategies for mult...
research
01/28/2023

PROTES: Probabilistic Optimization with Tensor Sampling

We develop new method PROTES for optimization of the multidimensional ar...

Please sign up or login with your details

Forgot password? Click here to reset