{"total":45,"rows":[{"id":"2210.15651","title":"Learning Single-Index Models with Shallow Neural Networks","created":"2022-10-27","cited_by_count":92,"area":null},{"id":"2402.11867","title":"LoRA Training in the NTK Regime has No Spurious Local Minima","created":"2024-02-19","cited_by_count":48,"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":"2109.03349","title":"Certifiably Optimal Outlier-Robust Geometric Perception: Semidefinite Relaxations and Scalable Global Optimization","created":"2021-09-07","cited_by_count":21,"area":null},{"id":"2206.03345","title":"Preconditioned Gradient Descent for Overparameterized Nonconvex Burer--Monteiro Factorization with Global Optimality Certification","created":"2022-06-07","cited_by_count":21,"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":"2602.14662","title":"Advances in Global Solvers for 3D Vision","created":"2026-02-16","cited_by_count":13,"area":null},{"id":"2102.07586","title":"On Riemannian Stochastic Approximation Schemes with Fixed Step-Size","created":"2021-02-15","cited_by_count":12,"area":null},{"id":"2109.08046","title":"Rotation Averaging in a Split Second: A Primal-Dual Method and a Closed-Form for Cycle Graphs","created":"2021-09-16","cited_by_count":12,"area":null},{"id":"2208.10521","title":"Estimation Contracts for Outlier-Robust Geometric Perception","created":"2022-08-22","cited_by_count":11,"area":null},{"id":"2105.14033","title":"An Inexact Projected Gradient Method with Rounding and Lifting by Nonlinear Programming for Solving Rank-One Semidefinite Relaxation of Polynomial Optimization","created":"2021-05-28","cited_by_count":10,"area":null},{"id":"2212.07534","title":"Decentralized Nonconvex Optimization with Guaranteed Privacy and Accuracy","created":"2022-12-14","cited_by_count":10,"area":null},{"id":"2306.17378","title":"Global Optimality in Bivariate Gradient-based DAG Learning","created":"2023-06-30","cited_by_count":10,"area":null},{"id":"2103.13462","title":"Why Do Local Methods Solve Nonconvex Problems?","created":"2021-03-24","cited_by_count":8,"area":null},{"id":"2301.03139","title":"A Newton-CG based augmented Lagrangian method for finding a second-order stationary point of nonconvex equality constrained optimization with complexity guarantees","created":"2023-01-09","cited_by_count":6,"area":null},{"id":"2102.02837","title":"Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms","created":"2021-02-04","cited_by_count":4,"area":null},{"id":"2112.06556","title":"Orthogonal Group Synchronization with Incomplete Measurements: Error Bounds and Linear Convergence of the Generalized Power Method","created":"2021-12-13","cited_by_count":4,"area":null},{"id":"2211.17244","title":"Tight Certification of Adversarially Trained Neural Networks via Nonconvex Low-Rank Semidefinite Relaxations","created":"2022-11-30","cited_by_count":4,"area":null},{"id":"2312.05995","title":"From Correspondences to Pose: Non-minimal Certifiably Optimal Relative Pose without Disambiguation","created":"2023-12-10","cited_by_count":4,"area":null},{"id":"2207.05257","title":"Accelerating Certifiable Estimation with Preconditioned Eigensolvers","created":"2022-07-12","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":"2305.12292","title":"Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion","created":"2023-05-20","cited_by_count":2,"area":null},{"id":"2403.10423","title":"Quantization Avoids Saddle Points in Distributed Optimization","created":"2024-03-15","cited_by_count":2,"area":null},{"id":"2501.12678","title":"Manifold learning and optimization using tangent space proxies","created":"2025-01-22","cited_by_count":2,"area":null},{"id":"2501.13830","title":"A space-decoupling framework for optimization on bounded-rank matrices with orthogonally invariant constraints","created":"2025-01-23","cited_by_count":2,"area":null},{"id":"2509.21675","title":"Scalable Second-order Riemannian Optimization for $K$-means Clustering","created":"2025-09-25","cited_by_count":2,"area":null},{"id":"2102.06229","title":"Higher Order Generalization Error for First Order Discretization of Langevin Diffusion","created":"2021-02-11","cited_by_count":1,"area":null},{"id":"2103.11825","title":"From Digital Humanities to Quantum Humanities: Potentials and Applications","created":"2021-03-17","cited_by_count":1,"area":null},{"id":"2112.13269","title":"Over-Parametrized Matrix Factorization in the Presence of Spurious Stationary Points","created":"2021-12-25","cited_by_count":1,"area":null},{"id":"2501.16322","title":"Implicit Bias in Matrix Factorization and its Explicit Realization in a New Architecture","created":"2025-01-27","cited_by_count":1,"area":null},{"id":"2510.17772","title":"Atlas-based Manifold Representations for Interpretable Riemannian Machine Learning","created":"2025-10-20","cited_by_count":1,"area":null},{"id":"2101.02180","title":"Maximum a Posteriori Inference of Random Dot Product Graphs via Conic Programming","created":"2021-01-06","cited_by_count":0,"area":null},{"id":"2208.03625","title":"Parabolic Relaxation for Quadratically-constrained Quadratic Programming -- Part II: Theoretical & Computational Results","created":"2022-08-07","cited_by_count":0,"area":null},{"id":"2208.13880","title":"Inference and Optimization for Engineering and Physical Systems","created":"2022-08-29","cited_by_count":0,"area":null},{"id":"2402.09081","title":"Low-Rank Extragradient Methods for Scalable Semidefinite Optimization","created":"2024-02-14","cited_by_count":0,"area":null},{"id":"2406.10407","title":"Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+","created":"2024-06-14","cited_by_count":0,"area":null},{"id":"2409.19550","title":"Tailed Low-Rank Matrix Factorization for Similarity Matrix Completion","created":"2024-09-29","cited_by_count":0,"area":null},{"id":"2410.19844","title":"A practical, fast method for solving sum-of-squares problems for very large polynomials","created":"2024-10-21","cited_by_count":0,"area":null},{"id":"2510.17818","title":"Single-Snapshot Gridless 2D-DoA Estimation for UCAs: A Joint Optimization Approach","created":"2025-09-27","cited_by_count":0,"area":null},{"id":"2603.01267","title":"Certifiable Factor Graph Optimization","created":"2026-03-01","cited_by_count":0,"area":null},{"id":"2604.00060","title":"Scaled Gradient Descent for Ill-Conditioned Low-Rank Matrix Recovery with Optimal Sampling Complexity","created":"2026-03-31","cited_by_count":0,"area":null},{"id":"2606.01546","title":"Flexible Online Representation Learning Based on Similarity Matching","created":"2026-06-01","cited_by_count":0,"area":null},{"id":"2608.29018","title":"Sharp Restricted Isometry Thresholds for Global Minima of Rank-Restricted Matrix LASSO","created":"2026-08-29","cited_by_count":0,"area":null},{"id":"2610.18318","title":"Over-parameterization Is Neither Robust nor Fragile in Matrix Sensing: A Geometric Theory of Solution Robustness","created":"2026-10-13","cited_by_count":0,"area":null},{"id":"2610.19043","title":"Graph Coarsening Enables Escaping Local Optima in Compute-Constrained Nonconvex MAX-CUT","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}