Fetching the paper…
Reading the bibliography…
We study the problem of low-rank tensor factorization in the presence of missing data.
The expression of a tensor or a polyadic as a sum of products
F. L. Hitchcock · 1927
Earlier work this paper cites.
Analysis of individual differences in multidimensional scaling via an n-way generalization of Òeckart-youngÓ decomposition
J. D. Carroll and J. Chang · 1970
Earlier work this paper cites.
Foundations of the parafac procedure: Models and conditions for an” explanatory” multimodal factor analysis
R. A. Harshman · 1970
Earlier work this paper cites.
On the second eigenvalue in random regular graphs
J. Friedman, J. Kahn, and E. Szemerédi · 1989
Earlier work this paper cites.
Multi-way analysis in the food industry: models, algorithms, and applications
R. Bro · 1998
Earlier work this paper cites.
Rank-one approximation to high order tensors
T. Zhang and G. H. Golub · 2001
Earlier work this paper cites.
Dealing with missing data: Part i
B Walczak and DL Massart · 2001
Earlier work this paper cites.
Spectral analysis of data
Y. Azar, A. Fiat, A. Karlin, F. McSherry, and J. Saia · 2001
Earlier work this paper cites.
Parafac and missing values
G. Tomasi and R. Bro · 2005
Cited alongside, same era.
Spectral techniques applied to sparse random graphs
U. Feige and E. Ofek · 2005
Cited alongside, same era.
Tensor rank and the ill-posedness of the best low-rank approximation problem
V. De Silva and L.-H. Lim · 2008
Cited alongside, same era.
Exact matrix completion via convex optimization
E. J. Candès and B. Recht · 2009
Cited alongside, same era.
Propagation connectivity of random hypergraphs
R. Berke and M. Onsjö · 2009
Cited alongside, same era.
The power of convex relaxation: Near-optimal matrix completion
E. J. Candès and T. Tao · 2010
Cited alongside, same era.
Matrix completion from a few entries
Tensor decompositions for learning latent variable models
Anandkumar Anima, Ge Rong, Hsu Daniel, M. Kakade Sham, and Matus Telgarsky · 2012
Later among the works it cites.
Low-rank matrix completion using alternating minimization
P. Jain, P. Netrapalli, and S. Sanghavi · 2013
Later among the works it cites.
On the provable convergence of alternating minimization for matrix completion
Moritz Hardt · 2013
Later among the works it cites.
Tensor completion for estimating missing values in visual data
J. Liu, P. Musialski, P. Wonka, and J. Ye · 2013
Later among the works it cites.
Square deal: Lower bounds and improved relaxations for tensor recovery
C. Mu, B. Huang, J. Wright, and D. Goldfarb · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. H. Keshavan, A. Montanari, and S. Oh · 2010
Cited alongside, same era.
Scalable tensor factorizations for incomplete data
E. Acar, D. M. Dunlavy, T. G. Kolda, and M. Mørup · 2011
Cited alongside, same era.
Convex tensor decomposition via structured schatten norm regularization
Ryota Tomioka and Taiji Suzuki · 2013
Later among the works it cites.
Guaranteed non-orthogonal tensor decomposition via alternating rank-1 updates
A. Anandkumar, R. Ge, and M. Janzamin · 2014
Closest in time.