{"total":27,"rows":[{"id":"2402.02347","title":"Riemannian Preconditioned LoRA for Fine-Tuning Foundation Models","created":"2024-02-04","cited_by_count":52,"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":"2601.13474","title":"Preconditioning Benefits of Spectral Orthogonalization in Muon","created":"2026-01-20","cited_by_count":30,"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":"2109.11154","title":"Rank Overspecified Robust Matrix Recovery: Subgradient Method and Exact Recovery","created":"2021-09-23","cited_by_count":22,"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":"2206.09109","title":"Fast and Provable Tensor Robust Principal Component Analysis via Scaled Gradient Descent","created":"2022-06-18","cited_by_count":11,"area":null},{"id":"2102.02969","title":"Sign-RIP: A Robust Restricted Isometry Property for Low-rank Matrix Recovery","created":"2021-02-05","cited_by_count":10,"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":"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":"2212.11346","title":"Deep Unfolded Tensor Robust PCA with Self-supervised Learning","created":"2022-12-21","cited_by_count":7,"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":"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":"2305.06199","title":"Computationally Efficient and Statistically Optimal Robust High-Dimensional Linear Regression","created":"2023-05-10","cited_by_count":4,"area":null},{"id":"2406.06002","title":"Computational and Statistical Guarantees for Tensor-on-Tensor Regression with Tensor Train Decomposition","created":"2024-06-10","cited_by_count":4,"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":"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":"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":"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":"2410.15224","title":"Robust Low-rank Tensor Train Recovery","created":"2024-10-19","cited_by_count":2,"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":"2607.13246","title":"Reassessing Muon for Matrix Factorization","created":"2026-07-14","cited_by_count":1,"area":null},{"id":"2212.08852","title":"Unrolling SVT to obtain computationally efficient SVT for n-qubit quantum state tomography","created":"2022-12-17","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":"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}