about
On the spectral bias of neural networks (arxiv.org)
1 point by underanalyzer on Jan 1, 2023 | hide | past | pdf | discuss on HN

In plain words: Using Fourier analysis, the study shows deep networks of simple threshold units favor smooth, low-frequency patterns: they cannot wiggle in one spot without changing behavior everywhere. High-frequency patterns become easier to learn as the data's shape grows more complex, and need finely tuned weights.

Abstract · On the Spectral Bias of Neural Networks

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 show that deep ReLU networks are biased towards low frequency functions, meaning that they cannot have local fluctuations without affecting their global behavior. Intuitively, this property is in line with the observation that over-parameterized networks find simple patterns that generalize across data samples. We also investigate how the shape of the data manifold affects expressivity by showing evidence that learning high frequencies gets \emph{easier} with increasing manifold complexity, and present a theoretical understanding of this behavior. Finally, we study the robustness of the frequency components with respect to parameter perturbation, to develop the intuition that the parameters must be finely tuned to express high frequency functions.

Nasim Rahaman, Aristide Baratin, Devansh Arpit, Felix Draxler, Min Lin, Fred A. Hamprecht, Yoshua Bengio, Aaron Courville
arXiv:1806.08734 · stat.ML, cs.LG · submitted Jun 22, 2018 · updated May 31, 2019
abstract · pdf · html · 23 pages

add comment on HN