Double descent without digital computation
The success of large-scale AI relies on the phenomenon of double descent, where overfitting first increases and then counterintuitively decreases as the network grows relative to the amount of training data and becomes overparameterized. In this overparameterized regime it is easy to find good solutions that do not overfit. However, double descent has not previously been observed in physical neural networks, which are attracting increasing attention but remain small-scale. Here we demonstrate double descent in a decentralized analog network of self-adjusting resistive elements. This system trains itself and performs tasks without a digital processor, offering potential gains in energy efficiency and speed—but must inevitably confront component nonidealities. We find that standard training protocols fail to yield double descent, but a modified protocol that accommodates generic imperfections succeeds, qualitatively matching digital neural network simulations. Our findings show that analog physical neural networks, if appropriately trained, can reproduce important facets of overparameterized digital learning. This result is critical if such networks are to be scaled up to useful sizes.
Authors
- Jason W. Rocks (ORCID: https://orcid.org/0000-0002-0285-0119)
- Douglas J. Durian (ORCID: https://orcid.org/0000-0003-3240-2381)
- Sam Dillavou (ORCID: https://orcid.org/0000-0001-9842-9582)
- Andrea J. Liu (ORCID: https://orcid.org/0000-0002-2295-2729)
- Jacob F. Wycoff
Institutions
- Santa Fe Institute (US)
- University of Pennsylvania (US)
Publication Details
- Journal
- Proceedings of the National Academy of Sciences
- Published
- 2026-09-24
- DOI
- https://doi.org/10.1073/pnas.2604421123
- Primary Topic
- Advanced Memory and Neural Computing
- Type
- article
- Field-Weighted Citation Impact
- 0.00