Symmetric Tensor Completion from Multilinear Entries and Learning Product Mixtures over the Hypercube

Renè Peeters, Orthogonal representations over finite fields and the chromatic number of graphs , Combinatorica 16

1996

Earlier work this paper cites.

Yoav Freund and Yishay Mansour, Estimating a mixture of two product distributions , Proceedings of the Twelfth Annual Conference on Computational Learning Theory, COLT Santa Cruz, CA, USA, July 7-9, 1999, pp. 53–62

1999

Earlier work this paper cites.

Mary Cryan, Leslie Ann Goldberg, and Paul W. Goldberg, Evolutionary trees can be learned in polynomial time in the two-state general markov model , SIAM J. Comput. 31

2001

Earlier work this paper cites.

Elchanan Mossel, Ryan O’Donnell, and Rocco A. Servedio, Learning functions of k relevant variables , J. Comput. Syst. Sci. 69

2004

Earlier work this paper cites.

Dimitris Achlioptas and Frank McSherry, On spectral learning of mixtures of distributions , Learning Theory, 18th Annual Conference on Learning Theory, COLT, 2005, pp. 458–469

2005

Earlier work this paper cites.

Elchanan Mossel and Sébastien Roch, Learning nonsingular phylogenies and hidden markov models , The Annals of Applied Probability 16

2006

Earlier work this paper cites.

Vitaly Feldman, Attribute-efficient and non-adaptive learning of parities and DNF expressions , Journal of Machine Learning Research 8

2007

Earlier work this paper cites.

Lieven De Lathauwer, Joséphine Castaing, and Jean-François Cardoso, Fourth-order cumulant-based blind identification of underdetermined mixtures , IEEE Transactions on Signal Processing 55

2007

Earlier work this paper cites.

Kamalika Chaudhuri and Satish Rao, Learning mixtures of product distributions using correlations and independence , 21st Annual Conference on Learning Theory - COLT 2008, Helsinki, Finland, July 9-12, 2008, 2008, pp. 9–20

2008

Earlier work this paper cites.

Jon Feldman, Ryan O’Donnell, and Rocco A. Servedio, Learning mixtures of product distributions over discrete domains , SIAM J. Comput. 37

2008

Earlier work this paper cites.

Emmanuel J. Candès and Yaniv Plan, Matrix completion with noise , CoRR abs/0903.3131

Original

2009

Earlier work this paper cites.

Emmanuel J. Candès and Benjamin Recht, Exact matrix completion via convex optimization , Foundations of Computational Mathematics 9

2009

Cited alongside, same era.

Benjamin Recht, A simpler approach to matrix completion , CoRR abs/0910.0651

Original

2009

Cited alongside, same era.

Oded Regev, On lattices, learning with errors, random linear codes, and cryptography , J. ACM 56

2009

Cited alongside, same era.

Daniel Hsu, Sham M. Kakade, and Tong Zhang, Robust matrix decomposition with sparse corruptions , IEEE Transactions on Information Theory 57

2011

Cited alongside, same era.

Animashree Anandkumar, Daniel Hsu, and Sham M. Kakade, A method of moments for mixture models and hidden markov models , COLT 2012 - The 25th Annual Conference on Learning Theory, June 25-27, 2012, Edinburgh, Scotland, 2012, pp. 33.1–33.34

Anima Anandkumar, Rong Ge, and Majid Janzamin, Analyzing tensor power method dynamics: Applications to learning overcomplete latent variable models , CoRR abs/1411.1488

Original

2014

Later among the works it cites.

Animashree Anandkumar, Rong Ge, and Majid Janzamin, Guaranteed non-orthogonal tensor decomposition via alternating rank-1 updates , CoRR abs/1402.5180

Original

2014

Later among the works it cites.

Aditya Bhaskara, Moses Charikar, Ankur Moitra, and Aravindan Vijayaraghavan, Smoothed analysis of tensor decompositions , Symposium on Theory of Computing, STOC, 2014

2014

Later among the works it cites.

Moritz Hardt, Understanding alternating minimization for matrix completion , 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, 2014, pp. 651–660

2014

Later among the works it cites.