Smoothed analysis for tensor methods in unsupervised learning
From MaRDI portal
Publication:2144543
DOI10.1007/s10107-020-01577-zzbMath1487.68190OpenAlexW3097019854MaRDI QIDQ2144543
Aidao Chen, Aidan Perreault, Aravindan Vijayaraghavan, Aditya Bhaskara
Publication date: 14 June 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-020-01577-z
Learning and adaptive systems in artificial intelligence (68T05) Multilinear algebra, tensor calculus (15A69) Computational aspects of data analysis and big data (68T09)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Identifiability of parameters in latent structure models with many observed variables
- Rank and optimal computation of generic tensors
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Blind Identification of Overcomplete MixturEs of sources (BIOME)
- Decoupling inequalities for the tail probabilities of multivariate \(U\)- statistics
- The Littlewood-Offord problem and invertibility of random matrices
- Semialgebraic Geometry of Nonnegative Tensor Rank
- Tensor decompositions for learning latent variable models
- Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method
- Learning Mixtures of Gaussians in High Dimensions
- Tensor rank is NP-complete
- Least Median of Squares Regression
- The Application of Hidden Markov Models in Speech Recognition
- Smoothed analysis of algorithms
- Fourth-Order Cumulant-Based Blind Identification of Underdetermined Mixtures
- Minimal Realization Problems for Hidden Markov Models
- On Generic Identifiability of 3-Tensors of Small Rank
- Pareto Optimal Solutions for Smoothed Analysts
- Smoothed Analysis of Local Search for the Maximum-Cut Problem
- Local max-cut in smoothed polynomial time
- Learning and Smoothed Analysis
- Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable
- An Algorithm For Generic and Low-Rank Specific Identifiability of Complex Tensors
- A useful variant of the Davis–Kahan theorem for statisticians
- Fourier PCA and robust tensor decomposition
- Smoothed analysis of tensor decompositions
- Symmetric Tensors and Symmetric Tensor Rank
- Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
- Typical Properties of Winners and Losers [0.2ex in Discrete Optimization]
- The Rotation of Eigenvectors by a Perturbation. III
- Perturbation bounds in connection with singular value decomposition
- Distributional and \(L^q\) norm inequalities for polynomials over convex bodies in \(\mathbb{R}^n\)
This page was built for publication: Smoothed analysis for tensor methods in unsupervised learning
