Overcomplete Order-3 Tensor Decomposition, Blind Deconvolution, and Gaussian Mixture Models
From MaRDI portal
Publication:5065479
DOI10.1137/21M1399415zbMath1485.15032arXiv2007.08133OpenAlexW3042800299MaRDI QIDQ5065479
Publication date: 21 March 2022
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.08133
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Multilinear algebra, tensor calculus (15A69) Randomized algorithms (68W20) Computational aspects of data analysis and big data (68T09)
Cites Work
- Unnamed Item
- Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Canonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition
- High-Dimensional Covariance Decomposition into Sparse Markov and Independence Models
- Learning Mixtures of Gaussians in High Dimensions
- Learning mixtures of spherical gaussians
- A Decomposition for Three-Way Arrays
- Fourth-Order Cumulant-Based Blind Identification of Underdetermined Mixtures
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Spectral Learning on Matrices and Tensors
- A simple proof of the Gaussian correlation conjecture extended to multivariate gamma distributions
- Fourier PCA and robust tensor decomposition
- Smoothed analysis of tensor decompositions
- Royen’s Proof of the Gaussian Correlation Inequality
- Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms
- Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
- On Certain Inequalities for Normal Distributions and their Applications to Simultaneous Confidence Bounds
- Rectangular Confidence Regions for the Means of Multivariate Normal Distributions
