{"total":40,"rows":[{"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":"2201.00703","title":"Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function","created":"2022-01-03","cited_by_count":21,"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":"2201.11411","title":"Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the $O(\\epsilon^{-7/4})$ Complexity","created":"2022-01-27","cited_by_count":17,"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.04769","title":"Submodular + Concave","created":"2021-06-09","cited_by_count":13,"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":"2305.04080","title":"Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption","created":"2023-05-06","cited_by_count":11,"area":null},{"id":"2101.07150","title":"Stable Recovery of Entangled Weights: Towards Robust Identification of Deep Neural Networks from Minimal Samples","created":"2021-01-18","cited_by_count":8,"area":null},{"id":"2108.10448","title":"Fast Robust Tensor Principal Component Analysis via Fiber CUR Decomposition","created":"2021-08-23","cited_by_count":8,"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":"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":"2401.15566","title":"On the Robustness of Cross-Concentrated Sampling for Matrix Completion","created":"2024-01-28","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":"2504.19000","title":"Unveiling and Mitigating Adversarial Vulnerabilities in Iterative Optimizers","created":"2025-04-26","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":"2502.00899","title":"HASSLE-free: A unified Framework for Sparse plus Low-Rank Matrix Decomposition for LLMs","created":"2025-02-02","cited_by_count":3,"area":null},{"id":"2307.05893","title":"Deep Unrolling for Nonconvex Robust Principal Component Analysis","created":"2023-07-12","cited_by_count":2,"area":null},{"id":"2511.11927","title":"Sparse corruption in low-rank matrix inference: the PCA benchmark","created":"2025-11-14","cited_by_count":2,"area":null},{"id":"2101.12414","title":"Low Rank Forecasting","created":"2021-01-29","cited_by_count":1,"area":null},{"id":"2106.09211","title":"Square Root Principal Component Pursuit: Tuning-Free Noisy Robust Matrix Recovery","created":"2021-06-17","cited_by_count":1,"area":null},{"id":"2106.13880","title":"Self-paced Principal Component Analysis","created":"2021-06-25","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":"2311.13036","title":"Favour: FAst Variance Operator for Uncertainty Rating","created":"2023-11-21","cited_by_count":0,"area":null},{"id":"2311.16416","title":"A Combinatorial Approach to Robust PCA","created":"2023-11-28","cited_by_count":0,"area":null},{"id":"2502.09926","title":"Robust Anomaly Detection via Tensor Pseudoskeleton Decomposition","created":"2025-02-14","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":"2509.06575","title":"Robust and Adaptive Spectral Method for Representation Multi-Task Learning with Contamination","created":"2025-09-08","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":"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.25460","title":"Mean-Shift PCA by Knockoff Mean","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2606.13528","title":"What's Old is New Again: Classical Dimensionality Reduction for Efficient Saliency-Guided Biometric Attack Detection","created":"2026-06-11","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}