{"total":27,"rows":[{"id":"2204.08499","title":"DeepCore: A Comprehensive Library for Coreset Selection in Deep Learning","created":"2022-04-18","cited_by_count":147,"area":null},{"id":"2202.12793","title":"Towards Optimal Lower Bounds for k-median and k-means Coresets","created":"2022-02-25","cited_by_count":23,"area":null},{"id":"2302.10359","title":"Replicable Clustering","created":"2023-02-20","cited_by_count":19,"area":null},{"id":"2203.04370","title":"New Coresets for Projective Clustering and Applications","created":"2022-03-08","cited_by_count":16,"area":null},{"id":"2106.14952","title":"Adversarial Robustness of Streaming Algorithms through Importance Sampling","created":"2021-06-28","cited_by_count":13,"area":null},{"id":"2110.15263","title":"Coresets for Time Series Clustering","created":"2021-10-28","cited_by_count":8,"area":null},{"id":"2207.00966","title":"An Empirical Evaluation of $k$-Means Coresets","created":"2022-07-03","cited_by_count":7,"area":null},{"id":"2203.03009","title":"Coresets for Data Discretization and Sine Wave Fitting","created":"2022-03-06","cited_by_count":6,"area":null},{"id":"2306.02826","title":"Near-Optimal Quantum Coreset Construction Algorithms for Clustering","created":"2023-06-05","cited_by_count":6,"area":null},{"id":"2111.03046","title":"Introduction to Coresets: Approximated Mean","created":"2021-11-04","cited_by_count":5,"area":null},{"id":"2310.09127","title":"On Generalization Bounds for Projective Clustering","created":"2023-10-13","cited_by_count":4,"area":null},{"id":"2402.05280","title":"No Dimensional Sampling Coresets for Classification","created":"2024-02-07","cited_by_count":4,"area":null},{"id":"2305.07316","title":"Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces","created":"2023-05-12","cited_by_count":2,"area":null},{"id":"2310.16752","title":"Simple, Scalable and Effective Clustering via One-Dimensional Projections","created":"2023-10-25","cited_by_count":2,"area":null},{"id":"2402.00219","title":"FedCore: Straggler-Free Federated Learning with Distributed Coresets","created":"2024-01-31","cited_by_count":2,"area":null},{"id":"2407.03262","title":"Ridge Leverage Score Sampling for $\\ell_p$ Subspace Approximation","created":"2024-07-03","cited_by_count":2,"area":null},{"id":"2412.06063","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","created":"2024-12-08","cited_by_count":2,"area":null},{"id":"2312.15762","title":"On Robust Wasserstein Barycenter: The Model and Algorithm","created":"2023-12-25","cited_by_count":1,"area":null},{"id":"2507.13061","title":"Advancing Complex Wide-Area Scene Understanding with Hierarchical Coresets Selection","created":"2025-07-17","cited_by_count":1,"area":null},{"id":"2603.19061","title":"Hardness of High-Dimensional Linear Classification","created":"2026-03-19","cited_by_count":1,"area":null},{"id":"2211.08184","title":"Improved Coresets for Euclidean $k$-Means","created":"2022-11-15","cited_by_count":0,"area":null},{"id":"2305.16890","title":"Universal Weak Coreset","created":"2023-05-26","cited_by_count":0,"area":null},{"id":"2306.00732","title":"Sharper Bounds for $\\ell_p$ Sensitivity Sampling","created":"2023-06-01","cited_by_count":0,"area":null},{"id":"2311.04158","title":"Computing Approximate $\\ell_p$ Sensitivities","created":"2023-11-07","cited_by_count":0,"area":null},{"id":"2406.02432","title":"Coresets for Multiple $\\ell_p$ Regression","created":"2024-06-04","cited_by_count":0,"area":null},{"id":"2507.14631","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","created":"2025-07-19","cited_by_count":0,"area":null},{"id":"2607.03112","title":"Dimension Reduction for Curves: Simplified and Generalized","created":"2026-07-03","cited_by_count":0,"area":null}],"next_cursor":null}