Dataset Growth

Ziheng Qin, Zhaopan Xu, Yukun Zhou, Zangwei Zheng, Zebang Cheng +8 more
5/28/2024
cs.LG

No official code found. Best implementation: NUS-HPC-AI-Lab/InfoGrowth (20 stars, last commit 2024-08-06).

Abstract

Deep learning benefits from the growing abundance of available data. Meanwhile, efficiently dealing with the growing data scale has become a challenge. Data publicly available are from different sources with various qualities, and it is impractical to do manual cleaning against noise and redundancy given today's data scale. There are existing techniques for cleaning/selecting the collected data. However, these methods are mainly proposed for offline settings that target one of the cleanness and redundancy problems. In practice, data are growing exponentially with both problems. This leads to repeated data curation with sub-optimal efficiency. To tackle this challenge, we propose InfoGrowth, an efficient online algorithm for data cleaning and selection, resulting in a growing dataset that keeps up to date with awareness of cleanliness and diversity. InfoGrowth can improve data quality/efficiency on both single-modal and multi-modal tasks, with an efficient and scalable design. Its framework makes it practical for real-world data engines.

View on arXivView PDF

Code Implementations(1)

Efficient and Online Dataset Growth Algorithm (with cleanness and diversity awareness) to deal with growing web data

200Shell, PythonMay 28, 20242 years ago

Similar Papers

Cite this paper

@article{qin2024dataset,
  title  = {Dataset Growth},
  author = {Ziheng Qin and Zhaopan Xu and Yukun Zhou and Zangwei Zheng and Zebang Cheng and Hao Tang and Lei Shang and Baigui Sun and Xiaojiang Peng and Radu Timofte and Hongxun Yao and Kai Wang and Yang You},
  year   = {2024},
  eprint = {2405.18347},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.18347v2},
  journal = {ECCV 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/2405.18347.svg)](https://codeofpaper.com/paper/2405.18347)

Discussion