{"total":38,"rows":[{"id":"2311.12023","title":"LQ-LoRA: Low-rank Plus Quantized Matrix Decomposition for Efficient Language Model Finetuning","created":"2023-11-20","cited_by_count":92,"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":"2101.05231","title":"Robust CUR Decomposition: Theory and Imaging Applications","created":"2021-01-05","cited_by_count":20,"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":"2109.12701","title":"Sparse Plus Low Rank Matrix Decomposition: A Discrete Optimization Approach","created":"2021-09-26","cited_by_count":14,"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":"2508.04190","title":"RPCANet++: Deep Interpretable Robust PCA for Sparse Object Segmentation","created":"2025-08-06","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":"2412.19820","title":"GaLore$+$: Boosting Low-Rank Adaptation for LLMs with Cross-Head Projection","created":"2024-12-15","cited_by_count":8,"area":null},{"id":"2202.05120","title":"Low-Rank Approximation with $1/\\epsilon^{1/3}$ Matrix-Vector Products","created":"2022-02-10","cited_by_count":7,"area":null},{"id":"2206.09042","title":"Riemannian CUR Decompositions for Robust Principal Component Analysis","created":"2022-06-17","cited_by_count":7,"area":null},{"id":"2512.03768","title":"Deep Unfolding: Recent Developments, Theory, and Design Guidelines","created":"2025-12-03","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":"2410.02068","title":"Fast and Sample Efficient Multi-Task Representation Learning in Stochastic Contextual Bandits","created":"2024-10-02","cited_by_count":6,"area":null},{"id":"2201.01728","title":"Matrix Completion with Hierarchical Graph Side Information","created":"2022-01-02","cited_by_count":5,"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":"2102.02837","title":"Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms","created":"2021-02-04","cited_by_count":4,"area":null},{"id":"2308.03661","title":"Matrix Completion in Almost-Verification Time","created":"2023-08-07","cited_by_count":4,"area":null},{"id":"2402.09754","title":"Robust SVD Made Easy: A fast and reliable algorithm for large-scale data analysis","created":"2024-02-15","cited_by_count":4,"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":"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":"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":"2109.10680","title":"rSVDdpd: A Robust Scalable Video Surveillance Background Modelling Algorithm","created":"2021-09-22","cited_by_count":2,"area":null},{"id":"2403.10423","title":"Quantization Avoids Saddle Points in Distributed Optimization","created":"2024-03-15","cited_by_count":2,"area":null},{"id":"2407.19446","title":"Leave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions","created":"2024-07-28","cited_by_count":1,"area":null},{"id":"2412.07242","title":"Optimization Can Learn Johnson Lindenstrauss Embeddings","created":"2024-12-10","cited_by_count":1,"area":null},{"id":"2505.18414","title":"A Dual Basis Approach for Structured Robust Euclidean Distance Geometry","created":"2025-05-23","cited_by_count":1,"area":null},{"id":"2109.12713","title":"Provable Low Rank Plus Sparse Matrix Separation Via Nonconvex Regularizers","created":"2021-09-26","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":"2309.14512","title":"Byzantine-Resilient Federated PCA and Low Rank Column-wise Sensing","created":"2023-09-25","cited_by_count":0,"area":null},{"id":"2405.06569","title":"Efficient Federated Low Rank Matrix Completion","created":"2024-05-10","cited_by_count":0,"area":null},{"id":"2407.08214","title":"Towards stable training of parallel continual learning","created":"2024-07-11","cited_by_count":0,"area":null},{"id":"2504.14741","title":"AltGDmin: Alternating GD and Minimization for Partly-Decoupled (Federated) Optimization","created":"2025-04-20","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":"2603.25132","title":"Robust Principal Component Completion","created":"2026-03-26","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}],"next_cursor":null}