On the Spectral Bias of Neural Networks

Abstract

Neural networks are known to be a class of highly expressive functions able to fit even random input-output mappings with 100% accuracy. In this work we present properties of neural networks that complement this aspect of expressivity. By using tools from Fourier analysis, we highlight a learning bias of deep networks towards low frequency functions – i.e. functions that vary globally without local fluctuations – which manifests itself as a frequency-dependent learning speed. Intuitively, this property is in line with the observation that over-parameterized networks prioritize learning simple patterns that generalize across data samples. We also investigate the role of the shape of the data manifold by presenting empirical and theoretical evidence that, somewhat counter-intuitively, learning higher frequencies gets easier with increasing manifold complexity.

Cite

Text

Rahaman et al. "On the Spectral Bias of Neural Networks." International Conference on Machine Learning, 2019.

Markdown

[Rahaman et al. "On the Spectral Bias of Neural Networks." International Conference on Machine Learning, 2019.](https://mlanthology.org/icml/2019/rahaman2019icml-spectral/)

BibTeX

@inproceedings{rahaman2019icml-spectral,
  title     = {{On the Spectral Bias of Neural Networks}},
  author    = {Rahaman, Nasim and Baratin, Aristide and Arpit, Devansh and Draxler, Felix and Lin, Min and Hamprecht, Fred and Bengio, Yoshua and Courville, Aaron},
  booktitle = {International Conference on Machine Learning},
  year      = {2019},
  pages     = {5301-5310},
  volume    = {97},
  url       = {https://mlanthology.org/icml/2019/rahaman2019icml-spectral/}
}