mlsanityData to 7 Oct 2026

AutoCoreset: An Automatic Practical Coreset Construction Framework

arXiv 2305.11980 ↗First posted 19 May 2023cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

A coreset is a tiny weighted subset of an input set, that closely resembles the loss function, with respect to a certain set of queries. Coresets became prevalent in machine learning as they have shown to be advantageous for many applications. While coreset research is an active research area, unfortunately, coresets are constructed in a problem-dependent manner, where for each problem, a new coreset construction algorithm is usually suggested, a process that may take time or may be hard for new researchers in the field. Even the generic frameworks require additional (problem-dependent) computations or proofs to be done by the user. Besides, many problems do not have (provable) small coresets, limiting their applicability. To this end, we suggest an automatic practical framework for constructing coresets, which requires (only) the input data and the desired cost function from the user, without the need for any other task-related computation to be done by the user. To do so, we reduce the problem of approximating a loss function to an instance of vector summation approximation, where the vectors we aim to sum are loss vectors of a specific subset of the queries, such that we aim to approximate the image of the function on this subset. We show that while this set is limited, the coreset is quite general. An extensive experimental study on various machine learning applications is also conducted. Finally, we provide a ``plug and play" style implementation, proposing a user-friendly system that can be easily used to apply coresets for many problems. Full open source code can be found at hrefhttps://github.com/alaamaalouf/AutoCoresethttps://github.com/alaamaalouf/AutoCoreset. We believe that these contributions enable future research and easier use and applications of coresets.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 23 of its 53 references that are in the map. First posted on arXiv 19 May 2023.

Builds on

23 of 53 references.

References · 23

  1. 2015Recent Advances in Convolutional Neural Networkscited by 360
  2. 2020BERT Loses Patience: Fast and Robust Inference with Early Exitcited by 267
  3. 2018On Coresets for Logistic Regressioncited by 65
  4. 2016Coresets and Sketchescited by 63
  5. 2020Coresets for Near-Convex Functionscited by 38
  6. 2019Discrepancy, Coresets, and Sketches in Machine Learningcited by 30
  7. 2013Distributed k-Means and k-Median Clustering on General Topologiescited by 24
  8. 2022Pruning Neural Networks via Coresets and Convex Geometry: Towards No Assumptionscited by 20
  9. 2020On Coresets for Support Vector Machinescited by 19
  10. 2020Sets Clusteringcited by 19
  11. 2019Introduction to Coresets: Accurate Coresetscited by 17
  12. 2022New Coresets for Projective Clustering and Applicationscited by 16
11 more
  1. 2017One-Shot Coresets: The Case of k-Clusteringcited by 15
  2. 2023Provable Data Subset Selection For Efficient Neural Network Trainingcited by 14
  3. 2019Tight Sensitivity Bounds For Smaller Coresetscited by 11
  4. 2019Fast and Accurate Least-Mean-Squares Solverscited by 10
  5. 2019Coresets for Ordered Weighted Clusteringcited by 8
  6. 2019On Coresets for Regularized Loss Minimizationcited by 6
  7. 2022Coresets for Data Discretization and Sine Wave Fittingcited by 6
  8. 2022Obstacle Aware Sampling for Path Planningcited by 6
  9. 2023An Efficient Drifters Deployment Strategy to Evaluate Water Current Velocity Fieldscited by 6
  10. 2021Introduction to Coresets: Approximated Meancited by 5
  11. 2017Coresets for Vector Summarization with Applications to Network Graphscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 0; 2025: 0; 2026: 2.

4 papers.