Practical Coreset Constructions for Machine Learning
read the original abstract
We investigate coresets - succinct, small summaries of large data sets - so that solutions found on the summary are provably competitive with solution found on the full data set. We provide an overview over the state-of-the-art in coreset construction for machine learning. In Section 2, we present both the intuition behind and a theoretically sound framework to construct coresets for general problems and apply it to $k$-means clustering. In Section 3 we summarize existing coreset construction algorithms for a variety of machine learning problems such as maximum likelihood estimation of mixture models, Bayesian non-parametric models, principal component analysis, regression and general empirical risk minimization.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Check, Please: Verifiably Fair Clustering
DC-mPJR+ is a new proportionality concept for clustering that can be verified in O(mn log n + mnk) time and ensures that any clustering satisfying it also satisfies an approximate version of the stronger mPJR fairness...
-
Stationary MMD Points
Stationary MMD points show super-convergence in integration error over MMD for RKHS integrands, and MMD gradient flows compute them with a new non-asymptotic finite-particle error bound.
-
ASSS: A Differentiable Adversarial Framework for Task-Aware Data Reduction
ASSS uses an adversarial selector and Gumbel-Softmax relaxation to retain 98.9% task performance with only 30% of the data by preferentially keeping boundary samples.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.