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

From MaRDI portal
Publication:6401459

arXiv2206.03832MaRDI QIDQ6401459FDOQ6401459


Authors: Ivan Oseledets Edit this on Wikidata


Publication date: 8 June 2022

Abstract: 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.




Has companion code repository: https://github.com/g-ryzhakov/constructive-tt









This page was built for publication: Constructive TT-representation of the tensors given as index interaction functions with applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6401459)