InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruning

Ziheng Qin, K. Wang, Zangwei Zheng, Jianyang Gu, Xiang Peng +2 more
3/1/2023

Official code: henryqin1997/InfoBatch (6 stars, last commit 2024-01-18). 2 more implementations below.

Abstract

Data pruning aims to obtain lossless performances with less overall cost. A common approach is to filter out samples that make less contribution to the training. This could lead to gradient expectation bias compared to the original data. To solve this problem, we propose \textbf{InfoBatch}, a novel framework aiming to achieve lossless training acceleration by unbiased dynamic data pruning. Specifically, InfoBatch randomly prunes a portion of less informative samples based on the loss distribution and rescales the gradients of the remaining samples to approximate the original gradient. As a plug-and-play and architecture-agnostic framework, InfoBatch consistently obtains lossless training results on classification, semantic segmentation, vision pertaining, and instruction fine-tuning tasks. On CIFAR10/100, ImageNet-1K, and ADE20K, InfoBatch losslessly saves 40\% overall cost. For pertaining MAE and diffusion model, InfoBatch can respectively save 24.8\% and 27\% cost. For LLaMA instruction fine-tuning, InfoBatch is also able to save 20\% cost and is compatible with coreset selection methods. The code is publicly available at \href{https://github.com/henryqin1997/InfoBatch}{github.com/NUS-HPC-AI-Lab/InfoBatch}.

View on arXivView PDF

Code Implementations(3)

Moved to https://github.com/NUS-HPC-AI-Lab/InfoBatch

60Jan 18, 20242 years ago

Lossless Training Speed Up by Unbiased Dynamic Data Pruning

34719PythonMar 8, 20232 years ago

Pytorch implementation of InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruning, ICML 2024

01Shell, PythonMay 22, 20247 months ago

Similar Papers

Cite this paper

@article{qin2023infobatch,
  title  = {InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruning},
  author = {Ziheng Qin and K. Wang and Zangwei Zheng and Jianyang Gu and Xiang Peng and Daquan Zhou and Yang You},
  year   = {2023},
  eprint = {2303.04947},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/pdf/2303.04947},
  journal = {ICLR 2023 2023}
}

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/2303.04947.svg)](https://codeofpaper.com/paper/2303.04947)

Discussion