Effective pruning of web-scale datasets based on complexity of concept clusters

Amro Abbas, E. Rusak, Kushal Tirumala, Wieland Brendel, Kamalika Chaudhuri +1 more
2/12/2026

No official code found. Best implementation: amro-kamal/effective_pruning (10 stars, last commit 2024-02-26).

Abstract

Utilizing massive web-scale datasets has led to unprecedented performance gains in machine learning models, but also imposes outlandish compute requirements for their training. In order to improve training and data efficiency, we here push the limits of pruning large-scale multimodal datasets for training CLIP-style models. Today's most effective pruning method on ImageNet clusters data samples into separate concepts according to their embedding and prunes away the most prototypical samples. We scale this approach to LAION and improve it by noting that the pruning rate should be concept-specific and adapted to the complexity of the concept. Using a simple and intuitive complexity measure, we are able to reduce the training cost to a quarter of regular training. By filtering from the LAION dataset, we find that training on a smaller set of high-quality data can lead to higher performance with significantly lower training costs. More specifically, we are able to outperform the LAION-trained OpenCLIP-ViT-B32 model on ImageNet zero-shot accuracy by 1.1p.p. while only using 27.7% of the data and training compute. Despite a strong reduction in training cost, we also see improvements on ImageNet dist. shifts, retrieval tasks and VTAB. On the DataComp Medium benchmark, we achieve a new state-of-the-art Imagehttps://info.arxiv.org/help/prep#commentsNet zero-shot accuracy and a competitive average zero-shot accuracy on 38 evaluation tasks.

View on arXivView PDF

Code Implementations(1)

101PythonFeb 6, 20242 years ago

Similar Papers

Cite this paper

@article{abbas2026effective,
  title  = {Effective pruning of web-scale datasets based on complexity of concept clusters},
  author = {Amro Abbas and E. Rusak and Kushal Tirumala and Wieland Brendel and Kamalika Chaudhuri and Ari S. Morcos},
  year   = {2026},
  eprint = {2401.04578},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2401.04578},
  journal = {ICLR 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2401.04578.svg)](https://codeofpaper.com/paper/2401.04578)

Discussion