A lifting trick plus an approximate Richardson analysis turns fast tensor-decomposition algorithms into sublinear-per-round tensor-completion algorithms with a (1+O(1))-approximation guarantee.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Fast Tensor Completion via Approximate Richardson Iteration
A lifting trick plus an approximate Richardson analysis turns fast tensor-decomposition algorithms into sublinear-per-round tensor-completion algorithms with a (1+O(1))-approximation guarantee.