{"total":71,"rows":[{"id":"2402.02347","title":"Riemannian Preconditioned LoRA for Fine-Tuning Foundation Models","created":"2024-02-04","cited_by_count":52,"area":null},{"id":"2406.02214","title":"SLTrain: a sparse plus low-rank approach for parameter and memory efficient pretraining","created":"2024-06-04","cited_by_count":45,"area":null},{"id":"2301.11500","title":"Understanding Incremental Learning of Gradient Descent: A Fine-grained Analysis of Matrix Sensing","created":"2023-01-27","cited_by_count":42,"area":null},{"id":"2110.05649","title":"Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detection","created":"2021-10-11","cited_by_count":34,"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":"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":"2409.13652","title":"OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decomposition","created":"2024-09-20","cited_by_count":20,"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":"2109.12701","title":"Sparse Plus Low Rank Matrix Decomposition: A Discrete Optimization Approach","created":"2021-09-26","cited_by_count":14,"area":null},{"id":"2106.02119","title":"A Scalable Second Order Method for Ill-Conditioned Matrix Completion from Few Samples","created":"2021-06-03","cited_by_count":13,"area":null},{"id":"2208.09723","title":"Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Sampling","created":"2022-08-20","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":"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":"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":"2505.18877","title":"RefLoRA: Refactored Low-Rank Adaptation for Efficient Fine-Tuning of Large Models","created":"2025-05-24","cited_by_count":9,"area":null},{"id":"2211.08597","title":"SketchySGD: Reliable Stochastic Optimization via Randomized Curvature Estimates","created":"2022-11-16","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":"2212.11346","title":"Deep Unfolded Tensor Robust PCA with Self-supervised Learning","created":"2022-12-21","cited_by_count":7,"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":"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":"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":"2605.09238","title":"Intrinsic Muon: Spectral Optimization on Riemannian Matrix Manifolds","created":"2026-05-10","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":"2401.15566","title":"On the Robustness of Cross-Concentrated Sampling for Matrix Completion","created":"2024-01-28","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":"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":"2201.13052","title":"Inductive Matrix Completion: No Bad Local Minima and a Fast Algorithm","created":"2022-01-31","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":"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.05822","title":"Symmetric Matrix Completion with ReLU Sampling","created":"2024-06-09","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":"2506.16032","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","created":"2025-06-19","cited_by_count":4,"area":null},{"id":"2602.06880","title":"Decoupling Variance and Scale-Invariant Updates in Adaptive Gradient Descent for Unified Vector and Matrix Optimization","created":"2026-02-06","cited_by_count":4,"area":null},{"id":"2406.07409","title":"Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descent","created":"2024-06-11","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":"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":"2311.11182","title":"Exponentially Convergent Algorithms for Supervised Matrix Factorization","created":"2023-11-18","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":"2412.10664","title":"Structured Sampling for Robust Euclidean Distance Geometry","created":"2024-12-14","cited_by_count":2,"area":null},{"id":"2501.04565","title":"Learnable Scaled Gradient Descent for Guaranteed Robust Tensor PCA","created":"2025-01-08","cited_by_count":2,"area":null},{"id":"2506.03230","title":"DiaBlo: Diagonal Blocks Are Sufficient For Finetuning","created":"2025-06-03","cited_by_count":2,"area":null},{"id":"2206.06774","title":"Supervised Dictionary Learning with Auxiliary Covariates","created":"2022-06-14","cited_by_count":1,"area":null},{"id":"2410.03497","title":"Collaborative and Efficient Personalization with Mixtures of Adaptors","created":"2024-10-04","cited_by_count":1,"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":"2607.13246","title":"Reassessing Muon for Matrix Factorization","created":"2026-07-14","cited_by_count":1,"area":null},{"id":"2403.01919","title":"Randomized Approach to Matrix Completion: Applications in Recommendation Systems and Image Inpainting","created":"2024-03-04","cited_by_count":0,"area":null},{"id":"2406.15713","title":"Efficient Low-rank Identification via Accelerated Iteratively Reweighted Nuclear Norm Minimization","created":"2024-06-22","cited_by_count":0,"area":null},{"id":"2407.08517","title":"Generalized Low-Rank Matrix Completion Model with Overlapping Group Error Representation","created":"2024-07-11","cited_by_count":0,"area":null},{"id":"2407.13731","title":"Predictive Low Rank Matrix Learning under Partial Observations: Mixed-Projection ADMM","created":"2024-07-18","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":"2502.08536","title":"Matrix Completion with Graph Information: A Provable Nonconvex Optimization Approach","created":"2025-02-12","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":"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":"2605.17189","title":"Sample-efficient inductive matrix completion with noise and inexact side-information","created":"2026-05-16","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":"2608.03928","title":"Robust Low-Tubal-Rank Tensor Completion under Cross-Concentrated Sampling","created":"2026-08-04","cited_by_count":0,"area":null},{"id":"2608.05136","title":"The Loss Does Not See the Basis, but Adam Does","created":"2026-08-05","cited_by_count":0,"area":null},{"id":"2610.01697","title":"Learning PDE Dynamics between Submanifolds Using Green's Observation Operators","created":"2026-10-01","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}