{"total":40,"rows":[{"id":"2102.07845","title":"MARINA: Faster Non-Convex Distributed Learning with Compression","created":"2021-02-15","cited_by_count":78,"area":null},{"id":"2110.03677","title":"Large Learning Rate Tames Homogeneity: Convergence and Balancing Effect","created":"2021-10-07","cited_by_count":50,"area":null},{"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":"2102.02756","title":"On the computational and statistical complexity of over-parameterized matrix sensing","created":"2021-01-27","cited_by_count":31,"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":"2310.01769","title":"How Over-Parameterization Slows Down Gradient Descent in Matrix Sensing: The Curses of Symmetry and Initialization","created":"2023-10-03","cited_by_count":18,"area":null},{"id":"2102.12430","title":"Noisy Gradient Descent Converges to Flat Minima for Nonconvex Matrix Factorization","created":"2021-02-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":"2504.09708","title":"Preconditioned Gradient Descent for Over-Parameterized Nonconvex Matrix Factorization","created":"2025-04-13","cited_by_count":12,"area":null},{"id":"2203.03899","title":"Noisy Low-rank Matrix Optimization: Geometry of Local Minima and Convergence Rate","created":"2022-03-08","cited_by_count":8,"area":null},{"id":"2401.11940","title":"Low-Tubal-Rank Tensor Recovery via Factorized Gradient Descent","created":"2024-01-22","cited_by_count":7,"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":"2208.11246","title":"Accelerating SGD for Highly Ill-Conditioned Huge-Scale Online Matrix Completion","created":"2022-08-24","cited_by_count":6,"area":null},{"id":"2104.07006","title":"Fast quantum state reconstruction via accelerated non-convex programming","created":"2021-04-14","cited_by_count":5,"area":null},{"id":"2104.10790","title":"Sharp Global Guarantees for Nonconvex Low-rank Recovery in the Noisy Overparameterized Regime","created":"2021-04-21","cited_by_count":5,"area":null},{"id":"2502.04043","title":"Probe-Free Low-Rank Activation Intervention","created":"2025-02-06","cited_by_count":5,"area":null},{"id":"2506.23560","title":"Tensor Train Quantum State Tomography using Compressed Sensing","created":"2025-06-30","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":"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":"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":"2202.04026","title":"Low-Rank Extragradient Method for Nonsmooth and Low-Rank Matrix Optimization Problems","created":"2022-02-08","cited_by_count":3,"area":null},{"id":"2307.13818","title":"Gradient-Based Spectral Embeddings of Random Dot Product Graphs","created":"2023-07-25","cited_by_count":3,"area":null},{"id":"2410.09640","title":"Provable Acceleration of Nesterov's Accelerated Gradient for Rectangular Matrix Factorization and Linear Neural Networks","created":"2024-10-12","cited_by_count":3,"area":null},{"id":"2502.16912","title":"When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?","created":"2025-02-24","cited_by_count":3,"area":null},{"id":"2505.22602","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","created":"2025-05-28","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":"2101.00236","title":"On Stochastic Variance Reduced Gradient Method for Semidefinite Optimization","created":"2021-01-01","cited_by_count":1,"area":null},{"id":"2203.11579","title":"Local Stochastic Factored Gradient Descent for Distributed Quantum State Tomography","created":"2022-03-22","cited_by_count":1,"area":null},{"id":"2212.00852","title":"Symphony in the Latent Space: Provably Integrating High-dimensional Techniques with Non-linear Machine Learning Models","created":"2022-12-01","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":"2602.15202","title":"Tomography by Design: An Algebraic Approach to Low-Rank Quantum States","created":"2026-02-16","cited_by_count":1,"area":null},{"id":"2106.08775","title":"Momentum-inspired Low-Rank Coordinate Descent for Diagonally Constrained SDPs","created":"2021-06-16","cited_by_count":0,"area":null},{"id":"2202.04020","title":"Local Linear Convergence of Gradient Methods for Subspace Optimization via Strict Complementarity","created":"2022-02-08","cited_by_count":0,"area":null},{"id":"2206.11523","title":"Low-Rank Mirror-Prox for Nonsmooth and Low-Rank Matrix Optimization Problems","created":"2022-06-23","cited_by_count":0,"area":null},{"id":"2308.07343","title":"Conic Descent Redux for Memory-Efficient Optimization","created":"2023-08-13","cited_by_count":0,"area":null},{"id":"2412.17734","title":"LASE: Learned Adjacency Spectral Embeddings","created":"2024-12-23","cited_by_count":0,"area":null},{"id":"2506.06845","title":"Linear Discriminant Analysis with Gradient Optimization","created":"2025-06-07","cited_by_count":0,"area":null},{"id":"2605.10741","title":"AdaPaD: Adaptive Parallel Deflation for PEFT with Self-Correcting Rank Discovery","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2609.09457","title":"A Block Tensor Train Burer-Monteiro Framework for Low-Rank Quantum State Tomography","created":"2026-09-08","cited_by_count":0,"area":null},{"id":"2609.11876","title":"On the Regularization Landscape for the Linear Recommendation Models","created":"2026-09-10","cited_by_count":0,"area":null}],"next_cursor":null}