Relative Error Tensor Low Rank Approximation
summary
Shows an algorithm that outputs a rank R = O(K^2/ε^2) tensor achieving Frobenius (1+ε) relative error to the best rank-K solution, runs in input-sparsity time NZ(A)+n·poly(K/ε), and yields a true rank-K solution with extra 2^{O(K^2/ε^2)} overhead (fixed-parameter tractable). Technique is an iterative existential sketching using three flattenings and small Gaussian sketches; also gives CUR-style column/row/tube selection, handles other robust norms, and notes border-rank pathologies that require tiny additive slack.
AI-written summary · about
chapters (11)
- 0:00Intro
- 0:21What is Tensor?
- 2:05Matrix Low Rank Approximation (Frobenius Norm)
- 6:01Tensor Low Rank Approximation (Frobenius Norm)
- 12:35Real-life Tensor Datasets
- 14:51Main Question, Tensor Low Rank Approximation
- 24:36Main Bicriteria Algorithm
- 26:08Main Rank-k Algorithm
- 28:03Matrix CUR Decomposition Question
- 35:18Hardness - Under Exponential Time Hypothesis
- 41:05iterative Existential Argument
related talks
48mRandomized Numerical Linear Algebra
35mSampling for Subset Selection and Applications
37mLow-rank Matrix Completion: Adaptive Sampling Can Help When, How?
01h 09mSketching High-Dimensional Data
01h 10mSketching High-Dimensional Data
01h 03mSketching as a Tool for Numerical Linear Algebra
01h 13mSketching High-Dimensional Data
46mSpectral Sparsification of Graphs
