{"list":"other","total":64,"rows":[{"id":"1812.11118","title":"Reconciling modern machine learning practice and the bias-variance trade-off","created":"2018-12-28","cited_by_count":927},{"id":"1906.11300","title":"Benign Overfitting in Linear Regression","created":"2019-06-26","cited_by_count":549},{"id":"1705.09280","title":"Implicit Regularization in Matrix Factorization","created":"2017-05-25","cited_by_count":322},{"id":"2103.09177","title":"Deep learning: a statistical viewpoint","created":"2021-03-16","cited_by_count":240},{"id":"2012.09839","title":"Towards Resolving the Implicit Bias of Gradient Descent for Matrix Factorization: Greedy Low-Rank Learning","created":"2020-12-17","cited_by_count":150},{"id":"2105.14368","title":"Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolation","created":"2021-05-29","cited_by_count":132},{"id":"1707.04926","title":"Theoretical insights into the optimization landscape of over-parameterized shallow neural networks","created":"2017-07-16","cited_by_count":128},{"id":"1907.11636","title":"Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio","created":"2019-07-26","cited_by_count":85},{"id":"2106.15013","title":"Small random initialization is akin to spectral learning: Optimization and generalization guarantees for overparameterized low-rank matrix reconstruction","created":"2021-06-28","cited_by_count":78},{"id":"1411.1076","title":"A statistical model for tensor PCA","created":"2014-11-04","cited_by_count":72},{"id":"1710.05017","title":"The power of sum-of-squares for detecting hidden structures","created":"2017-10-13","cited_by_count":54},{"id":"1703.02724","title":"Tensor SVD: Statistical and Computational Limits","created":"2017-03-08","cited_by_count":53},{"id":"2005.08099","title":"Reducibility and Statistical-Computational Gaps from Secret Leakage","created":"2020-05-16","cited_by_count":51},{"id":"1605.00353","title":"Rate-Optimal Perturbation Bounds for Singular Subspaces with Applications to High-Dimensional Statistics","created":"2016-05-02","cited_by_count":45},{"id":"2102.09972","title":"Implicit Regularization in Tensor Factorization","created":"2021-02-19","cited_by_count":44},{"id":"1907.11635","title":"Subexponential-Time Algorithms for Sparse PCA","created":"2019-07-26","cited_by_count":41},{"id":"2002.11255","title":"An Optimal Statistical and Computational Framework for Generalized Tensor Estimation","created":"2020-02-26","cited_by_count":39},{"id":"2008.02269","title":"Computational Barriers to Estimation from Low-Degree Polynomials","created":"2020-08-05","cited_by_count":39},{"id":"1307.5870","title":"Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery","created":"2013-07-22","cited_by_count":37},{"id":"1506.06081","title":"A Convergent Gradient Descent Algorithm for Rank Minimization and Semidefinite Programming from Random Linear Measurements","created":"2015-06-19","cited_by_count":34},{"id":"2203.02839","title":"Algorithmic Regularization in Model-free Overparametrized Asymmetric Matrix Factorization","created":"2022-03-06","cited_by_count":34},{"id":"2102.02756","title":"On the computational and statistical complexity of over-parameterized matrix sensing","created":"2021-01-27","cited_by_count":31},{"id":"1902.07324","title":"Computational Hardness of Certifying Bounds on Constrained PCA Problems","created":"2019-02-19","cited_by_count":30},{"id":"2005.10743","title":"Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits","created":"2020-05-21","cited_by_count":30},{"id":"1412.0048","title":"Multilinear tensor regression for longitudinal relational data","created":"2014-11-28","cited_by_count":28},{"id":"2104.14526","title":"Scaling and Scalability: Provable Nonconvex Low-Rank Tensor Estimation from Incomplete Measurements","created":"2021-04-29","cited_by_count":28},{"id":"1702.06980","title":"On Polynomial Time Methods for Exact Low Rank Tensor Completion","created":"2017-02-22","cited_by_count":27},{"id":"2103.08895","title":"Generalized Low-rank plus Sparse Tensor Estimation by Fast Riemannian Optimization","created":"2021-03-16","cited_by_count":24},{"id":"1611.10349","title":"Non-Convex Projected Gradient Descent for Generalized Low-Rank Tensor Regression","created":"2016-11-30","cited_by_count":23},{"id":"2012.09996","title":"Exact Clustering in Tensor Block Model: Statistical Optimality and Computational Limit","created":"2020-12-18","cited_by_count":23},{"id":"1701.01037","title":"Tensor-on-tensor regression","created":"2017-01-04","cited_by_count":22},{"id":"2109.11154","title":"Rank Overspecified Robust Matrix Recovery: Subgradient Method and Exact Recovery","created":"2021-09-23","cited_by_count":22},{"id":"1509.06490","title":"Bayesian Tensor Regression","created":"2015-09-22","cited_by_count":21},{"id":"2105.15081","title":"Optimal Spectral Recovery of a Planted Vector in a Subspace","created":"2021-05-31","cited_by_count":21},{"id":"2202.08788","title":"Global Convergence of Sub-gradient Method for Robust Matrix Recovery: Small Initialization, Noisy Measurements, and Over-parameterization","created":"2022-02-17","cited_by_count":21},{"id":"1501.07815","title":"Parsimonious Tensor Response Regression","created":"2015-01-30","cited_by_count":20},{"id":"2106.06573","title":"Understanding Deflation Process in Over-parametrized Tensor Decomposition","created":"2021-06-11","cited_by_count":20},{"id":"1605.08257","title":"Low-rank tensor completion: a Riemannian manifold preconditioning approach","created":"2016-05-26","cited_by_count":19},{"id":"2108.12163","title":"Provable Tensor-Train Format Tensor Completion by Riemannian Optimization","created":"2021-08-27","cited_by_count":17},{"id":"1711.01598","title":"Multilayer tensor factorization with applications to recommender systems","created":"2017-11-05","cited_by_count":16},{"id":"1803.00138","title":"A novel approach for fusion of heterogeneous sources of data","created":"2018-02-28","cited_by_count":14},{"id":"1911.03804","title":"ISLET: Fast and Optimal Low-rank Tensor Regression via Importance Sketching","created":"2019-11-09","cited_by_count":14},{"id":"2106.02129","title":"The Algorithmic Phase Transition of Random $k$-SAT for Low Degree Polynomials","created":"2021-06-03","cited_by_count":14},{"id":"2110.01602","title":"Clustering a Mixture of Gaussians with Unknown Covariance","created":"2021-10-04","cited_by_count":14},{"id":"2104.12031","title":"Low-rank Tensor Estimation via Riemannian Gauss-Newton: Statistical Optimality and Second-Order Convergence","created":"2021-04-24","cited_by_count":13},{"id":"2005.10817","title":"Computationally efficient sparse clustering","created":"2020-05-21","cited_by_count":12},{"id":"2007.08322","title":"Understanding Implicit Regularization in Over-Parameterized Single Index Model","created":"2020-07-16","cited_by_count":12},{"id":"2012.14844","title":"Inference for Low-rank Tensors -- No Need to Debias","created":"2020-12-29","cited_by_count":12},{"id":"1607.02535","title":"Learning from Multiway Data: Simple and Efficient Tensor Regression","created":"2016-07-08","cited_by_count":11},{"id":"1609.04523","title":"STORE: Sparse Tensor Response Regression and Neuroimaging Analysis","created":"2016-09-15","cited_by_count":11},{"id":"1801.09326","title":"Sparse and Low-rank Tensor Estimation via Cubic Sketchings","created":"2018-01-29","cited_by_count":11},{"id":"2008.04101","title":"Statistical Query Lower Bounds for Tensor PCA","created":"2020-08-10","cited_by_count":11},{"id":"2011.08360","title":"Recursive Importance Sketching for Rank Constrained Least Squares: Algorithms and High-order Convergence","created":"2020-11-17","cited_by_count":11},{"id":"1402.5284","title":"Convergence results for projected line-search methods on varieties of low-rank matrices via \\L{}ojasiewicz inequality","created":"2014-02-21","cited_by_count":10},{"id":"1911.03725","title":"Tensor Regression Using Low-rank and Sparse Tucker Decompositions","created":"2019-11-09","cited_by_count":10},{"id":"2012.10249","title":"Reduced-Rank Tensor-on-Tensor Regression and Tensor-variate Analysis of Variance","created":"2020-12-18","cited_by_count":10},{"id":"2005.11270","title":"The Average-Case Time Complexity of Certifying the Restricted Isometry Property","created":"2020-05-22","cited_by_count":9},{"id":"2012.15467","title":"Fast Global Convergence for Low-rank Matrix Recovery via Riemannian Gradient Descent with Random Initialization","created":"2020-12-31","cited_by_count":9},{"id":"1703.10019","title":"A Riemannian trust-region method for low-rank tensor completion","created":"2017-03-29","cited_by_count":8},{"id":"1703.07755","title":"Gradient descent with nonconvex constraints: local concavity determines convergence","created":"2017-03-22","cited_by_count":7},{"id":"2106.06308","title":"The Complexity of Sparse Tensor PCA","created":"2021-06-11","cited_by_count":7},{"id":"2107.03877","title":"Finding stationary points on bounded-rank matrices: A geometric hurdle and a smooth remedy","created":"2021-07-08","cited_by_count":6},{"id":"2201.09040","title":"Optimal Estimation and Computational Limit of Low-rank Gaussian Mixtures","created":"2022-01-22","cited_by_count":6},{"id":"2101.11108","title":"New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition","created":"2021-01-26","cited_by_count":4}],"next_cursor":null}