Orthogonal Tensor Decomposition
summary
Characterizes which symmetric tensors admit an orthogonal decomposition, proves the orthonormal factors are exactly the robust eigenvectors that attract almost every random initialization under the tensor power map θ ↦ T·θ^{d−1} (iterate, normalize, subtract rank‑1 term, repeat), and shows the ML topic‑model tensor can be turned into an ODECO tensor and efficiently decomposed to recover parameters. Gives exact eigen/singular counts (example: 7 isolated solutions; generic counts from Sturmfels/Cartwright and Friedland–Ottaviani) and conjectures explicit polynomial equations for the ODECO variety.
AI-written summary · about
chapters (15)
- 0:00Intro
- 1:25Symmetric Tensors and Polynomials
- 4:40Orthogonal Tensor Decomposition
- 6:36An Application: Exchangeable Single Topic Models
- 11:29Eigenvectors of Symmetric Tensors
- 16:09Robust Eigenvectors
- 20:41The Number of Eigenvectors of a Tensor
- 21:17Eigenvectors of Odeco Tensors
- 23:34The Set of Odeco Tensors
- 25:12The Odeco Variety
- 27:26Nonsymmetric Tensor Decomposition
- 28:24Nonsymmetric Odeco Tensors
- 30:46Examples
- 34:26The number of singular vector tuples of a tensor
- 34:57Singular Vectors of Odeco Tensors
related talks
52mAverage-Case Overcomplete Tensor Decomposition
01h 11mTensor Decompositions: Uniqueness and Smoothed Analysis
01h 03mRecent Progress in High-Dimensional Learning
53mTensor Decompositions for Learning Latent Variable Models II
56mTensor Decompositions for Learning Latent Variable Models I
39mFast Spectral Algorithms from Sum-of-Squares Analyses
07mTamara Kolda, Distinguished Member of Technical Staff, Sandia National Laboratories @ MLconf SF Part
10mDale Smith, Data Scientist, Nexidia
