Papers › Orthogonal Decomposition of Tensor Trains
Orthogonal Decomposition of Tensor Trains
Karim Halaseh, Tommi Muller, Elina Robeva
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this paper we study the problem of decomposing a given tensor into a tensor train such that the tensors at the vertices are orthogonally decomposable. When the tensor train has length two, and the orthogonally decomposable tensors at the two vertices are symmetric, we recover the decomposition by considering random linear combinations of slices. Furthermore, if the tensors at the vertices are symmetric and low-rank but not orthogonally decomposable, we show that a whitening procedure can transform the problem into the orthogonal case. When the tensor network has length three or more and the tensors at the vertices are symmetric and orthogonally decomposable, we provide an algorithm for recovering them subject to some rank conditions. Finally, in the case of tensor trains of length two in which the tensors at the vertices are orthogonally decomposable but not necessarily symmetric, we show that the decomposition problem reduces to the novel problem of decomposing a matrix into an orthogonal matrix multiplied by diagonal matrices on either side. We provide and compare two solutions, one based on Sinkhorn's theorem and one on Procrustes' algorithm. We conclude with a multitude of open problems in linear and multilinear algebra that arose in our study.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections