Fetching the paper…
Reading the bibliography…
In the noisy tensor completion problem we observe $m$ entries (whose location is chosen uniformly at random) from an unknown $n_1 \times n_2 \times n_3$ tensor $T$.
The eigenvalues of random symmetric matrices
Z. Füredi and J. Komlós · 1981
Earlier work this paper cites.
An approach to obtaining global extremums in polynomial mathematical programming problems
N. Z. Shor · 1987
Earlier work this paper cites.
On the second eigenvalue of random regular graphs
J. Friedman, J. Kahn and E. Szemerédi · 1989
Earlier work this paper cites.
Squared functional systems and optimization problems
Y. Nesterov · 2000
Earlier work this paper cites.
Structured Semidefinite Programs and Semialgebraic Geometry Method in Robustness and Optimization
P. Parrilo · 2000
Earlier work this paper cites.
Distributional and ℓ q \ell^{q} norm inequalities for polynomials over convex bodies in ℝ n \mathbb{R}^{n}
A. Carbery and J. Wright · 2001
Earlier work this paper cites.
Efficient recognition of random unsatisfiable k k -SAT instances by spectral methods
A. Goerdt and M. Krivelevich · 2001
Earlier work this paper cites.
Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity
D. Grigoriev · 2001
Earlier work this paper cites.
Global optimization with polynomials and the problem of moments
J. Lasserre · 2001
Earlier work this paper cites.
Matrix Rank Minimization with Applications
M. Fazel · 2002
Earlier work this paper cites.
Relations between average case complexity and approximation complexity
U. Feige · 2002
Earlier work this paper cites.
Empirical margin distributions and bounding the generalization error of combined classifiers
V. Koltchinskii and D. Panchenko · 2002
Earlier work this paper cites.
Lectures on Discrete Geometry
J. Matousek · 2002
Earlier work this paper cites.
Rademacher and Gaussian complexities: risk bounds and structural results
P. Bartlett and S. Mendelson · 2003
Earlier work this paper cites.
Classical deterministic complexity of Edmonds’ problem and quantum entanglement
L. Gurvits · 2003
Earlier work this paper cites.
Semidefinite programming relaxations for semialgebraic problems
P. Parrilo · 2003
Earlier work this paper cites.
Recognizing more unsatisfiable random k k -SAT instances efficiently
J. Friedman, A. Goerdt and M. Krivelevich · 2005
Earlier work this paper cites.
Learning nonsingular phylogenies and hidden markov models
E. Mossel and S. Roch · 2005
Earlier work this paper cites.
Rank, trace-norm and max-norm
N. Srebro and A. Shraibman · 2005
Earlier work this paper cites.
Witnesses for non-satisfiability of dense random 3CNF formulas
U. Feige, J.H. Kim and E. Ofek · 2006
Earlier work this paper cites.
Strong refutation heuristics for random k k -SAT
A. Coja-Oghlan, A. Goerdt and A. Lanka · 2007
Earlier work this paper cites.
Easily refutable subformulas of large random 3 3 -CNF formulas
U. Feige and E. Ofek · 2007
Earlier work this paper cites.
Exact matrix completion via convex optimization
E. Candes and B. Recht · 2008
Earlier work this paper cites.
Linear level Lasserre lower bounds for certain k k -CSPs
G. Schoenebeck · 2008
Earlier work this paper cites.
Moments, Positive Polynomials and Their Applications
J. Lasserre · 2009
Cited alongside, same era.
Matrix completion with noise
E. Candes and Y. Plan · 2010
Cited alongside, same era.
The power of convex relaxation: Near-optimal matrix completion
E. Candes and T. Tao · 2010
Cited alongside, same era.
Matrix completion from a few entries
R. Keshavan, A. Montanari and S. Oh · 2010
Cited alongside, same era.
Matrix completion from noisy entries
R. Keshavan, A. Montanari and S. Oh · 2010
Cited alongside, same era.
Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization
B. Recht, M. Fazel and P. Parrilo · 2010
Cited alongside, same era.
Learning mixtures of spherical gaussians: Moment methods and spectral decompositions
D. Hsu and S. Kakade · 2013
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.
Matrix completion from any given set of observations
T. Lee and A. Shraibman · 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.
Compressed sensing off the grid
G. Tang, B. Bhaskar and B. Recht · 2013
Later among the works it cites.
Rounding sum-of-squares relaxations
B. Barak, J. Kelner and D. Steurer · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Signoretto, L. De Lathauwer and J. Suykens · 2010
Cited alongside, same era.
Robust principal component analysis?
E. Candes, X. Li, Y. Ma and J. Wright · 2011
Cited alongside, same era.
Tensor completion and low-n-rank tensor recovery via convex optimization
S. Gandy, B. Recht and I. Yamada · 2011
Cited alongside, same era.
A simpler approach to matrix completion
B. Recht · 2011
Cited alongside, same era.
Estimation of low-rank tensors via convex optimization
R. Tomioko, K. Hayashi and H. Kashima · 2011
Cited alongside, same era.
A spectral algorithm for latent dirichlet allocation
A. Anandkumar, D. Foster, D. Hsu, S. Kakade, Y. Liu · 2012
Cited alongside, same era.
Sum-of-squares proofs and the quest toward optimal algorithms/
B. Barak and D. Steurer · 2014
Later among the works it cites.
Smoothed analysis of tensor decompositions
A. Bhaskara, M. Charikar, A. Moitra and A. Vijayaraghavan · 2014
Later among the works it cites.
Towards a mathematical theory of super-resolution
E. Candes and C. Fernandez-Granda · 2014
Later among the works it cites.
Coherent matrix completion
Y. Chen, S. Bhojanapalli, S. Sanghavi and R. Ward · 2014
Later among the works it cites.
From average case complexity to improper learning complexity
A. Daniely, N. Linial and S. Shalev-Shwartz · 2014
Later among the works it cites.
Understanding alternating minimization for matrix completion
M. Hardt · 2014
Later among the works it cites.
Provable tensor factorization with missing data
P. Jain and S. Oh · 2014
Later among the works it cites.
Low-rank tensor completion by Riemannian optimization
D. Kressner, M. Steinlechner and B. Vandereycken · 2014
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 · 2014
Later among the works it cites.
How to refute a random CSP
S. Allen, R. O’Donnell and D. Witmer · 2015
Closest in time.
Dictionary learning and tensor decomposition via the sum-of-squares method
B. Barak, J. Kelner and D. Steurer · 2015
Closest in time.
Decomposing overcomplete 3rd order tensors using sum-of-squares algorithms
R. Ge and T. Ma · 2015
Closest in time.
Private Communication, 2015
S. Hopkins, T. Schramm, J. Shi and D. Steurer · 2015
Closest in time.
Tensor principal component analysis via sum-of-square proofs
S. Hopkins, J. Shi and D. Steurer · 2015
Closest in time.
Sum-of-square lower bounds for sparse PCA
T. Ma and A. Wigderson · 2015
Closest in time.
Sos and planted clique: Tight analysis of MPW moments at all degrees and an optimal lower bound at degree four
S. B. Hopkins, P. K. Kothari, and A. Potechin · 2016
Closest in time.
Tight lower bounds for planted clique in the degree-4 SOS program
P. Raghavendra and T. Schramm · 2016
Closest in time.