Metraipolis › archive › dc_a28c2e3069de
Are Coreset Selection Methods Worth Their Cost? — arXiv:2609.22894
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.22894
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T07:06:55.497Z
- SHA-256 of the archived text
9f52272b2d46d5916147fb2ffaf1cf7d020c6d367c9b51f782f80a248daf32b7- Stable URL of this page
https://metraipolis.com/documento/dc_a28c2e3069de
How to cite
Are Coreset Selection Methods Worth Their Cost? — arXiv:2609.22894 — arXiv (en), https://arxiv.org/abs/2609.22894 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a28c2e3069de (Metraipolis archive dc_a28c2e3069de, sha256 9f52272b2d46d5916147fb2ffaf1cf7d020c6d367c9b51f782f80a248daf32b7)
BibTeX
@misc{dca28c2e3069de,
title = {Are Coreset Selection Methods Worth Their Cost? — arXiv:2609.22894},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.22894},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a28c2e3069de; sha256 9f52272b2d46d5916147fb2ffaf1cf7d020c6d367c9b51f782f80a248daf32b7},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.22894. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Coreset selection picks a representative subset of the labeled training set to make training cheaper. However, it is usually evaluated by downstream accuracy at a fixed subset size, ignoring both the time spent selecting the subset and the training recipe behind each reported number. We introduce an end-to-end benchmark that standardizes downstream training and charges selection and training to the same auditable wall-clock budget, spanning 4 datasets from CIFAR-10 to ImageNet-1K, 11 selectors, 5 fractions, and 3 seeds, with over 1,500 released runs. Repeated-sampling work has shown that budget-aware evaluation already favors random strategies. Our two budget studies test whether that verdict survives when every selector is granted its most favorable operating point. Across eight wall-clock budget anchors on each of CIFAR-10 and Tiny ImageNet, no anchor is won by a sophisticated selector: every winner is class-balanced random sampling, repeated random sampling, or full-data training. In fixed-budget duels on ImageNet-1K, training on all data for fewer epochs beats every selection strategy we probe while also costing the least. A per-dataset cost audit shows that selection cost is dominated at every scale by a fixed full-dataset scan, so it cannot be amortized away by selecting a smaller fraction, and its absolute size does not extrapolate from one dataset to another. We further quantify when selection does pay back through subset reuse, and document 9 correctness fixes to a widely used codebase, one of which shifts a standard Herding baseline by nearly 6 points. Selection time is not free preprocessing, and an evaluation that ignores it measures the wrong quantity. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-22 in cs.LG). Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI); Computer Vision and Pattern Recognition (cs.CV). Pagina del lavoro: https://arxiv.org/abs/2609.22894 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-09T06:58:09.243Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).