Fetching the paper…
Reading the bibliography…
We consider the problem of learning a latent $k$-vertex simplex $K\subset\mathbb{R}^d$, given access to $A\in\mathbb{R}^{d\times n}$, which can be viewed as a data matrix with $n$ points that are obtained by randomly perturbing latent points in the simplex $K$ (potentially beyond $K$).
Perturbation bounds in connection with singular value decomposition
Per-Ake Wedin · 1972
Earlier work this paper cites.
A classification em algorithm for clustering and two stochastic versions
Gilles Celeux and Gérard Govaert · 1992
Earlier work this paper cites.
The em algorithm for mixtures of factor analyzers
Zoubin Ghahramani, Geoffrey E Hinton, et al · 1996
Earlier work this paper cites.
Learning mixtures of arbitrary gaussians
Arora Sanjeev and Ravi Kannan · 2001
Earlier work this paper cites.
Modeling annotated data
David M Blei and Michael I Jordan · 2003
Earlier work this paper cites.
Latent Dirichlet allocation
David Blei, Andrew Ng, and Michael Jordan · 2003
Earlier work this paper cites.
Clustering by using a simplex structure
Marcus Weber · 2003
Earlier work this paper cites.
A spectral algorithm for learning mixture models
Santosh Vempala and Grant Wang · 2004
Earlier work this paper cites.
Correlated topic models
David Blei and John Lafferty · 2006
Earlier work this paper cites.
Dynamic topic models
David M Blei and John D Lafferty · 2006
Earlier work this paper cites.
Graph evolution: Densification and shrinking diameters
Jure Leskovec, Jon M. Kleinberg, and Christos Faloutsos · 2007
Earlier work this paper cites.
Probabilistic topic models
Mark Steyvers and Tom Griffiths · 2007
Earlier work this paper cites.
Mixed membership stochastic blockmodels
Edoardo M. Airoldi, David M. Blei, Stephen E. Fienberg, and Eric P. Xing · 2008
Earlier work this paper cites.
Dynamic mixed membership blockmodel for evolving networks
Wenjie Fu, Le Song, and Eric P Xing · 2009
Earlier work this paper cites.
Nonparametric latent feature models for link prediction
Kurt Miller, Michael I Jordan, and Thomas L Griffiths · 2009
Earlier work this paper cites.
Online learning for latent dirichlet allocation
Matthew Hoffman, Francis R Bach, and David M Blei · 2010
Earlier work this paper cites.
Clustering with spectral norm and the k-means algorithm
Amit Kumar and Ravindran Kannan · 2010
Earlier work this paper cites.
Introduction to the non-asymptotic analysis of random matrices
Roman Vershynin · 2010
Earlier work this paper cites.
A framework for feature selection in clustering
Daniela M Witten and Robert Tibshirani · 2010
Cited alongside, same era.
A state-space mixed membership blockmodel for dynamic network tomography
Eric P Xing, Wenjie Fu, Le Song, et al · 2010
Cited alongside, same era.
Learning mallows models with pairwise preferences, 2011
Tyler Lu and Craig Boutilier · 2011
Cited alongside, same era.
Improved spectral-norm bounds for clustering
Pranjal Awasthi and Or Sheffet · 2012
Cited alongside, same era.
Probabilistic topic models
David M. Blei · 2012
Cited alongside, same era.
Medlda: maximum margin supervised topic models
Jun Zhu, Amr Ahmed, and Eric P Xing · 2012
Cited alongside, same era.
Copula mixed-membership stochastic block model
Xuhui Fan, Richard Yi Da Xu, and Longbing Cao · 2016
Later among the works it cites.
Scalable mcmc for mixed membership stochastic blockmodels
Wenzhe Li, Sungjin Ahn, and Max Welling · 2016
Later among the works it cites.
Cs 598: Theoretical machine learning lecture notes, 2017
Pranjal Awasthi · 2017
Later among the works it cites.
Input sparsity time low-rank approximation via ridge leverage score sampling
Michael B. Cohen, Cameron Musco, and Christopher Musco · 2017
Later among the works it cites.
Learning from untrusted data
Moses Charikar, Jacob Steinhardt, and Gregory Valiant · 2017
Later among the works it cites.
Efficient bayesian estimation from few samples: Community detection and related problems
Samuel B. Hopkins and David Steurer · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A practical algorithm for topic modeling with provable guarantees
Sanjeev Arora, Rong Ge, Yonatan Halpern, David Mimno, Ankur Moitra, David Sontag, Yichen Wu, and Michael Zhu · 2013
Cited alongside, same era.
A practical algorithm for topic modeling with provable guarantees
Sanjeev Arora, Rong Ge, Yoni Halpern, David Mimno, Ankur Moitra, David Sontag, Yichen Wu, and Michael Zhu · 2013
Cited alongside, same era.
Low rank approximation and regression in input sparsity time
Kenneth L Clarkson and David P Woodruff · 2013
Cited alongside, same era.
Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
Xiangrui Meng and Michael W Mahoney · 2013
Cited alongside, same era.
OSNAP: faster numerical linear algebra algorithms via sparser subspace embeddings
Jelani Nelson and Huy L. Nguyen · 2013
Cited alongside, same era.
Introduction to mixed membership models and methods, 2014
Edoardo M. Airoldi, David M. Blei, Elena A. Erosheva, and Stephen E. Fienberg · 2014
Cited alongside, same era.
Sublinear time low-rank approximation of positive semidefinite matrices
Cameron Musco and David P Woodruff · 2017
Later among the works it cites.
Local higher-order graph clustering
Hao Yin, Austin R. Benson, Jure Leskovec, and David F. Gleich · 2017
Later among the works it cites.
List-decodable robust mean estimation and learning mixtures of spherical gaussians
Ilias Diakonikolas, Daniel M Kane, and Alistair Stewart · 2018
Later among the works it cites.
Mixture models, robustness, and sum of squares proofs
Samuel B Hopkins and Jerry Li · 2018
Later among the works it cites.
Robust moment estimation and improved clustering via sum of squares
Pravesh K Kothari, Jacob Steinhardt, and David Steurer · 2018
Later among the works it cites.
Efficiently learning mixtures of mallows models
Allen Liu and Ankur Moitra · 2018
Later among the works it cites.
Robust and sample optimal algorithms for psd low rank approximation
Ainesh Bakshi, Nadiia Chepurko, and David P Woodruff · 2020
Later among the works it cites.
Outlier-robust clustering of non-spherical mixtures
Ainesh Bakshi and Pravesh Kothari · 2020
Later among the works it cites.
Finding a latent k -simplex in O * ( k ⋅ \cdot nnz(data)) time via subset smoothing
Chiranjib Bhattacharyya and Ravindran Kannan · 2020
Later among the works it cites.
Robustly learning any clusterable mixture of gaussians
Ilias Diakonikolas, Samuel B Hopkins, Daniel Kane, and Sushrut Karmalkar · 2020
Later among the works it cites.
Latent simplex position model: High dimensional multi-view clustering with uncertainty quantification
Leo L Duan · 2020
Later among the works it cites.
Nonnegative Matrix Factorization
Nicolas Gillis · 2020
Later among the works it cites.