paper-with-me

Papers

Zero-Shot Coreset Selection: Efficient Pruning for Unlabeled Data

2024-11-22 · Brent A. Griffin, Jacob Marks, Jason J. Corso

Deep learning increasingly relies on massive data with substantial costs for storage, annotation, and model training. To reduce these costs, coreset selection aims to find a representative subset of data to train models while ideally performing on par with the full data training. State-of-the-art coreset methods use carefully-designed criteria to quantify the importance of each data example via ground truth labels and dataset-specific training, then select examples whose scores lie in a certain range to construct a coreset. These methods work well in their respective settings, however, they cannot select data that are unlabeled, which is the majority of real-world data. To that end, this paper motivates and formalizes the problem of unlabeled coreset selection to enable greater scale and reduce annotation costs for deep learning. As a solution, we develop Zero-Shot Coreset Selection (ZCore), a method that efficiently selects coresets without ground truth labels or training on candidate data. Instead, ZCore uses existing foundation models to generate a zero-shot embedding space for unlabeled data, then quantifies the relative importance of each example based on overall coverage and redundancy within the embedding distribution. We evaluate ZCore on four datasets and outperform several state-of-the-art label-based methods, leading to a strong baseline for future research in unlabeled coreset selection. On ImageNet, ZCore selections achieve a downstream model accuracy of 53.99% with only 10% training data, which outperforms label-based methods while removing annotation requirements for 1.15 million images. Our code is publicly available at https://github.com/voxel51/zcore.

📄 PDF Abstract BibTeX arXiv:2411.15349

Code (1)

voxel51/zcore 공식 구현 pytorch

Methods 이 논문이 사용한 방법론

Coresets 설명 없음

Similar Papers 제목 키워드 기반

Coverage-centric Coreset Selection for High Pruning Rates

2022-10-28 · Haizhong Zheng, Rui Liu, Fan Lai, Atul Prakash

One-shot coreset selection aims to select a representative subset of the training data, given a pruning rate, that can later be used to train future models while retaining high accuracy. State-of-the-art coreset selectio…

Vocal Bursts Intensity Prediction

SubZeroCore: A Submodular Approach with Zero Training for Coreset Selection

2025-09-26 · Brian B. Moser, Tobias C. Nauen, Arundhati S. Shanbhag, Federico Raue 외 arxiv

The goal of coreset selection is to identify representative subsets of datasets for efficient model training. Yet, existing approaches paradoxically require expensive training-based signals, e.g., gradients, decision bou…

D2 Pruning: Message Passing for Balancing Diversity and Difficulty in Data Pruning

2023-10-11 · Adyasha Maharana, Prateek Yadav, Mohit Bansal

Analytical theories suggest that higher-quality data can lead to lower test errors in models trained on a fixed data budget. Moreover, a model can be trained on a lower compute budget without compromising performance if …

Diversity

Speculative Coreset Selection for Task-Specific Fine-tuning

2024-10-02 · XiaoYu Zhang, Juan Zhai, Shiqing Ma, Chao Shen 외

Task-specific fine-tuning is essential for the deployment of large language models (LLMs), but it requires significant computational resources and time. Existing solutions have proposed coreset selection methods to impro…

Label-Efficient Dataset Pruning via Semi-Supervised Pseudo-Labeling

2026-05-22 · Yeseul Cho, Baekrok Shin, Changmin Kang, Chulhee Yun arxiv

Dataset pruning reduces the storage and training costs of deep learning by selecting an informative subset from a large dataset. However, most existing pruning methods require fully labeled data, which limits their appli…