Fetching the paper…
Reading the bibliography…
In this paper, we investigate the sample size requirement for exact recovery of a high order tensor of low rank from a subset of its entries.
Decoupling inequalities for the tail probabilities of multivariate U-statistics
Victor H de la Peña and Stephen J Montgomery-Smith · 1995
Earlier work this paper cites.
The geometry of algorithms with orthogonality constraints
Alan Edelman, Tomás A Arias, and Steven T Smith · 1998
Earlier work this paper cites.
Decoupling: from dependence to independence
Victor De la Pena and Evarist Giné · 1999
Earlier work this paper cites.
Optimization Algorithms on Matrix Manifolds
P. Absil, R. Mahony, and R. Sepulchre · 2008
Earlier work this paper cites.
Tensor rank and the ill-posedness of the best low-rank approximation problem
Vin de Silva and Lek-Heng Lim · 2008
Earlier work this paper cites.
Exact matrix completion via convex optimization
Emmanuel J Candès and Benjamin Recht · 2009
Earlier work this paper cites.
A Newton-Grassmann method for computing the best multilinear rank-( r 1 , r 2 , r 3 r_{1},r_{2},r_{3} ) approximation of a tensor
Lars Elden and Berkant Savas · 2009
Earlier work this paper cites.
Matrix completion from a few entries
Raghunandan H Keshavan, Sewoong Oh, and Andrea Montanari · 2009
Earlier work this paper cites.
The power of convex relaxation: Near-optimal matrix completion
Emmanuel J Candès and Terence Tao · 2010
Earlier work this paper cites.
Tensor completion for on-board compression of hyperspectral images
N. Li and B. Li · 2010
Earlier work this paper cites.
Quasi-newton methods on Grassmannians and multilinear approximations of tensors
Berkant Savas and Lek-Heng Lim · 2010
Earlier work this paper cites.
Tensor algebra and multi-dimensional harmonic retrieval in signal processing for mimo radar
N.D. Sidiropoulos and N. Nion · 2010
Cited alongside, same era.
Estimation of low-rank tensors via convex optimization
Ryota Tomioka, Kohei Hayashi, and Hisashi Kashima · 2010
Cited alongside, same era.
Tensor completion and low-n-rank tensor recovery via convex optimization
Silvia Gandy, Benjamin Recht, and Isao Yamada · 2011
Cited alongside, same era.
Recovering low-rank matrices from few coefficients in any basis
David Gross · 2011
Cited alongside, same era.
Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems: École d’Été de Probabilités de Saint-Flour XXXVIII-2008
Vladimir Koltchinskii · 2011
Cited alongside, same era.
Provable tensor factorization with missing data
Prateek Jain and Sewoong Oh · 2014
Later among the works it cites.
Low-rank tensor completion by Riemannian optimization
Daniel Kressner, Michael Steinlechner, and Bart Vandereycken · 2014
Later among the works it cites.
Square deal: Lower bounds and improved convex relaxations for tensor recovery
Cun Mu, Bo Huang, John Wright, and Donald Goldfarb · 2014
Later among the works it cites.
Tensor based formulation and nuclear norm regularizatin for multienergy computed tomography
O. Semerci, N. Hao, M. Kilmer, and E. Miller · 2014
Later among the works it cites.
Mathematical foundations of infinite-dimensional statistical models , volume 40
Evarist Giné and Richard Nickl · 2015
Later among the works it cites.
Linear and nonlinear programming , volume 228
David G Luenberger and Yinyu Ye · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Benjamin Recht · 2011
Cited alongside, same era.
Tensor decomposition for fast parsing with latent-variable PCFGS
S. Cohen and M. Collins · 2012
Cited alongside, same era.
User-friendly tail bounds for sums of random matrices
Joel A Tropp · 2012
Cited alongside, same era.
Most tensor problems are NP-hard
C. Hillar and Lek-Heng Lim · 2013
Cited alongside, same era.
Tensor completion for estimating missing values in visual data
Ji Liu, Przemyslaw Musialski, Peter Wonka, and Jieping Ye · 2013
Cited alongside, same era.
Tensor decompositions for learning latent variable models
Animashree Anandkumar, Rong Ge, Daniel Hsu, Sham M Kakade, and Matus Telgarsky · 2014
Cited alongside, same era.
On tensor completion via nuclear norm minimization
Ming Yuan and Cun-Hui Zhang
Cited in the paper.
Later among the works it cites.
Tensor theta norms and low rank recovery
Holger Rauhut and Željka Stojanac · 2015
Later among the works it cites.
A useful variant of the Davis–Kahan theorem for statisticians
Yi Yu, Tengyao Wang, and Richard J Samworth · 2015
Later among the works it cites.
Noisy tensor completion via the sum-of-squares hierarchy
Boaz Barak and Ankur Moitra · 2016
Later among the works it cites.
Spectral algorithms for tensor completion
Andrea Montanari and Nike Sun · 2016
Later among the works it cites.
Low rank tensor recovery via iterative hard thresholding
Holger Rauhut, Reinhold Schneider, and Zeljka Stojanac · 2016
Later among the works it cites.