Fetching the paper…
Reading the bibliography…
We give new algorithms based on the sum-of-squares method for tensor decomposition.
Chandler Davis and W. M. Kahan, The rotation of eigenvectors by a perturbation. iii , SIAM Journal on Numerical Analysis 7
1970
Earlier work this paper cites.
Martin Grötschel, László Lovász, and Alexander Schrijver, The ellipsoid method and its consequences in combinatorial optimization , Combinatorica 1
1981
Earlier work this paper cites.
N. Z. Shor, An approach to obtaining global extrema in polynomial problems of mathematical programming , Kibernetika (Kiev) (1987), no. 5, 102–106, 136. MR 931698 (89d:90202)
1987
Earlier work this paper cites.
Johan Håstad, Tensor rank is np-complete , J. Algorithms 11
1990
Earlier work this paper cites.
S.E. Leurgans, R.T. Ross, and R.B. Abel, A decomposition for three-way arrays. , SIAM J. Matrix Anal. Appl. 14
1993
Earlier work this paper cites.
Bruno A Olshausen and David J Field, Emergence of simple-cell receptive field properties by learning a sparse code for natural images , Nature 381
1996
Earlier work this paper cites.
Bruno A. Olshausen and David J. Field, Sparse coding with an overcomplete basis set: A strategy employed by v1? , Vision Research 37
1997
Earlier work this paper cites.
Víctor H de la Peña and Evarist Giné, Decoupling. from dependence to independence. randomly stopped processes. u-statistics and processes. martingales and beyond, probability and its applications , 1999
1999
Earlier work this paper cites.
Jean B. Lasserre, Global optimization with polynomials and the problem of moments , SIAM J. Optim. 11
2000
Earlier work this paper cites.
Pablo A Parrilo, Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , Ph.D. thesis, Citeseer, 2000
2000
Earlier work this paper cites.
Daniel A. Spielman and Shang-Hua Teng, Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time , J. ACM 51
2004
Earlier work this paper cites.
Michael Elad and Michal Aharon, Image denoising via sparse and redundant representations over learned dictionaries , Image Processing, IEEE Transactions on 15
2006
Earlier work this paper cites.
Andreas Argyriou Theodoros Evgeniou and Massimiliano Pontil, Multi-task feature learning , Advances in Neural Information Processing Systems 19: Proceedings of the 2006 Conference, vol. 19, MIT Press, 2007, pp. 41–48
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 Trans. Signal Processing 55
2007
Earlier work this paper cites.
Y Marc’Aurelio Ranzato, Lan Boureau, and Yann LeCun, Sparse feature learning for deep belief networks , Advances in neural information processing systems 20
2007
Cited alongside, same era.
Julien Mairal, Marius Leordeanu, Francis Bach, Martial Hebert, and Jean Ponce, Discriminative sparse image models for class-specific edge detection and image interpretation , Computer Vision–ECCV 2008, Springer, 2008, pp. 43–56
2008
Cited alongside, same era.
Jianchao Yang, John Wright, Thomas Huang, and Yi Ma, Image super-resolution as sparse representation of raw image patches , Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on, IEEE, 2008, pp. 1–8
2008
Cited alongside, same era.
Mark Rudelson and Roman Vershynin, Smallest singular value of a random rectangular matrix , Communications on Pure and Applied Mathematics 62
2009
Cited alongside, same era.
Navin Goyal, Santosh Vempala, and Ying Xiao, Fourier PCA and robust tensor decomposition , STOC, ACM, 2014, pp. 584–593
2014
Later among the works it cites.
Anima Anandkumar, Dean P. Foster, Daniel J. Hsu, Sham M. Kakade, and Yi-Kai Liu, A spectral algorithm for latent dirichlet allocation , Algorithmica 72
2015
Later among the works it cites.
Anima Anandkumar, Rong Ge, Daniel J. Hsu, Sham M. Kakade, and Matus Telgarsky, Tensor decompositions for learning latent variable models (A survey for ALT) , ALT, Lecture Notes in Computer Science, vol. 9355, Springer, 2015, pp. 19–38
2015
Later among the works it cites.
Animashree Anandkumar, Rong Ge, and Majid Janzamin, Learning overcomplete latent variable models through tensor methods , COLT, JMLR Workshop and Conference Proceedings, vol. 40, JMLR.org, 2015, pp. 36–112
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Roberto I. Oliveira, Sums of random Hermitian matrices and an inequality by Rudelson. , Electron. Commun. Probab. 15
2010
Cited alongside, same era.
J. Cimprič, Real algebraic geometry for matrices over commutative rings , Journal of Algebra 359
2012
Cited alongside, same era.
Joel A. Tropp, User-friendly tail bounds for sums of random matrices , Foundations of Computational Mathematics 12
2012
Cited alongside, same era.
Grigoriy Blekherman, Pablo A. Parrilo, and Rekha R. Thomas (eds.), Semidefinite optimization and convex algebraic geometry. , Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM), 2013 (English)
2013
Cited alongside, same era.
Christopher J. Hillar and Lek-Heng Lim, Most tensor problems are np-hard , J. ACM 60
2013
Cited alongside, same era.
Animashree Anandkumar, Rong Ge, Daniel J. Hsu, Sham M. Kakade, and Matus Telgarsky, Tensor decompositions for learning latent variable models , Journal of Machine Learning Research 15
2014
Cited alongside, same era.
Animashree Anandkumar, Rong Ge, Daniel J. Hsu, and Sham M. Kakade, A tensor approach to learning mixed membership community models , Journal of Machine Learning Research 15
2014
Cited alongside, same era.
2014
Cited alongside, same era.
Boaz Barak, Jonathan A. Kelner, and David Steurer, Dictionary learning and tensor decomposition via the sum-of-squares method , STOC, ACM, 2015, pp. 143–151
2015
Later among the works it cites.
Rong Ge, Qingqing Huang, and Sham M. Kakade, Learning mixtures of gaussians in high dimensions , STOC, ACM, 2015, pp. 761–770
2015
Later among the works it cites.
Rong Ge and Tengyu Ma, Decomposing overcomplete 3rd order tensors using sum-of-squares algorithms , APPROX-RANDOM, LIPIcs, vol. 40, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015, pp. 829–849
2015
Later among the works it cites.
Samuel B. Hopkins, Jonathan Shi, and David Steurer, Tensor principal component analysis via sum-of-square proofs , COLT, JMLR Workshop and Conference Proceedings, vol. 40, JMLR.org, 2015, pp. 956–1006
2015
Later among the works it cites.
James R. Lee, Prasad Raghavendra, and David Steurer, Lower bounds on the size of semidefinite programming relaxations , Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing (New York, NY, USA), STOC ’15, ACM, 2015, pp. 567–576
2015
Later among the works it cites.
2015
Later among the works it cites.
2015
Later among the works it cites.
Boaz Barak, Samuel B. Hopkins, Jonathan Kelner, Pravesh K. Kothari, Ankur Moitra, and Aaron Potechin, A nearly tight sum-of-squares lower bound for the planted clique problem , FOCS, IEEE Computer Society, 2016
2016
Closest in time.
Samuel B. Hopkins, Tselil Schramm, Jonathan Shi, and David Steurer, Fast spectral algorithms from sum-of-squares proofs: Tensor decomposition and planted sparse vectors , Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing (New York, NY, USA), STOC 2016, ACM, 2016, pp. 178–191
2016
Closest in time.