~/talk

Uniqueness of Tensor Decomposition and Identifiability in Mixture Models

links:none on file
slides:none on file

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

  1. 0:00Intro
  2. 0:18Background: "understanding" data
  3. 1:01Topic model for documents
  4. 3:18What about tensors?
  5. 4:27Recipe for tensor methods in mixture models
  6. 5:24Two caveats
  7. 9:11A success story: the full rank case
  8. 15:49Beyond non degeneracy
  9. 17:31Kruskal's theorem (1977)
  10. 22:07Our result
  11. 24:43Remarks
  12. 27:03Proof overview
  13. 32:13Downward induction: base case SI = (n - 1)
  14. 40:09Making things robust - permutation lemma
  15. 41:34Issue with inductive proof
  16. 43:02Directions
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.