{"total":25,"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":"2505.17847","title":"Time-o1: Time-Series Forecasting Needs Transformed Label Alignment","created":"2025-05-23","cited_by_count":22,"area":null},{"id":"2101.05231","title":"Robust CUR Decomposition: Theory and Imaging Applications","created":"2021-01-05","cited_by_count":20,"area":null},{"id":"2110.09697","title":"abess: A Fast Best Subset Selection Library in Python and R","created":"2021-10-19","cited_by_count":16,"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":"2103.11037","title":"Mode-wise Tensor Decompositions: Multi-dimensional Generalizations of CUR Decompositions","created":"2021-03-19","cited_by_count":13,"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":"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":"2209.07237","title":"Robust Implementation of Foreground Extraction and Vessel Segmentation for X-ray Coronary Angiography Image Sequence","created":"2022-09-15","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":"2410.06376","title":"Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees","created":"2024-10-08","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":"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":"2109.10680","title":"rSVDdpd: A Robust Scalable Video Surveillance Background Modelling Algorithm","created":"2021-09-22","cited_by_count":2,"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":"2412.10664","title":"Structured Sampling for Robust Euclidean Distance Geometry","created":"2024-12-14","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":"2505.18414","title":"A Dual Basis Approach for Structured Robust Euclidean Distance Geometry","created":"2025-05-23","cited_by_count":1,"area":null},{"id":"2309.13531","title":"Robust Principal Component Analysis using Density Power Divergence","created":"2023-09-24","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":"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":"2605.25460","title":"Mean-Shift PCA by Knockoff Mean","created":"2026-05-25","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}