{"total":16,"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":"2101.05231","title":"Robust CUR Decomposition: Theory and Imaging Applications","created":"2021-01-05","cited_by_count":20,"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":"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":"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":"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":"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":"2307.05893","title":"Deep Unrolling for Nonconvex Robust Principal Component Analysis","created":"2023-07-12","cited_by_count":2,"area":null},{"id":"2408.08567","title":"S$^3$Attention: Improving Long Sequence Attention with Smoothed Skeleton Sketching","created":"2024-08-16","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":"2103.10787","title":"LSDAT: Low-Rank and Sparse Decomposition for Decision-based Adversarial Attack","created":"2021-03-19","cited_by_count":1,"area":null},{"id":"2401.16836","title":"Coseparable Nonnegative Tensor Factorization With T-CUR Decomposition","created":"2024-01-30","cited_by_count":1,"area":null},{"id":"2309.17403","title":"Maximal Volume Matrix Cross Approximation for Image Compression and Least Squares Solution","created":"2023-09-29","cited_by_count":0,"area":null}],"next_cursor":null}