Linear-Scaling Tensor Train Sketching
Paul Cazeaux, Mi-Song Dupuy, Rodrigo Figueroa Justiniano

TL;DR
This paper introduces the TTStack sketch, a new structured random projection for tensor train formats that achieves linear scaling in tensor order and subspace dimension, improving efficiency over previous methods.
Contribution
The paper proposes TTStack, a unified TT-adapted sketching operator with provable subspace embedding and injection properties, reducing exponential scaling issues in tensor train sketching.
Findings
TTStack satisfies OSE and OSI properties with linear dependence on tensor order
Provides quasi-optimal error bounds for tensor factorizations
Numerical experiments confirm theoretical advantages
Abstract
We introduce the TTStack sketch, a structured random projection tailored to the tensor train (TT) format that unifies existing TT-adapted sketching operators. By varying two integer parameters and , TTStack interpolates between the Khatri-Rao sketch () and the Gaussian TT sketch (). We prove that TTStack satisfies an oblivious subspace embedding (OSE) property with parameters and , and an oblivious subspace injection (OSI) property under the condition and . Both guarantees depend only linearly on the tensor order and on the subspace dimension , in contrast to prior constructions that suffer from exponential scaling in . As direct consequences, we derive quasi-optimal error bounds for the QB factorization and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Quantum many-body systems · Stochastic Gradient Optimization Techniques
