Uniqueness of Tensor Decomposition and Identifiability in Mixture Models
summary
Proves a robust version of Kruskal’s uniqueness: if the robust Kruskal ranks of the factor matrices sum to at least 2r+2, any tensor within ε' (where ε' is polynomially related to ε) has a rank‑r decomposition whose factors are within ε up to permutation. Uses tensor slice inner products, a permutation lemma, sunflower‑style combinatorics and a refined downward induction to replace the usual exponential error blowup with polynomial stability (1/poly noise → 1/poly parameter error). Leaves open a polynomial‑time algorithm under only Kruskal’s condition.
AI-written summary · about
chapters (16)
- 0:00Intro
- 0:18Background: "understanding" data
- 1:01Topic model for documents
- 3:18What about tensors?
- 4:27Recipe for tensor methods in mixture models
- 5:24Two caveats
- 9:11A success story: the full rank case
- 15:49Beyond non degeneracy
- 17:31Kruskal's theorem (1977)
- 22:07Our result
- 24:43Remarks
- 27:03Proof overview
- 32:13Downward induction: base case SI = (n - 1)
- 40:09Making things robust - permutation lemma
- 41:34Issue with inductive proof
- 43:02Directions
related talks
01h 11mTensor Decompositions: Uniqueness and Smoothed Analysis
01h 03mRecent Progress in High-Dimensional Learning
53mTensor Decompositions for Learning Latent Variable Models II
52mAverage-Case Overcomplete Tensor Decomposition
56mTensor Decompositions for Learning Latent Variable Models I
43mGeometric Complexity Theory and Tensor Rank
44mMixture Models, Robustness, and Sum of Squares Proofs
45mNoisy Estimation of Simultaneously Structured Models
