{"total":19,"rows":[{"id":"2305.00316","title":"The Ideal Continual Learner: An Agent That Never Forgets","created":"2023-04-29","cited_by_count":35,"area":null},{"id":"2203.14493","title":"ARCS: Accurate Rotation and Correspondence Search","created":"2022-03-28","cited_by_count":15,"area":null},{"id":"2203.13716","title":"Stabilizing Adversarially Learned One-Class Novelty Detection Using Pseudo Anomalies","created":"2022-03-25","cited_by_count":14,"area":null},{"id":"2101.09446","title":"Unlabeled Principal Component Analysis and Matrix Completion","created":"2021-01-23","cited_by_count":5,"area":null},{"id":"2401.04071","title":"Fun with Flags: Robust Principal Directions via Flag Manifolds","created":"2024-01-08","cited_by_count":5,"area":null},{"id":"2211.02163","title":"A Riemannian ADMM","created":"2022-11-03","cited_by_count":3,"area":null},{"id":"2204.10675","title":"Unknown Face Presentation Attack Detection via Localised Learning of Multiple Kernels","created":"2022-04-22","cited_by_count":2,"area":null},{"id":"2502.06022","title":"Nested subspace learning with flags","created":"2025-02-09","cited_by_count":2,"area":null},{"id":"2104.04199","title":"A Riemannian smoothing steepest descent method for non-Lipschitz optimization on submanifolds","created":"2021-04-09","cited_by_count":1,"area":null},{"id":"2404.04456","title":"Beyond the Known: Adversarial Autoencoders in Novelty Detection","created":"2024-04-06","cited_by_count":1,"area":null},{"id":"2411.10058","title":"Unsupervised Congestion Status Identification Using LMP Data","created":"2024-11-15","cited_by_count":1,"area":null},{"id":"2502.07782","title":"A Flag Decomposition for Hierarchical Datasets","created":"2025-02-11","cited_by_count":1,"area":null},{"id":"2106.12190","title":"Closed-Form, Provable, and Robust PCA via Leverage Statistics and Innovation Search","created":"2021-06-23","cited_by_count":0,"area":null},{"id":"2110.02918","title":"Boosting RANSAC via Dual Principal Component Pursuit","created":"2021-10-06","cited_by_count":0,"area":null},{"id":"2201.09079","title":"Implicit Bias of Projected Subgradient Method Gives Provable Robust Recovery of Subspaces of Unknown Codimension","created":"2022-01-22","cited_by_count":0,"area":null},{"id":"2209.02034","title":"Fast geometric trim fitting using partial incremental sorting and accumulation","created":"2022-09-05","cited_by_count":0,"area":null},{"id":"2306.03331","title":"A Robust Likelihood Model for Novelty Detection","created":"2023-06-06","cited_by_count":0,"area":null},{"id":"2404.08292","title":"AdaContour: Adaptive Contour Descriptor with Hierarchical Representation","created":"2024-04-12","cited_by_count":0,"area":null},{"id":"2604.22405","title":"Robust Fuzzy local k-plane clustering with mixture distance of hinge loss and L1 norm","created":"2026-04-24","cited_by_count":0,"area":null}],"next_cursor":null}