Progressive Data Dropout: An Embarrassingly Simple Approach to Faster Training

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Sathiyanarayanan, Shriram M, Hao, Xinyue, Hou, Shihao, Lu, Yang, Sevilla-Lara, Laura, Arnab, Anurag, Gowda, Shreyank N
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866909866706075648
author Sathiyanarayanan, Shriram M
Hao, Xinyue
Hou, Shihao
Lu, Yang
Sevilla-Lara, Laura
Arnab, Anurag
Gowda, Shreyank N
author_facet Sathiyanarayanan, Shriram M
Hao, Xinyue
Hou, Shihao
Lu, Yang
Sevilla-Lara, Laura
Arnab, Anurag
Gowda, Shreyank N
contents The success of the machine learning field has reliably depended on training on large datasets. While effective, this trend comes at an extraordinary cost. This is due to two deeply intertwined factors: the size of models and the size of datasets. While promising research efforts focus on reducing the size of models, the other half of the equation remains fairly mysterious. Indeed, it is surprising that the standard approach to training remains to iterate over and over, uniformly sampling the training dataset. In this paper we explore a series of alternative training paradigms that leverage insights from hard-data-mining and dropout, simple enough to implement and use that can become the new training standard. The proposed Progressive Data Dropout reduces the number of effective epochs to as little as 12.4% of the baseline. This savings actually do not come at any cost for accuracy. Surprisingly, the proposed method improves accuracy by up to 4.82%. Our approach requires no changes to model architecture or optimizer, and can be applied across standard training pipelines, thus posing an excellent opportunity for wide adoption. Code can be found here: https://github.com/bazyagami/LearningWithRevision
format Preprint
id arxiv_https___arxiv_org_abs_2505_22342
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Progressive Data Dropout: An Embarrassingly Simple Approach to Faster Training
Sathiyanarayanan, Shriram M
Hao, Xinyue
Hou, Shihao
Lu, Yang
Sevilla-Lara, Laura
Arnab, Anurag
Gowda, Shreyank N
Computer Vision and Pattern Recognition
Machine Learning
The success of the machine learning field has reliably depended on training on large datasets. While effective, this trend comes at an extraordinary cost. This is due to two deeply intertwined factors: the size of models and the size of datasets. While promising research efforts focus on reducing the size of models, the other half of the equation remains fairly mysterious. Indeed, it is surprising that the standard approach to training remains to iterate over and over, uniformly sampling the training dataset. In this paper we explore a series of alternative training paradigms that leverage insights from hard-data-mining and dropout, simple enough to implement and use that can become the new training standard. The proposed Progressive Data Dropout reduces the number of effective epochs to as little as 12.4% of the baseline. This savings actually do not come at any cost for accuracy. Surprisingly, the proposed method improves accuracy by up to 4.82%. Our approach requires no changes to model architecture or optimizer, and can be applied across standard training pipelines, thus posing an excellent opportunity for wide adoption. Code can be found here: https://github.com/bazyagami/LearningWithRevision
title Progressive Data Dropout: An Embarrassingly Simple Approach to Faster Training
topic Computer Vision and Pattern Recognition
Machine Learning
url https://arxiv.org/abs/2505.22342