Neural networks are a priori biased towards Boolean functions with low entropy
Not on the map. Why?
Abstract (arXiv)
Understanding the inductive bias of neural networks is critical to explaining their ability to generalise. Here, for one of the simplest neural networks -- a single-layer perceptron with n input neurons, one output neuron, and no threshold bias term -- we prove that upon random initialisation of weights, the a priori probability P(t) that it represents a Boolean function that classifies t points in 0,1n as 1 has a remarkably simple form: P(t) = 2-n for 0≤ t < 2n. Since a perceptron can express far fewer Boolean functions with small or large values of t (low entropy) than with intermediate values of t (high entropy) there is, on average, a strong intrinsic a-priori bias towards individual functions with low entropy. Furthermore, within a class of functions with fixed t, we often observe a further intrinsic bias towards functions of lower complexity. Finally, we prove that, regardless of the distribution of inputs, the bias towards low entropy becomes monotonically stronger upon adding ReLU layers, and empirically show that increasing the variance of the bias term has a similar effect.
Key facts. Cited by 24 papers in the map (data through 14 Oct 2026). First posted on arXiv 25 Sep 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 3; 2023: 3; 2024: 7; 2025: 4; 2026: 3.
24 papers.
Sort:
By area:
- 2024Towards Guaranteed Safe AI: A Framework for Ensuring Robust and Reliable AI Systemscited by 96
- 2024SimBa: Simplicity Bias for Scaling Up Parameters in Deep Reinforcement Learningcited by 76
- 2022Simplicity Bias in Transformers and their Ability to Learn Sparse Boolean Functionscited by 70
- 2022Overview frequency principle/spectral bias in deep learningcited by 69
- 2025Can Large Reasoning Models Self-Train?cited by 68
- 2023The No Free Lunch Theorem, Kolmogorov Complexity, and the Role of Inductive Biases in Machine Learningcited by 63
- 2024Neural Redshift: Random Networks are not Random Functionscited by 43
- 2021Embedding Principle of Loss Landscape of Deep Neural Networkscited by 38
- 2021Embedding Principle: a hierarchical structure of loss landscape of deep neural networkscited by 22
- 2024Position: Understanding LLMs Requires More Than Statistical Generalizationcited by 21
- 2021Why flatness does and does not correlate with generalization for deep neural networkscited by 13
- 2025Do We Always Need the Simplicity Bias? Looking for Optimal Inductive Biases in the Wildcited by 13
12 more
- 2022A law of adversarial risk, interpolation, and label noisecited by 8
- 2021Double-descent curves in neural networks: a new perspective using Gaussian processescited by 5
- 2024Do Quantum Neural Networks have Simplicity Bias?cited by 3
- 2024Exploiting the equivalence between quantum neural networks and perceptronscited by 3
- 2024Neural Networks Generalize on Low Complexity Datacited by 3
- 2026Can Transformers Really Do It All? On the Compatibility of Inductive Biases Across Taskscited by 2
- 2025Characterising the Inductive Biases of Neural Networks on Boolean Datacited by 1
- 2023Points of non-linearity of functions generated by random neural networkscited by 0
- 2023Simplicity bias, algorithmic probability, and the random logistic mapcited by 0
- 2025A Modern Look at Simplicity Bias in Image Classification Taskscited by 0
- 2026Trapped by simplicity: When Transformers fail to learn from noisy featurescited by 0
- 2026Do Deep Networks Forget Initialization? A Forgetting-Time View of Practical Inductive Biascited by 0
- 2026Can Transformers Really Do It All? On the Compatibility of Inductive Biases Across Tasks20 Jul 2026
- 2026Do Deep Networks Forget Initialization? A Forgetting-Time View of Practical Inductive Bias27 May 2026
- 2026Trapped by simplicity: When Transformers fail to learn from noisy features9 Feb 2026
- 2025A Modern Look at Simplicity Bias in Image Classification Tasks13 Sep 2025
- 2025Characterising the Inductive Biases of Neural Networks on Boolean Data29 May 2025
- 2025Can Large Reasoning Models Self-Train?27 May 2025
- 2025Do We Always Need the Simplicity Bias? Looking for Optimal Inductive Biases in the Wild13 Mar 2025
- 2024SimBa: Simplicity Bias for Scaling Up Parameters in Deep Reinforcement Learning13 Oct 2024
- 2024Neural Networks Generalize on Low Complexity Data19 Sep 2024
- 2024Exploiting the equivalence between quantum neural networks and perceptrons5 Jul 2024
- 2024Do Quantum Neural Networks have Simplicity Bias?3 Jul 2024
- 2024Towards Guaranteed Safe AI: A Framework for Ensuring Robust and Reliable AI Systems10 May 2024
12 more
- 2024Position: Understanding LLMs Requires More Than Statistical Generalization3 May 2024
- 2024Neural Redshift: Random Networks are not Random Functions4 Mar 2024
- 2023Simplicity bias, algorithmic probability, and the random logistic map31 Dec 2023
- 2023Points of non-linearity of functions generated by random neural networks19 Apr 2023
- 2023The No Free Lunch Theorem, Kolmogorov Complexity, and the Role of Inductive Biases in Machine Learning11 Apr 2023
- 2022Simplicity Bias in Transformers and their Ability to Learn Sparse Boolean Functions22 Nov 2022
- 2022A law of adversarial risk, interpolation, and label noise8 Jul 2022
- 2022Overview frequency principle/spectral bias in deep learning19 Jan 2022
- 2021Embedding Principle: a hierarchical structure of loss landscape of deep neural networks30 Nov 2021
- 2021Embedding Principle of Loss Landscape of Deep Neural Networks30 May 2021
- 2021Why flatness does and does not correlate with generalization for deep neural networks10 Mar 2021
- 2021Double-descent curves in neural networks: a new perspective using Gaussian processes14 Feb 2021
- 2025Can Large Reasoning Models Self-Train?cited by 68
- 2025Can Large Reasoning Models Self-Train?27 May 2025
- 2022Simplicity Bias in Transformers and their Ability to Learn Sparse Boolean Functionscited by 70
- 2022Overview frequency principle/spectral bias in deep learningcited by 69
- 2023The No Free Lunch Theorem, Kolmogorov Complexity, and the Role of Inductive Biases in Machine Learningcited by 63
- 2024Neural Redshift: Random Networks are not Random Functionscited by 43
- 2021Embedding Principle of Loss Landscape of Deep Neural Networkscited by 38
- 2021Embedding Principle: a hierarchical structure of loss landscape of deep neural networkscited by 22
- 2024Position: Understanding LLMs Requires More Than Statistical Generalizationcited by 21
- 2021Why flatness does and does not correlate with generalization for deep neural networkscited by 13
- 2025Do We Always Need the Simplicity Bias? Looking for Optimal Inductive Biases in the Wildcited by 13
- 2022A law of adversarial risk, interpolation, and label noisecited by 8
- 2021Double-descent curves in neural networks: a new perspective using Gaussian processescited by 5
- 2024Do Quantum Neural Networks have Simplicity Bias?cited by 3
12 most cited of 21 All 21 (JSON)
- 2026Can Transformers Really Do It All? On the Compatibility of Inductive Biases Across Tasks20 Jul 2026
- 2026Do Deep Networks Forget Initialization? A Forgetting-Time View of Practical Inductive Bias27 May 2026
- 2026Trapped by simplicity: When Transformers fail to learn from noisy features9 Feb 2026
- 2025A Modern Look at Simplicity Bias in Image Classification Tasks13 Sep 2025
- 2025Characterising the Inductive Biases of Neural Networks on Boolean Data29 May 2025
- 2025Do We Always Need the Simplicity Bias? Looking for Optimal Inductive Biases in the Wild13 Mar 2025
- 2024Neural Networks Generalize on Low Complexity Data19 Sep 2024
- 2024Exploiting the equivalence between quantum neural networks and perceptrons5 Jul 2024
- 2024Do Quantum Neural Networks have Simplicity Bias?3 Jul 2024
- 2024Position: Understanding LLMs Requires More Than Statistical Generalization3 May 2024
- 2024Neural Redshift: Random Networks are not Random Functions4 Mar 2024
- 2023Simplicity bias, algorithmic probability, and the random logistic map31 Dec 2023
12 newest of 21 All 21 (JSON)