Dynamic Sparse Training versus Dense Training: The Unexpected Winner in Image Corruption Robustness

Boqian Wu, Qiao Xiao, Shunxin Wang, N. Strisciuglio, Mykola Pechenizkiy +3 more
2/12/2026

No confident code implementation found for this paper.

Abstract

It is generally perceived that Dynamic Sparse Training opens the door to a new era of scalability and efficiency for artificial neural networks at, perhaps, some costs in accuracy performance for the classification task. At the same time, Dense Training is widely accepted as being the"de facto"approach to train artificial neural networks if one would like to maximize their robustness against image corruption. In this paper, we question this general practice. Consequently, we claim that, contrary to what is commonly thought, the Dynamic Sparse Training methods can consistently outperform Dense Training in terms of robustness accuracy, particularly if the efficiency aspect is not considered as a main objective (i.e., sparsity levels between 10% and up to 50%), without adding (or even reducing) resource cost. We validate our claim on two types of data, images and videos, using several traditional and modern deep learning architectures for computer vision and three widely studied Dynamic Sparse Training algorithms. Our findings reveal a new yet-unknown benefit of Dynamic Sparse Training and open new possibilities in improving deep learning robustness beyond the current state of the art.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{wu2026dynamic,
  title  = {Dynamic Sparse Training versus Dense Training: The Unexpected Winner in Image Corruption Robustness},
  author = {Boqian Wu and Qiao Xiao and Shunxin Wang and N. Strisciuglio and Mykola Pechenizkiy and M. V. Keulen and D. Mocanu and Elena Mocanu},
  year   = {2026},
  eprint = {2410.03030},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2410.03030},
  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/2410.03030.svg)](https://codeofpaper.com/paper/2410.03030)

Discussion