English

Ensembles provably learn equivariance through data augmentation

Machine Learning 2025-12-19 v2 Numerical Analysis Numerical Analysis

Abstract

Recently, it was proved that group equivariance emerges in ensembles of neural networks as the result of full augmentation in the limit of infinitely wide neural networks (neural tangent kernel limit). In this paper, we extend this result significantly. We provide a proof that this emergence does not depend on the neural tangent kernel limit at all. We also consider stochastic settings, and furthermore general architectures. For the latter, we provide a simple sufficient condition on the relation between the architecture and the action of the group for our results to hold. We validate our findings through simple numeric experiments.

Cite

@article{arxiv.2410.01452,
  title  = {Ensembles provably learn equivariance through data augmentation},
  author = {Oskar Nordenfors and Axel Flinth},
  journal= {arXiv preprint arXiv:2410.01452},
  year   = {2025}
}

Comments

v2, significant update, significant rewrite, new results added

R2 v1 2026-06-28T19:05:04.030Z