Skip to content
DraconiticResearch
Search Sources API
190,332 studies31 sourcesUpdated 44 min ago
PreprintCC BY 4.0arXiv

Dropout Universality: Scaling Laws and Optimal Scheduling at the Edge-of-Chaos

Abstract

We ask whether the standard treatment of dropout as a static hyperparameter is optimal, or whether its utility can be improved by letting it vary over depth. We answer this by developing a mean-field theory of dropout near the edge of chaos, identifying distinct universality classes for smooth and kinked activations, together with their scaling exponents. The resulting propagation theory, constrained by maximizing the regularization delivered by dropout, motivates concentrating dropout near the input. Experiments on vision, speech and financial time series show gains most consistently in MLPs, with smaller gains in Transformers.

Related

  1. Bulk universality of scaling limits for the almost Hermitian Coulomb gas
    Yacin Ameur
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  2. Optimal Transport Dropout for Structured Predictive Uncertainty
    Giacomo Lorenzon, Francesco Regazzoni
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  3. Mean-field branching SDEs: propagation of chaos, scaling limits and phase transitions
    Shukai Chen, Lina Ji, Xiaowen Zhou
    arXivPreprintCC BY 4.0Full textProbabilityarXiv
  4. Directed distances in spanning-tree-decorated planar maps: exact exponent, scaling limit and universality
    Jacopo Borga, Ewain Gwynne, Yuanzheng Wang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsMathematical physicsarXiv
  5. Optimal Uniform-like Scheduling of Maintenance
    Yakov Genis, Igor Ushakov
    Reliability: Theory & ApplicationsPeer-reviewedCC BY-NCFull textGeneral mathematicsDOAJ
BibTeX
@misc{sarmiento2026dropout,
  title = {{Dropout Universality: Scaling Laws and Optimal Scheduling at the Edge-of-Chaos}},
  author = {Lucas Fernandez Sarmiento},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2605.21648},
  eprint = {2605.21648},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2605.21648},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Dropout Universality: Scaling Laws and Optimal Scheduling at the Edge-of-Chaos
AU  - Lucas Fernandez Sarmiento
PY  - 2026
DA  - 2026/09/29
PB  - arXiv
DO  - 10.48550/arxiv.2605.21648
UR  - https://arxiv.org/abs/2605.21648
AB  - We ask whether the standard treatment of dropout as a static hyperparameter is optimal, or whether its utility can be improved by letting it vary over depth. We answer this by developing a mean-field theory of dropout near the edge of chaos, identifying distinct universality classes for smooth and kinked activations, together with their scaling exponents. The resulting propagation theory, constrained by maximizing the regularization delivered by dropout, motivates concentrating dropout near the input. Experiments on vision, speech and financial time series show gains most consistently in MLPs, with smaller gains in Transformers.
ER  -