{"total":63,"rows":[{"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,"area":null},{"id":"2209.05045","title":"Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization","created":"2022-09-12","cited_by_count":43,"area":null},{"id":"2302.01186","title":"The Power of Preconditioning in Overparameterized Low-Rank Matrix Sensing","created":"2023-02-02","cited_by_count":33,"area":null},{"id":"2104.14526","title":"Scaling and Scalability: Provable Nonconvex Low-Rank Tensor Estimation from Incomplete Measurements","created":"2021-04-29","cited_by_count":28,"area":null},{"id":"2107.12365","title":"Inference for Heteroskedastic PCA with Missing Data","created":"2021-07-26","cited_by_count":21,"area":null},{"id":"2206.04502","title":"What is a Good Metric to Study Generalization of Minimax Learners?","created":"2022-06-09","cited_by_count":16,"area":null},{"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,"area":null},{"id":"2106.02119","title":"A Scalable Second Order Method for Ill-Conditioned Matrix Completion from Few Samples","created":"2021-06-03","cited_by_count":13,"area":null},{"id":"2207.01789","title":"Improved Global Guarantees for the Nonconvex Burer--Monteiro Factorization via Rank Overparameterization","created":"2022-07-05","cited_by_count":13,"area":null},{"id":"2206.04044","title":"Model-Based Reinforcement Learning for Offline Zero-Sum Markov Games","created":"2022-06-08","cited_by_count":11,"area":null},{"id":"2106.12933","title":"GNMR: A provable one-line algorithm for low rank matrix recovery","created":"2021-06-24","cited_by_count":10,"area":null},{"id":"2205.15142","title":"Special Properties of Gradient Descent with Large Learning Rates","created":"2022-05-30","cited_by_count":10,"area":null},{"id":"2208.09550","title":"Sudakov-Fernique post-AMP, and a new proof of the local convexity of the TAP free energy","created":"2022-08-19","cited_by_count":9,"area":null},{"id":"2302.03682","title":"Approximate message passing from random initialization with applications to $\\mathbb{Z}_{2}$ synchronization","created":"2023-02-07","cited_by_count":9,"area":null},{"id":"2101.09346","title":"On the Local Linear Rate of Consensus on the Stiefel Manifold","created":"2021-01-22","cited_by_count":8,"area":null},{"id":"2202.07079","title":"Synthetically Controlled Bandits","created":"2022-02-14","cited_by_count":8,"area":null},{"id":"2212.08642","title":"Estimating Higher-Order Mixed Memberships via the $\\ell_{2,\\infty}$ Tensor Perturbation Bound","created":"2022-12-16","cited_by_count":8,"area":null},{"id":"2303.06198","title":"Deflated HeteroPCA: Overcoming the curse of ill-conditioning in heteroskedastic PCA","created":"2023-03-10","cited_by_count":7,"area":null},{"id":"2110.03975","title":"Tensor train completion: local recovery guarantees via Riemannian optimization","created":"2021-10-08","cited_by_count":6,"area":null},{"id":"2110.10279","title":"Factorization Approach for Low-complexity Matrix Completion Problems: Exponential Number of Spurious Solutions and Failure of Gradient Methods","created":"2021-10-19","cited_by_count":6,"area":null},{"id":"2210.04810","title":"Towards a Theoretical Foundation of Policy Optimization for Learning Control Policies","created":"2022-10-10","cited_by_count":6,"area":null},{"id":"2302.07851","title":"Continuized Acceleration for Quasar Convex Functions in Non-Convex Optimization","created":"2023-02-15","cited_by_count":6,"area":null},{"id":"2310.06159","title":"Provably Accelerating Ill-Conditioned Low-rank Estimation via Scaled Gradient Descent, Even with Overparameterization","created":"2023-10-09","cited_by_count":6,"area":null},{"id":"2402.06756","title":"Convergence of Gradient Descent with Small Initialization for Unregularized Matrix Completion","created":"2024-02-09","cited_by_count":6,"area":null},{"id":"2106.02780","title":"Learning Treatment Effects in Panels with General Intervention Patterns","created":"2021-06-05","cited_by_count":5,"area":null},{"id":"2108.01772","title":"Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimization","created":"2021-08-03","cited_by_count":4,"area":null},{"id":"2206.04276","title":"Robust Matrix Completion with Heavy-tailed Noise","created":"2022-06-09","cited_by_count":4,"area":null},{"id":"2209.15130","title":"Nonconvex Matrix Factorization is Geodesically Convex: Global Landscape Analysis for Fixed-rank Matrix Optimization From a Riemannian Perspective","created":"2022-09-29","cited_by_count":4,"area":null},{"id":"2212.09396","title":"Rank-1 Matrix Completion with Gradient Descent and Small Random Initialization","created":"2022-12-19","cited_by_count":4,"area":null},{"id":"2306.00342","title":"Combining Explicit and Implicit Regularization for Efficient Learning in Deep Networks","created":"2023-06-01","cited_by_count":4,"area":null},{"id":"2110.12121","title":"On Geometric Connections of Embedded and Quotient Geometries in Riemannian Fixed-rank Matrix Optimization","created":"2021-10-23","cited_by_count":3,"area":null},{"id":"2304.10317","title":"Adaptive Consensus Optimization Method for GANs","created":"2023-04-20","cited_by_count":3,"area":null},{"id":"2408.13276","title":"Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity","created":"2024-08-20","cited_by_count":3,"area":null},{"id":"2410.16982","title":"Sample-Efficient Geometry Reconstruction from Euclidean Distances using Non-Convex Optimization","created":"2024-10-22","cited_by_count":3,"area":null},{"id":"2101.05113","title":"Beyond Procrustes: Balancing-Free Gradient Descent for Asymmetric Low-Rank Matrix Sensing","created":"2021-01-13","cited_by_count":2,"area":null},{"id":"2110.15273","title":"OMASGAN: Out-of-Distribution Minimum Anomaly Score GAN for Sample Generation on the Boundary","created":"2021-10-28","cited_by_count":2,"area":null},{"id":"2112.11760","title":"On Asymptotic Linear Convergence of Projected Gradient Descent for Constrained Least Squares","created":"2021-12-22","cited_by_count":2,"area":null},{"id":"2202.09023","title":"Clustering by Hill-Climbing: Consistency Results","created":"2022-02-18","cited_by_count":2,"area":null},{"id":"2307.07030","title":"Accelerated Gradient Methods for Nonconvex Optimization: Escape Trajectories From Strict Saddle Points and Convergence to Local Minima","created":"2023-07-13","cited_by_count":2,"area":null},{"id":"2410.10623","title":"Robust Gradient Descent for Phase Retrieval","created":"2024-10-14","cited_by_count":2,"area":null},{"id":"2604.07372","title":"NS-RGS: Newton-Schulz based Riemannian gradient method for orthogonal group synchronization","created":"2026-04-07","cited_by_count":2,"area":null},{"id":"2106.15493","title":"Generalized Orthogonal Procrustes Problem under Arbitrary Adversaries","created":"2021-06-29","cited_by_count":1,"area":null},{"id":"2110.12046","title":"Uncertainty Quantification For Low-Rank Matrix Completion With Heterogeneous and Sub-Exponential Noise","created":"2021-10-22","cited_by_count":1,"area":null},{"id":"2206.12486","title":"Variational Bayesian inference for CP tensor completion with side information","created":"2022-06-24","cited_by_count":1,"area":null},{"id":"2212.00746","title":"Learning Transition Operators From Sparse Space-Time Samples","created":"2022-12-01","cited_by_count":1,"area":null},{"id":"2303.10030","title":"How robust is randomized blind deconvolution via nuclear norm minimization against adversarial noise?","created":"2023-03-17","cited_by_count":1,"area":null},{"id":"2306.04961","title":"Recovering Simultaneously Structured Data via Non-Convex Iteratively Reweighted Least Squares","created":"2023-06-08","cited_by_count":1,"area":null},{"id":"2311.12888","title":"Acceleration and Implicit Regularization in Gaussian Phase Retrieval","created":"2023-11-21","cited_by_count":1,"area":null},{"id":"2404.07172","title":"A Gauss-Newton Approach for Min-Max Optimization in Generative Adversarial Networks","created":"2024-04-10","cited_by_count":1,"area":null},{"id":"2407.19446","title":"Leave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions","created":"2024-07-28","cited_by_count":1,"area":null},{"id":"2410.11225","title":"Statistical Inference in Tensor Completion: Optimal Uncertainty Quantification and Statistical-to-Computational Gaps","created":"2024-10-15","cited_by_count":1,"area":null},{"id":"2502.20033","title":"Recommendations with Sparse Comparison Data: Provably Fast Convergence for Nonconvex Matrix Factorization","created":"2025-02-27","cited_by_count":1,"area":null},{"id":"2504.19530","title":"Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descent","created":"2025-04-28","cited_by_count":1,"area":null},{"id":"2511.04485","title":"Q3R: Quadratic Reweighted Rank Regularizer for Effective Low-Rank Training","created":"2025-11-06","cited_by_count":1,"area":null},{"id":"2606.04476","title":"When Both Layers Learn: Training Dynamics of Representing Linear Models via ReLU Networks","created":"2026-06-03","cited_by_count":1,"area":null},{"id":"2405.06569","title":"Efficient Federated Low Rank Matrix Completion","created":"2024-05-10","cited_by_count":0,"area":null},{"id":"2410.09990","title":"Global convergence of gradient descent for phase retrieval","created":"2024-10-13","cited_by_count":0,"area":null},{"id":"2506.18275","title":"Phase transition of \\emph{descending} phase retrieval algorithms","created":"2025-06-23","cited_by_count":0,"area":null},{"id":"2506.18279","title":"Optimal spectral initializers impact on phase retrieval phase transitions -- an RDT view","created":"2025-06-23","cited_by_count":0,"area":null},{"id":"2506.18282","title":"Phase retrieval with rank $d$ measurements -- \\emph{descending} algorithms phase transitions","created":"2025-06-23","cited_by_count":0,"area":null},{"id":"2507.23017","title":"A Smoothing Newton Method for Rank-one Matrix Recovery","created":"2025-07-30","cited_by_count":0,"area":null},{"id":"2508.09685","title":"Global Convergence Analysis of Vanilla Gradient Descent for Asymmetric Matrix Completion","created":"2025-08-13","cited_by_count":0,"area":null},{"id":"2604.00505","title":"Towards Initialization-dependent and Non-vacuous Generalization Bounds for Overparameterized Shallow Neural Networks","created":"2026-04-01","cited_by_count":0,"area":null}],"next_cursor":null}