Papers › Fitting Low-Rank Tensors in Constant Time
Fitting Low-Rank Tensors in Constant Time
Kohei Hayashi, Yuichi Yoshida
In this paper, we develop an algorithm that approximates the residual error of Tucker decomposition, one of the most popular tensor decomposition methods, with a provable guarantee. Given an order-K tensor X∈ℝ^(N₁×⋯×N_K), our algorithm randomly samples a constant number s of indices for each mode and creates a ``mini'' tensor X̃∈ℝ^(s×⋯×s), whose elements are given by the intersection of the sampled indices on X. Then, we show that the residual error of the Tucker decomposition of X̃ is sufficiently close to that of X with high probability. This result implies that we can figure out how much we can fit a low-rank tensor to X \emph{in constant time}, regardless of the size of X. This is useful for guessing the favorable rank of Tucker decomposition. Finally, we demonstrate how the sampling method works quickly and accurately using multiple real datasets.
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.
Tasks
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