{"total":18,"rows":[{"id":"2311.08675","title":"Refined Coreset Selection: Towards Minimal Coreset Size under Model Performance Constraints","created":"2023-11-15","cited_by_count":13,"area":null},{"id":"2402.06730","title":"A Scalable Algorithm for Individually Fair K-means Clustering","created":"2024-02-09","cited_by_count":8,"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":"2310.09127","title":"On Generalization Bounds for Projective Clustering","created":"2023-10-13","cited_by_count":4,"area":null},{"id":"2404.01936","title":"Settling Time vs. Accuracy Tradeoffs for Clustering Big Data","created":"2024-04-02","cited_by_count":4,"area":null},{"id":"2501.06588","title":"A Tight VC-Dimension Analysis of Clustering Coresets with Applications","created":"2025-01-11","cited_by_count":4,"area":null},{"id":"2312.09885","title":"Simple Weak Coresets for Non-Decomposable Classification Measures","created":"2023-12-15","cited_by_count":1,"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":"2411.01115","title":"Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems","created":"2024-11-02","cited_by_count":1,"area":null},{"id":"2507.16729","title":"Improving Model Classification by Optimizing the Training Dataset","created":"2025-07-22","cited_by_count":1,"area":null},{"id":"2510.12669","title":"Structure-Aware Spectral Sparsification via Uniform Edge Sampling","created":"2025-10-14","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":"2410.17945","title":"Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization","created":"2024-10-23","cited_by_count":0,"area":null},{"id":"2601.19333","title":"Metric $k$-clustering using only Weak Comparison Oracles","created":"2026-01-27","cited_by_count":0,"area":null},{"id":"2606.03839","title":"Text-attributed Graph Condensation via Text Selection and Attribute Matching","created":"2026-06-02","cited_by_count":0,"area":null},{"id":"2608.16101","title":"EMS Coreset: An Efficient Expectation-Maximization Algorithm for Sinkhorn Coreset","created":"2026-08-17","cited_by_count":0,"area":null},{"id":"2609.07974","title":"A Sub-4 Approximation for Fair $k$-Means","created":"2026-09-07","cited_by_count":0,"area":null}],"next_cursor":null}