Fetching the paper…
Reading the bibliography…
In this paper, we consider the statistical inference for several low-rank tensor models.
1901
Earlier work this paper cites.
[author] Sun, Will WeiW. W. and Li, LexinL. (2019). Dynamic tensor clustering. Journal of the American Statistical Association 114 1894–1907
1907
Earlier work this paper cites.
1909
Earlier work this paper cites.
[author] Eckart, CarlC. and Young, GaleG. (1936). The approximation of one matrix by another of lower rank. Psychometrika 1 211–218
1936
Earlier work this paper cites.
[author] Neumann, John vonJ. v. (1936). The uniqueness of Haar’s measure. Rec. Math. (Mat. Sbornik) 1 721–734
1936
Earlier work this paper cites.
[author] Weil, AndréA. (1940). L’intégration dans les groupes topologiques et ses applications. Hermann et Cie
1940
Earlier work this paper cites.
[author] Berry, Andrew CA. C. (1941). The accuracy of the Gaussian approximation to the sum of independent variates. Transactions of the american mathematical society 49 122–136
1941
Earlier work this paper cites.
[author] Esseen, Carl-GustafC.-G. (1942). On the Liapunov limit error in the theory of probability. Ark. Mat. Astr. Fys. 28 1–19
1942
Earlier work this paper cites.
[author] Lynch, RER., Rice, John RJ. R. and Thomas, Donald HD. H. (1964). Tensor product analysis of partial difference equations. Bulletin of the American Mathematical Society 70 378–384
1964
Earlier work this paper cites.
[author] Tucker, Ledyard RL. R. (1966). Some mathematical notes on three-mode factor analysis. Psychometrika 31 279–311
1966
Earlier work this paper cites.
[author] De Lathauwer, LievenL., De Moor, BartB. and Vandewalle, JoosJ. (2000). On the best rank-1 and rank-(r 1, r 2,…, rn) approximation of higher-order tensors. SIAM journal on Matrix Analysis and Applications 21 1324–1342
2000
Earlier work this paper cites.
[author] Laurent, BeatriceB. and Massart, PascalP. (2000). Adaptive estimation of a quadratic functional by model selection. Annals of Statistics 1302–1338
2000
Earlier work this paper cites.
[author] Kolda, Tamara GT. G. (2001). Orthogonal tensor decompositions. SIAM Journal on Matrix Analysis and Applications 23 243–255
2001
Earlier work this paper cites.
[author] Zhang, TongT. and Golub, Gene HG. H. (2001). Rank-one approximation to high order tensors. SIAM Journal on Matrix Analysis and Applications 23 534–550
2001
Earlier work this paper cites.
2002
Earlier work this paper cites.
2002
Earlier work this paper cites.
[author] Shao, JunJ. (2003). Mathematical statistics
2003
Earlier work this paper cites.
2005
Earlier work this paper cites.
2005
Earlier work this paper cites.
2006
Earlier work this paper cites.
[author] Wilmoth, J. R.J. R. and Shkolnikov, V.V. (2006). Human mortality database, available at: http://www.mortality.org
2006
Earlier work this paper cites.
2007
Earlier work this paper cites.
[author] De Silva, VinV. and Lim, Lek-HengL.-H. (2008). Tensor rank and the ill-posedness of the best low-rank approximation problem. SIAM Journal on Matrix Analysis and Applications 30 1084–1127
2008
Earlier work this paper cites.
[author] Zhang, Cun-HuiC.-H. and Huang, JianJ. (2008). The sparsity and bias of the lasso selection in high-dimensional linear regression. The Annals of Statistics 36 1567–1594
2008
Earlier work this paper cites.
[author] Chen, JieJ. and Saad, YousefY. (2009). On the tensor SVD and the optimal low rank orthogonal approximation of tensors. SIAM journal on Matrix Analysis and Applications 30 1709–1734
2009
Earlier work this paper cites.
[author] Kolda, Tamara GT. G. and Bader, Brett WB. W. (2009). Tensor decompositions and applications. SIAM review 51 455–500
2009
Earlier work this paper cites.
[author] Candes, Emmanuel JE. J. and Plan, YanivY. (2010). Matrix completion with noise. Proceedings of the IEEE 98 925–936
2010
Earlier work this paper cites.
Karatzoglou, A
2010
Earlier work this paper cites.
2010
Earlier work this paper cites.
[author] Koltchinskii, VladimirV., Lounici, KarimK. and Tsybakov, Alexandre BA. B. (2011). Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion. The Annals of Statistics 39 2302–2329
2011
Earlier work this paper cites.
Anandkumar, A
2012
Cited alongside, same era.
[author] De la Pena, VictorV. and Giné, EvaristE. (2012). Decoupling: from dependence to independence. Springer Science & Business Media
2012
Cited alongside, same era.
2012
Cited alongside, same era.
2012
Cited alongside, same era.
[author] Vannieuwenhoven, NickN., Vandebril, RafR. and Meerbergen, KarlK. (2012). A new truncation strategy for the higher-order singular value decomposition. SIAM Journal on Scientific Computing 34 A1027–A1052
[author] Sun, Will WeiW. W., Lu, JunweiJ., Liu, HanH. and Cheng, GuangG. (2017). Provable sparse tensor decomposition. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 3 899–916
2017
Later among the works it cites.
2018
Later among the works it cites.
[author] Belkin, MikhailM., Rademacher, LuisL. and Voss, JamesJ. (2018). Eigenvectors of orthogonally decomposable functions. SIAM Journal on Computing 47 547–615
2018
Later among the works it cites.
[author] Bi, XuanX., Qu, AnnieA. and Shen, XiaotongX. (2018). Multilayer tensor factorization with applications to recommender systems. The Annals of Statistics 46 3308–3333
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2012
Cited alongside, same era.
[author] Cai, T TonyT. T. and Zhang, AnruA. (2013). Sparse representation of a polytope and recovery of sparse signals and low-rank matrices. IEEE transactions on information theory 60 122–132
2013
Cited alongside, same era.
[author] Candes, Emmanuel JE. J., Strohmer, ThomasT. and Voroninski, VladislavV. (2013). Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming. Communications on Pure and Applied Mathematics 66 1241–1274
2013
Cited alongside, same era.
[author] Hillar, Christopher JC. J. and Lim, Lek-HengL.-H. (2013). Most tensor problems are NP-hard. Journal of the ACM (JACM) 60 1–39
2013
Cited alongside, same era.
Tomioka, R
2013
Cited alongside, same era.
[author] Zhou, HuaH., Li, LexinL. and Zhu, HongtuH. (2013). Tensor regression with applications in neuroimaging data analysis. Journal of the American Statistical Association 108 540–552
2013
Cited alongside, same era.
[author] Anandkumar, AnimashreeA., Ge, RongR., Hsu, DanielD., Kakade, Sham MS. M. and Telgarsky, MatusM. (2014). Tensor decompositions for learning latent variable models. Journal of Machine Learning Research 15 2773–2832
2014
Cited alongside, same era.
2014
Cited alongside, same era.
[author] Cai, T TonyT. T. and Zhang, AnruA. (2018). Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics. The Annals of Statistics 46 60–89
2018
Later among the works it cites.
2018
Later among the works it cites.
[author] Li, XiaoshanX., Xu, DaD., Zhou, HuaH. and Li, LexinL. (2018). Tucker tensor regression and neuroimaging analysis. Statistics in Biosciences 10 520–545
2018
Later among the works it cites.
[author] Montanari, AndreaA. and Sun, NikeN. (2018). Spectral algorithms for tensor completion. Communications on Pure and Applied Mathematics 71 2381–2425
2018
Later among the works it cites.
[author] Zhang, AnruA. and Xia, DongD. (2018). Tensor svd: Statistical and computational limits. IEEE Transactions on Information Theory 64 7311–7338
2018
Later among the works it cites.
[author] Arous, Gerard BenG. B., Mei, SongS., Montanari, AndreaA. and Nica, MihaiM. (2019). The landscape of the spiked tensor model. Communications on Pure and Applied Mathematics 72 2282–2330
2019
Later among the works it cites.
[author] Carpentier, AlexandraA., Eisert, JensJ., Gross, DavidD. and Nickl, RichardR. (2019). Uncertainty quantification for matrix compressed sensing and quantum tomography problems. In High Dimensional Probability VIII 385–430. Springer
2019
Later among the works it cites.
[author] Chen, HanH., Raskutti, GarveshG. and Yuan, MingM. (2019). Non-convex projected gradient descent for generalized low-rank tensor regression. The Journal of Machine Learning Research 20 172–208
2019
Later among the works it cites.
[author] Chen, Wei-KuoW.-K. (2019). Phase transition in the spiked random tensor with rademacher prior. The Annals of Statistics 47 2734–2756
2019
Later among the works it cites.
[author] Chen, YuxinY., Fan, JianqingJ., Ma, CongC. and Yan, YulingY. (2019). Inference and uncertainty quantification for noisy matrix completion. Proceedings of the National Academy of Sciences 116 22931–22937
2019
Later among the works it cites.
[author] Fan, JianqingJ., Gong, WenyanW. and Zhu, ZiweiZ. (2019). Generalized high-dimensional trace regression via nuclear norm regularization. Journal of econometrics 212 177–202
2019
Later among the works it cites.
[author] Li, XiaodongX., Ling, ShuyangS., Strohmer, ThomasT. and Wei, KeK. (2019). Rapid, robust, and reliable blind deconvolution via nonconvex optimization. Applied and computational harmonic analysis 47 893–934
2019
Later among the works it cites.
[author] Raskutti, GarveshG., Yuan, MingM. and Chen, HanH. (2019). Convex regularization for high-dimensional multiresponse tensor regression. The Annals of Statistics 47 1554–1584
2019
Later among the works it cites.
[author] Wainwright, Martin JM. J. (2019). High-dimensional statistics: A non-asymptotic viewpoint 48. Cambridge University Press
2019
Later among the works it cites.
[author] Xia, DongD. (2019). Confidence Region of Singular Subspaces for Low-rank Matrix Regression. IEEE Transactions on Information Theory 65 7437–7459
2019
Later among the works it cites.
[author] Xia, DongD. and Yuan, MingM. (2019). On polynomial time methods for exact low-rank tensor completion. Foundations of Computational Mathematics 19 1265–1313
2019
Later among the works it cites.
[author] Zhang, AnruA. (2019). Cross: Efficient low-rank tensor completion. The Annals of Statistics 47 936–964
2019
Later among the works it cites.
[author] Zhang, AnruA. and Han, RungangR. (2019). Optimal sparse singular value decomposition for high-dimensional high-order data. Journal of the American Statistical Association 114 1708–1725
2019
Later among the works it cites.
[author] Hao, BotaoB., Zhang, AnruA. and Cheng, GuangG. (2020). Sparse and low-rank tensor estimation via cubic sketchings. IEEE Transactions on Information Theory 66 5927-5964
2020
Closest in time.
[author] Luo, YuetianY. and Zhang, Anru RA. R. (2020). Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection. Conference of Learning Theory (COLT) 125 3852-3856
2020
Closest in time.
Perry, A
2020
Closest in time.
[author] Xia, DongD. and Yuan, MingM. (2020). Statistical inferences of linear forms for noisy matrix completion. Journal of the Royal Statistical Society Series B to appear
2020
Closest in time.
[author] Zhang, Anru RA. R., Luo, YuetianY., Raskutti, GarveshG. and Yuan, MingM. (2020). ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching. SIAM Journal on Mathematics of Data Science 2 444–479
2020
Closest in time.
[author] Zhang, ChenyuC., Han, RungangR., Zhang, Anru RA. R. and Voyles, Paul MP. M. (2020). Denoising Atomic Resolution 4D Scanning Transmission Electron Microscopy Data with Tensor Singular Value Decomposition. Ultramicroscopy 113123
2020
Closest in time.
[author] Dudeja, RishabhR. and Hsu, DanielD. (2021). Statistical query lower bounds for tensor PCA. Journal of Machine Learning Research 22 1–51
2021
Closest in time.