aiqbench analysis
This research applies percolation theory from statistical physics to analyze dropout regularization in deep neural networks, revealing how random connection removal can theoretically sever paths between input and output layers. The study identifies a critical threshold where excessive dropout causes training breakdowns, particularly in bias-free networks, offering new theoretical insights into the stability of network topology during optimization.
Dropout Neural Network Training Viewed from a Percolation Perspective
arXiv:2512.13853v3 Announce Type: replace Abstract: In this work, we investigate the existence and effect of percolation in training deep Neural Networks (NNs) with dropout. Dropout methods are regularisation techniques for training NNs, first introduced by G. Hinton et al. (2012). These methods temporarily remove connections in the NN, randomly at each stage of training, and update the remaining subnetwork with Stochastic Gradient Descent (SGD). The process of removing connections from a network at random is similar to percolation, a paradigm model of statistical physics. If dropout were to remove enough connections such that there is no path between the input and output of the NN, then the NN could not make predictions informed by the data. We study new percolation models that mimic dropout in NNs and characterise the relationship between network topology and this path problem. The theory shows the existence of a percolative effect in dropout. We also show that this percolative effect can cause a breakdown when training NNs without biases with dropout; and we argue heuristically that this breakdown extends to NNs with biases.
Abstract:In this work, we investigate the existence and effect of percolation in training deep Neural Networks (NNs) with dropout. Dropout methods are regularisation techniques for training NNs, first introduced by G. Hinton et al. (2012). These methods temporarily remove connections in the NN, randomly at each stage of training, and update the remaining subnetwork with Stochastic Gradient Descent (SGD). The process of removing connections from a network at random is similar to percolation, a paradigm model of statistical physics. If dropout were to remove enough connections such that there is no path between the input and output of the NN, then the NN could not make predictions informed by the data. We study new percolation models that mimic dropout in NNs and characterise the relationship between network topology and this path problem. The theory shows the existence of a percolative effect in dropout. We also show that this percolative effect can cause a breakdown when training NNs without biases with dropout; and we argue heuristically that this breakdown extends to NNs with biases.
Machine Learning (cs.LG); Statistical Mechanics (cond-mat.stat-mech); Probability (math.PR); Machine Learning (stat.ML)
arXiv:2512.13853 [cs.LG]
(or arXiv:2512.13853v3 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2512.13853 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 273 words
Related coverage
Dropout Neural Network Training Viewed from a Percolation Perspective
arXiv · Jun 17, 2026

Presentation: Exploding GPUs
InfoQ · Oct 16, 2026
The J-Space Debate, Agent Swarms, and Pacing Frontier AI - Digital Minds Newsletter #4
LessWrong · Sep 18, 2026
Reasons to believe current AI models are conscious
LessWrong · Jul 17, 2026