Fetching the paper…
Reading the bibliography…
We give a robust version of the celebrated result of Kruskal on the uniqueness of tensor decompositions: we prove that given a tensor whose decomposition satisfies a robust form of Kruskal's rank condition, it is possible to approximately recover the decomposition if the tensor is known up to a sufficiently small (inverse polynomial) error.
The expression of a tensor or a polyadic as a sum of products
Frank Lauren Hitchcock · 1927
Earlier work this paper cites.
The approximation of one matrix by another of lower rank
Carl Eckart and Gale Young · 1936
Earlier work this paper cites.
‘parallel proportional profiles and other principles for determining the choice of factors by rotation
Raymond B Cattell · 1944
Earlier work this paper cites.
Identifiability of mixtures
Henry Teicher · 1961
Earlier work this paper cites.
Identifiability of mixtures of product measures
Henry Teicher · 1967
Earlier work this paper cites.
Analysis of individual differences in multidimensional scaling via an n-way generalization of eckart-young decomposition
J Douglas Carroll and Jih-Jie Chang · 1970
Earlier work this paper cites.
Foundations of the parafac procedure: models and conditions for an explanatory multimodal factor analysis
Richard A Harshman · 1970
Earlier work this paper cites.
Maximum likelihood from incomplete data via the em algorithm
Arthur P Dempster, Nan M Laird, and Donald B Rubin · 1977
Earlier work this paper cites.
Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
Joseph B Kruskal · 1977
Earlier work this paper cites.
Identifiability of mixtures
GM Tallis and P Chesson · 1982
Earlier work this paper cites.
Statement of some current results about three-way arrays, 1983
JB Kruskal · 1983
Earlier work this paper cites.
Indexing by latent semantic analysis
Scott Deerwester, Susan T. Dumais, George W Furnas, Thomas K Landauer, and Richard Harshman · 1990
Earlier work this paper cites.
Tensor rank is np-complete
Johan Håstad · 1990
Earlier work this paper cites.
On the complexity of approximating extremal determinants in matrices
Leonid Khachiyan · 1995
Earlier work this paper cites.
On the combinatorial and algebraic complexity of quantifier elimination
Saugata Basu, Richard Pollack, and Marie-Françoise Roy · 1996
Earlier work this paper cites.
Full reconstruction of markov models on evolutionary trees: identifiability and consistency
Joseph T Chang · 1996
Earlier work this paper cites.
Hidden markov models
Sean R Eddy · 1996
Earlier work this paper cites.
Parafac. tutorial and applications
Rasmus Bro · 1997
Earlier work this paper cites.
The art of computer programming vol. 2, (1997)
Donald Knuth · 1997
Earlier work this paper cites.
The development of the 1996 htk broadcast news transcription system
PC Woodland, MJF Gales, D Pye, and SJ Young · 1997
Earlier work this paper cites.
Learning mixtures of gaussians
Sanjoy Dasgupta · 1999
Earlier work this paper cites.
Object recognition from local scale-invariant features
David G Lowe · 1999
Earlier work this paper cites.
Towards a standardized notation and terminology in multiway analysis
Henk AL Kiers · 2000
Earlier work this paper cites.
Construction and analysis of degenerate parafac models
Pentti Paatero · 2000
Earlier work this paper cites.
On the uniqueness of multilinear decomposition of n-way arrays
Nicholas D Sidiropoulos and Rasmus Bro · 2000
Earlier work this paper cites.
Learning mixtures of arbitrary gaussians
Sanjeev Arora and Ravi Kannan · 2001
Earlier work this paper cites.
On the best rank-1 approximation of higher-order supersymmetric tensors
Eleftherios Kofidis and Phillip A. Regalia · 2001
Earlier work this paper cites.
Rank-one approximation to high order tensors
Tong Zhang and Gene H. Golub · 2001
Cited alongside, same era.
On uniqueness in candecomp/parafac
Jos MF ten Berge and Nikolaos D Sidiropoulos · 2002
Cited alongside, same era.
The htk book
Steve Young, Gunnar Evermann, Mark Gales, Thomas Hain, Dan Kershaw, Xunying Liu, Gareth Moore, Julian Odell, Dave Ollason, Dan Povey, et al · 2002
Cited alongside, same era.
Unsupervised learning
Zoubin Ghahramani · 2004
Cited alongside, same era.
Kruskal’s permutation lemma and the identification of candecomp/parafac and bilinear models with constant modulus constraints
Tao Jiang and Nicholas D Sidiropoulos · 2004
Cited alongside, same era.
A spectral algorithm for learning mixture models
Santosh Vempala and Grant Wang · 2004
Efficiently learning mixtures of two gaussians
Adam Tauman Kalai, Ankur Moitra, and Gregory Valiant · 2010
Later among the works it cites.
Settling the polynomial learnability of mixtures of gaussians
Ankur Moitra and Gregory Valiant · 2010
Later among the works it cites.
A concise proof of kruskal’s theorem on tensor decomposition
John A Rhodes · 2010
Later among the works it cites.
Subtracting a best rank-1 approximation may increase tensor rank
Alwin Stegeman and Pierre Comon · 2010
Later among the works it cites.
Identifiability of two-tree mixtures for group-based models
Elizabeth S Allman, Sonia Petrovic, John A Rhodes, and Seth Sullivant · 2011
Later among the works it cites.
Innovations in Computer Science - ICS 2010, Tsinghua University, Beijing, China, January 7-9, 2011. Proceedings
Bernard Chazelle, editor · 2011
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
On spectral learning of mixtures of distributions
Dimitris Achlioptas and Frank McSherry · 2005
Cited alongside, same era.
Decoding by linear programming
E. J. Candes and T. Tao · 2005
Cited alongside, same era.
Tensor decomposition and approximation schemes for constraint satisfaction problems
W Fernandez de la Vega, Marek Karpinski, Ravi Kannan, and Santosh Vempala · 2005
Cited alongside, same era.
Learning mixtures of product distributions over discrete domains
Jon Feldman, Ryan ODonnell, and Rocco A. Servedio · 2005
Cited alongside, same era.
Pac learning axis-aligned mixtures of gaussians with no separation assumption
Jon Feldman, Rocco A. Servedio, and Ryan O’Donnell · 2006
Cited alongside, same era.
Learning nonsingular phylogenies and hidden markov models
Elchanan Mossel and Sébastien Roch · 2006
Cited alongside, same era.
Later among the works it cites.
Shifted power method for computing tensor eigenpairs
Tamara G Kolda and Jackson R Mayo · 2011
Later among the works it cites.
On the certification of the restricted isometry property
Pascal Koiran and Anastasios Zouzias · 2011
Later among the works it cites.
A spectral algorithm for latent dirichlet allocation
Anima Anandkumar, Dean Foster, Daniel Hsu, Sham Kakade, and Yi-Kai Liu · 2012
Later among the works it cites.
Tensor decompositions for learning latent variable models
Anima Anandkumar, Rong Ge, Daniel Hsu, Sham M Kakade, and Matus Telgarsky · 2012
Later among the works it cites.
Learning topic models–going beyond svd
Sanjeev Arora, Rong Ge, and Ankur Moitra · 2012
Later among the works it cites.
Learning mixtures of tree graphical models
Anima Anandkumar, Daniel Hsu, Furong Huang, and Sham Kakade · 2012
Later among the works it cites.
A method of moments for mixture models and hidden markov models
Animashree Anandkumar, Daniel Hsu, and Sham M Kakade · 2012
Later among the works it cites.
Improved spectral-norm bounds for clustering
Pranjal Awasthi and Or Sheffet · 2012
Later among the works it cites.
On generic identifiability of 3-tensors of small rank
L. Chiantini and G. Ottaviani · 2012
Later among the works it cites.
The inverse moment problem for convex polytopes
Nick Gravin, Jean Lasserre, Dmitrii V Pasechnik, and Sinai Robins · 2012
Later among the works it cites.
Matrix computations
Gene H Golub and Charles F Van Loan · 2012
Later among the works it cites.
Learning gaussian mixture models: Moment methods and spectral decompositions
Daniel Hsu and Sham M Kakade · 2012
Later among the works it cites.
Identifiability and unmixing of latent parse trees
Daniel Hsu, Sham Kakade, and Percy Liang · 2012
Later among the works it cites.
A spectral algorithm for learning hidden markov models
Daniel Hsu, Sham M Kakade, and Tong Zhang · 2012
Later among the works it cites.
Tensors:: Geometry and Applications
J.M. Landsberg · 2012
Later among the works it cites.
Identifiability of large phylogenetic mixture models
John A Rhodes and Seth Sullivant · 2012
Later among the works it cites.
The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
A. M. Tillmann and M. E. Pfetsch · 2012
Later among the works it cites.
A tensor spectral approach to learning mixed membership community models
Anima Anandkumar, Rong Ge, Daniel Hsu, and Sham M Kakade · 2013
Closest in time.
Learning mixtures of spherical gaussians: moment methods and spectral decompositions
Daniel Hsu and Sham M Kakade · 2013
Closest in time.
Most tensor problems are np-hard
Christopher Hillar and Lek-Heng Lim · 2013
Closest in time.