Fetching the paper…
Reading the bibliography…
We consider the Principal Component Analysis problem for large tensors of arbitrary order $k$ under a single-spike (or rank-one plus noise) model.
1972
Earlier work this paper cites.
S. Geman, A limit theorem for the norm of random matrices , Annals of Probability 8
1980
Earlier work this paper cites.
W. C. Waterhouse, The absolute-value estimate for symmetric multilinear forms , Linear Algebra and its Applications 128
1990
Earlier work this paper cites.
Andrea Crisanti and H-J Sommers, The spherical p-spin interaction spin glass model: the statics , Zeitschrift für Physik B Condensed Matter 87
1992
Earlier work this paper cites.
Te Han and Sergio Verdu, Generalizing the fano inequality , Information Theory, IEEE Transactions on 40
1994
Earlier work this paper cites.
A Crisanti and H-J Sommers, Thouless-Anderson-Palmer approach to the spherical p-spin spin glass model , Journal de Physique I 5
1995
Earlier work this paper cites.
R. A. Vitale, Some comparisons for gaussian processes , Proceedings of the American Mathematical Society (2000), 3043–3046
2000
Earlier work this paper cites.
K. R. Davidson and S. J. Szarek, Local operator theory, random matrices and Banach spaces , Handbook on the Geometry of Banach spaces, vol. 1, Elsevier Science, 2001, pp. 317–366
2001
Earlier work this paper cites.
Kenneth R Davidson and Stanislaw J Szarek, Local operator theory, random matrices and banach spaces , Handbook of the geometry of Banach spaces 1
2001
Earlier work this paper cites.
M. Ledoux, The concentration of measure phenomenon , Mathematical Surveys and Monographs, vol. 89, American Mathematical Society, Providence, RI, 2001
2001
Earlier work this paper cites.
D. L. Donoho and M. Elad, Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 \ell_{1} minimization , Proceedings of the National Academy of Sciences 100
2003
Earlier work this paper cites.
J. A Tropp, Greed is good: Algorithmic results for sparse approximation , Information Theory, IEEE Transactions on 50
2004
Earlier work this paper cites.
Michel Talagrand, Free energy of the spherical mean field model , Probability theory and related fields 134
2006
Earlier work this paper cites.
E. Candes and T. Tao, The Dantzig selector: Statistical estimation when p is much larger than n , The Annals of Statistics (2007), 2313–2351
2007
Earlier work this paper cites.
Debashis Paul, Asymptotics of sample eigenstructure for a large dimensional spiked covariance model , Statistica Sinica 17
2007
Cited alongside, same era.
E. J. Candès and B. Recht, Exact matrix completion via convex optimization , Foundations of Computational mathematics 9
2009
Cited alongside, same era.
O. Duchenne, F. Bach, I. Kweon, and J. Ponce, A tensor-based algorithm for high-order graph matching , Conference on Computer Vision and Pattern Recognition (CVPR), 2009
2009
Cited alongside, same era.
D. L. Donoho, A. Maleki, and A. Montanari, Message Passing Algorithms for Compressed Sensing , Proceedings of the National Academy of Sciences 106
2009
Cited alongside, same era.
D. Féral and S. Péché, The largest eigenvalues of sample covariance matrices for a spiked population: diagonal case , Journal of Mathematical Physics 50
2009
Florent Benaych-Georges and Raj Rao Nadakuditi, The singular values and vectors of low rank perturbations of large rectangular random matrices , Journal of Multivariate Analysis 111
2012
Later among the works it cites.
Thomas M Cover and Joy A Thomas, Elements of information theory , John Wiley & Sons, 2012
2012
Later among the works it cites.
U. Kamilov, S. Rangan, A. K. Fletcher, and M. Unser, Approximate message passing with consistent parameter estimation and applications to sparse learning. , NIPS, 2012, pp. 2447–2455
2012
Later among the works it cites.
P. Schniter and S. Rangan, Compressive phase retrieval via generalized approximate message passing , Communication, Control, and Computing (Allerton), 2012 50th Annual Allerton Conference on, IEEE, 2012, pp. 815–822
2012
Later among the works it cites.
A. Auffinger, G. Ben Arous, and J. Cerny, Random matrices and complexity of spin glasses , Communications on Pure and Applied Mathematics 66(2)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
I. M Johnstone and A. Y. Lu, On consistency and sparsity for principal components analysis in high dimensions , Journal of the American Statistical Association 104
2009
Cited alongside, same era.
Z. Bai and J. Silverstein, Spectral Analysis of Large Dimensional Random Matrices ( 2 n d 2^{nd} edition) , Springer, 2010
2010
Cited alongside, same era.
M. Bayati and A. Montanari, The dynamics of message passing on dense graphs, with applications to compressed sensing , IEEE Trans. on Inform. Theory 57
2011
Cited alongside, same era.
A. K. Fletcher, S. Rangan, L. R. Varshney, and A. Bhargava, Neural reconstruction with approximate message passing (neuramp). , NIPS, 2011, pp. 2555–2563
2011
Cited alongside, same era.
Tamara G Kolda and Jackson R Mayo, Shifted power method for computing tensor eigenpairs , SIAM Journal on Matrix Analysis and Applications 32
2011
Cited alongside, same era.
P. Schniter and V. Cevher, Approximate message passing for bilinear models , Proc. Workshop Signal Process. Adaptive Sparse Struct. Repr.(SPARS), 2011, p. 68
2011
Cited alongside, same era.
R. Tomioka, T. Suzuki, K. Hayashi, and H. Kashima, Statistical performance of convex tensor decomposition , Neural Information Processing Systems (NIPS), 2011
2011
Cited alongside, same era.
2013
Later among the works it cites.
2013
Later among the works it cites.
Christopher J Hillar and Lek-Heng Lim, Most tensor problems are np-hard , Journal of the ACM (JACM) 60
2013
Later among the works it cites.
J. Liu, P. Musialski, P. Wonka, and J. Ye, Tensor completion for estimating missing values in visual data , IEEE Transactions on Pattern Analysis and Machine Intelligence 35(1)
2013
Later among the works it cites.
C. Mu, J. Huang, B. Wright, and D. Goldfarb, Square deal: Lower bounds and improved relaxations for tensor recovery , International Conference in Machine Learning (ICML), 2013
2013
Later among the works it cites.
B. Romera-Paredes and M. Pontil, A new convex relaxation for tensor completion , Neural Information Processing Systems (NIPS), 2013
2013
Later among the works it cites.
Y. Deshpande, A. Montanari, and E. Richard, Cone-constrained principal component analysis , Neural Information Processing Systems (NIPS), 2014
2014
Closest in time.
2014
Closest in time.
R. H. Keshavan, A. Montanari, and S. Oh, Matrix completion from noisy entries. , Journal of Machine Learning Research 11
2078
Closest in time.