Papers
Topics
Authors
Recent
Search
2000 character limit reached

Linear-Scaling Tensor Train Sketching

Published 11 Mar 2026 in math.NA and cs.DS | (2603.11009v1)

Abstract: We introduce the Block Sparse Tensor Train (BSTT) sketch, a structured random projection tailored to the tensor train (TT) format that unifies existing TT-adapted sketching operators. By varying two integer parameters PP and RR, BSTT interpolates between the Khatri-Rao sketch (R=1R=1) and the Gaussian TT sketch (P=1P=1). We prove that BSTT satisfies an oblivious subspace embedding (OSE) property with parameters R=O(d(r+log1/δ))R = \mathcal{O}(d(r+\log 1/δ)) and P=O(ε<sup>2)P = \mathcal{O}(\varepsilon<sup>{-2}), and an oblivious subspace injection (OSI) property under the condition R=O(d)R = \mathcal{O}(d) and P=O(ε<sup>2(r</sup>+logr/δ))P = \mathcal{O}(\varepsilon<sup>{-2}(r</sup> + \log r/δ)). Both guarantees depend only linearly on the tensor order dd and on the subspace dimension rr, in contrast to prior constructions that suffer from exponential scaling in dd. As direct consequences, we derive quasi-optimal error bounds for the QB factorization and randomized TT rounding. The theoretical results are supported by numerical experiments on synthetic tensors, Hadamard products, and a quantum chemistry application.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.