English

Efficient Deep Learning with Decorrelated Backpropagation

Machine Learning 2025-11-12 v5

Abstract

The backpropagation algorithm remains the dominant and most successful method for training deep neural networks (DNNs). At the same time, training DNNs at scale comes at a significant computational cost and therefore a high carbon footprint. Converging evidence suggests that input decorrelation may speed up deep learning. However, to date, this has not yet translated into substantial improvements in training efficiency in large-scale DNNs. This is mainly caused by the challenge of enforcing fast and stable network-wide decorrelation. Here, we show for the first time that much more efficient training of deep convolutional neural networks is feasible by embracing decorrelated backpropagation as a mechanism for learning. To achieve this goal we made use of a novel algorithm which induces network-wide input decorrelation using minimal computational overhead. By combining this algorithm with careful optimizations, we achieve a more than two-fold speed-up and higher test accuracy compared to backpropagation when training several deep residual networks. This demonstrates that decorrelation provides exciting prospects for efficient deep learning at scale.

Keywords

Cite

@article{arxiv.2405.02385,
  title  = {Efficient Deep Learning with Decorrelated Backpropagation},
  author = {Sander Dalm and Joshua Offergeld and Nasir Ahmad and Marcel van Gerven},
  journal= {arXiv preprint arXiv:2405.02385},
  year   = {2025}
}
R2 v1 2026-06-28T16:16:01.256Z