{"total":15,"rows":[{"id":"2106.14289","title":"Global Convergence of Gradient Descent for Asymmetric Low-Rank Matrix Factorization","created":"2021-06-27","cited_by_count":45,"area":null},{"id":"2410.18965","title":"On the Crucial Role of Initialization for Matrix Factorization","created":"2024-10-24","cited_by_count":15,"area":null},{"id":"2305.06927","title":"Convergence of Alternating Gradient Descent for Matrix Factorization","created":"2023-05-11","cited_by_count":12,"area":null},{"id":"2111.14069","title":"Escape saddle points by a simple gradient-descent based algorithm","created":"2021-11-28","cited_by_count":11,"area":null},{"id":"2210.01496","title":"Zeroth-Order Negative Curvature Finding: Escaping Saddle Points without Gradients","created":"2022-10-04","cited_by_count":6,"area":null},{"id":"2210.06705","title":"From Gradient Flow on Population Loss to Learning with Stochastic Gradient Descent","created":"2022-10-13","cited_by_count":5,"area":null},{"id":"2503.19091","title":"High Probability Complexity Bounds of Trust-Region Stochastic Sequential Quadratic Programming with Heavy-Tailed Noise","created":"2025-03-24","cited_by_count":4,"area":null},{"id":"2103.09424","title":"Escaping Saddle Points in Distributed Newton's Method with Communication Efficiency and Byzantine Resilience","created":"2021-03-17","cited_by_count":3,"area":null},{"id":"2305.02041","title":"Low-complexity subspace-descent over symmetric positive definite manifold","created":"2023-05-03","cited_by_count":2,"area":null},{"id":"2309.01796","title":"Implicit Regularization Makes Overparameterized Asymmetric Matrix Sensing Robust to Perturbations","created":"2023-09-04","cited_by_count":2,"area":null},{"id":"2409.08771","title":"In-depth Analysis of Low-rank Matrix Factorisation in a Federated Setting","created":"2024-09-13","cited_by_count":2,"area":null},{"id":"2206.11426","title":"On a class of geodesically convex optimization problems solved via Euclidean MM methods","created":"2022-06-22","cited_by_count":1,"area":null},{"id":"2407.05261","title":"Disciplined Geodesically Convex Programming","created":"2024-07-07","cited_by_count":1,"area":null},{"id":"2202.03535","title":"Noise Regularizes Over-parameterized Rank One Matrix Recovery, Provably","created":"2022-02-07","cited_by_count":0,"area":null},{"id":"2502.00320","title":"$k$-SVD with Gradient Descent","created":"2025-02-01","cited_by_count":0,"area":null}],"next_cursor":null}