{"total":33,"rows":[{"id":"2601.13474","title":"Preconditioning Benefits of Spectral Orthogonalization in Muon","created":"2026-01-20","cited_by_count":30,"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":"2410.18965","title":"On the Crucial Role of Initialization for Matrix Factorization","created":"2024-10-24","cited_by_count":15,"area":null},{"id":"2505.12455","title":"AltLoRA: Towards Better Gradient Approximation in Low-Rank Adaptation with Alternating Projections","created":"2025-05-18","cited_by_count":9,"area":null},{"id":"2308.15461","title":"Canonical Factors for Hybrid Neural Fields","created":"2023-08-29","cited_by_count":8,"area":null},{"id":"2401.02592","title":"Guaranteed Nonconvex Factorization Approach for Tensor Train Recovery","created":"2024-01-05","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":"2401.11940","title":"Low-Tubal-Rank Tensor Recovery via Factorized Gradient Descent","created":"2024-01-22","cited_by_count":7,"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":"2305.17224","title":"Fast and Accurate Estimation of Low-Rank Matrices from Noisy Measurements via Preconditioned Non-Convex Gradient Descent","created":"2023-05-26","cited_by_count":5,"area":null},{"id":"2410.16826","title":"Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery","created":"2024-10-22","cited_by_count":4,"area":null},{"id":"2502.00463","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","created":"2025-02-01","cited_by_count":4,"area":null},{"id":"2403.08585","title":"Improving Implicit Regularization of SGD with Preconditioning for Least Square Problems","created":"2024-03-13","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.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":"2410.21262","title":"BLAST: Block-Level Adaptive Structured Matrices for Efficient Deep Neural Network Inference","created":"2024-10-28","cited_by_count":3,"area":null},{"id":"2510.01175","title":"On the Benefits of Weight Normalization for Overparameterized Matrix Sensing","created":"2025-10-01","cited_by_count":3,"area":null},{"id":"2604.21905","title":"Low-Rank Adaptation Redux for Large Models","created":"2026-04-23","cited_by_count":3,"area":null},{"id":"2302.10963","title":"Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?","created":"2023-02-21","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":"2410.15224","title":"Robust Low-rank Tensor Train Recovery","created":"2024-10-19","cited_by_count":2,"area":null},{"id":"2509.19977","title":"Faster Than SVD, Smarter Than SGD: The OPLoRA Alternating Update","created":"2025-09-24","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":"2607.13246","title":"Reassessing Muon for Matrix Factorization","created":"2026-07-14","cited_by_count":1,"area":null},{"id":"2303.14244","title":"Implicit Balancing and Regularization: Generalization and Convergence Guarantees for Overparameterized Asymmetric Matrix Sensing","created":"2023-03-24","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},{"id":"2505.12919","title":"RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees","created":"2025-05-19","cited_by_count":0,"area":null},{"id":"2506.08428","title":"Sharper Convergence Rates for Nonconvex Optimisation via Reduction Mappings","created":"2025-06-10","cited_by_count":0,"area":null},{"id":"2602.16456","title":"Beyond SGD, Without SVD: Proximal Subspace Iteration LoRA with Diagonal Fractional K-FAC","created":"2026-02-18","cited_by_count":0,"area":null},{"id":"2603.21062","title":"Gradient Descent with Projection Finds Over-Parameterized Neural Networks for Learning Low-Degree Polynomials with Nearly Minimax Optimal Rate","created":"2026-03-22","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.31390","title":"Direction-Magnitude Decomposition for Low-Rank Matrix Optimization: Faster Convergence and Saddle-to-saddle Dynamics","created":"2026-06-30","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}],"next_cursor":null}