{"total":38,"rows":[{"id":"2209.08554","title":"Pruning Neural Networks via Coresets and Convex Geometry: Towards No Assumptions","created":"2022-09-18","cited_by_count":20,"area":null},{"id":"2107.06615","title":"Oblivious sketching for logistic regression","created":"2021-07-14","cited_by_count":18,"area":null},{"id":"2111.03044","title":"A Unified Approach to Coreset Learning","created":"2021-11-04","cited_by_count":18,"area":null},{"id":"2210.14664","title":"Coresets for Vertical Federated Learning: Regularized Linear Regression and $K$-Means Clustering","created":"2022-10-26","cited_by_count":14,"area":null},{"id":"2303.05151","title":"Provable Data Subset Selection For Efficient Neural Network Training","created":"2023-03-09","cited_by_count":14,"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":"2203.13568","title":"$p$-Generalized Probit Regression and Scalable Maximum Likelihood Estimation via Sketching and Coresets","created":"2022-03-25","cited_by_count":11,"area":null},{"id":"2110.03195","title":"Coresets for Decision Trees of Signals","created":"2021-10-07","cited_by_count":10,"area":null},{"id":"2110.15263","title":"Coresets for Time Series Clustering","created":"2021-10-28","cited_by_count":8,"area":null},{"id":"2307.08086","title":"Dataset Distillation Meets Provable Subset Selection","created":"2023-07-16","cited_by_count":7,"area":null},{"id":"2107.00068","title":"Robust and Fully-Dynamic Coreset for Continuous-and-Bounded Learning (With Outliers) Problems","created":"2021-06-30","cited_by_count":6,"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":"2403.00680","title":"Scalable Learning of Item Response Theory Models","created":"2024-03-01","cited_by_count":6,"area":null},{"id":"2504.16277","title":"DataS^3: Dataset Subset Selection for Specialization","created":"2025-04-22","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":"2206.07852","title":"Performance analysis of coreset selection for quantum implementation of K-Means clustering algorithm","created":"2022-06-16","cited_by_count":5,"area":null},{"id":"2301.06163","title":"A Coreset Learning Reality Check","created":"2023-01-15","cited_by_count":5,"area":null},{"id":"2305.14113","title":"On the Size and Approximation Error of Distilled Sets","created":"2023-05-23","cited_by_count":3,"area":null},{"id":"2102.04050","title":"A Constant Approximation Algorithm for Sequential Random-Order No-Substitution k-Median Clustering","created":"2021-02-08","cited_by_count":2,"area":null},{"id":"2306.07163","title":"A Batch-to-Online Transformation under Random-Order Model","created":"2023-06-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":"2407.03262","title":"Ridge Leverage Score Sampling for $\\ell_p$ Subspace Approximation","created":"2024-07-03","cited_by_count":2,"area":null},{"id":"2605.30337","title":"Efficient Test-Time Finetuning of LLMs via Convex Reconstruction and Gradient Caching","created":"2026-05-28","cited_by_count":2,"area":null},{"id":"2607.02721","title":"Provable Pruning for Efficient 3D Gaussian Splatting via Coresets","created":"2026-07-02","cited_by_count":2,"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":"2410.22872","title":"Data subsampling for Poisson regression with pth-root-link","created":"2024-10-30","cited_by_count":1,"area":null},{"id":"2102.04282","title":"Communication-efficient k-Means for Edge-based Machine Learning","created":"2021-02-08","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":"2306.10066","title":"On the Interplay of Subset Selection and Informed Graph Neural Networks","created":"2023-06-15","cited_by_count":0,"area":null},{"id":"2310.19068","title":"Sketching Algorithms for Sparse Dictionary Learning: PTAS and Turnstile Streaming","created":"2023-10-29","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":"2408.14225","title":"Provable Imbalanced Point Clustering","created":"2024-08-26","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":"2508.18340","title":"Deterministic Coreset Construction via Adaptive Sensitivity Trimming","created":"2025-08-25","cited_by_count":0,"area":null},{"id":"2510.23438","title":"Coresets for Clustering Under Stochastic Noise","created":"2025-10-27","cited_by_count":0,"area":null},{"id":"2606.20082","title":"Beyond Averaging in John Ellipsoid Approximation: High-Accuracy Algorithms in the Leverage-Score Model","created":"2026-06-18","cited_by_count":0,"area":null},{"id":"2607.04949","title":"Sensitivity Sampling with Predictions for k-Means Clustering","created":"2026-07-06","cited_by_count":0,"area":null},{"id":"2609.06394","title":"Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling","created":"2026-09-06","cited_by_count":0,"area":null}],"next_cursor":null}