Journal article · 2020 · Open access
The unreasonable effectiveness of deep learning in artificial intelligence
Proceedings of the National Academy of Sciences, 117(48), 30033–30038 · Published 28 January 2020 · DOI 10.1073/pnas.1907373117
In brief
“The unreasonable effectiveness of deep learning in artificial intelligence” is a 2020 journal article by Terrence J. Sejnowski A B, published in Proceedings of the National Academy of Sciences. OpenAlex counts 497 citations as of 22 November 2026. It is open access: the full text is free to read at PubMed Central.
- Citations
- 497
- Most cited in
- 2023 (106)
- Field-weighted impact
- 21.25
- References
- 43
- Authors
- 1
Abstract
Deep learning networks have been trained to recognize speech, caption photographs, and translate text between languages at high levels of performance. Although applications of deep learning networks to real-world problems have become ubiquitous, our understanding of why they are so effective is lacking. These empirical results should not be possible according to sample complexity in statistics and nonconvex optimization theory. However, paradoxes in the training and effectiveness of deep learning networks are being investigated and insights are being found in the geometry of high-dimensional spaces. A mathematical theory of deep learning would illuminate how they function, allow us to assess the strengths and weaknesses of different network architectures, and lead to major improvements. Deep learning has provided natural ways for humans to communicate with digital devices and is foundational for building artificial general intelligence. Deep learning was inspired by the architecture of the cerebral cortex and insights into autonomy and general intelligence may be found in other brain regions that are essential for planning and survival, but major breakthroughs will be needed to achieve these goals.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
B, T. J. S. A. (2020). The unreasonable effectiveness of deep learning in artificial intelligence. Proceedings of the National Academy of Sciences, 117(48), 30033–30038. https://doi.org/10.1073/pnas.1907373117
MLA 9
B, Terrence J. Sejnowski A. “The unreasonable effectiveness of deep learning in artificial intelligence.” Proceedings of the National Academy of Sciences, vol. 117, no. 48, 2020, pp. 30033–30038. https://doi.org/10.1073/pnas.1907373117.
Chicago
B, Terrence J. Sejnowski A. 2020. “The unreasonable effectiveness of deep learning in artificial intelligence.” Proceedings of the National Academy of Sciences 117 (48): 30033–30038. https://doi.org/10.1073/pnas.1907373117.
Harvard
B, T. J. S. A. (2020) ‘The unreasonable effectiveness of deep learning in artificial intelligence’, Proceedings of the National Academy of Sciences, 117(48), pp. 30033–30038. doi:10.1073/pnas.1907373117.
IEEE
T. J. S. A. B, “The unreasonable effectiveness of deep learning in artificial intelligence,” Proceedings of the National Academy of Sciences, vol. 117, no. 48, pp. 30033–30038, 2020, doi: 10.1073/pnas.1907373117.
BibTeX
@article{b2020unreasonable,
title = {{The unreasonable effectiveness of deep learning in artificial intelligence}},
author = {B, Terrence J. Sejnowski A},
journal = {Proceedings of the National Academy of Sciences},
year = {2020},
volume = {117},
number = {48},
pages = {30033--30038},
doi = {10.1073/pnas.1907373117},
url = {https://doi.org/10.1073/pnas.1907373117}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2018 | 1 | |
| 2019 | 1 | |
| 2020 | 22 | |
| 2021 | 85 | |
| 2022 | 80 | |
| 2023 | 106 | |
| 2024 | 63 | |
| 2025 | 57 | |
| 2026 | 81 |
Its field-weighted citation impact is 21.25: it has been cited 21.25 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
- deep learning
- unreasonable effectiveness of mathematics
- sample complexity
- non-convex optimization
- high-dimensional geometry
- artificial general intelligence
- neuromorphic computing
- cerebral cortex
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
B, T. J. S. A. (2020). The unreasonable effectiveness of deep learning in artificial intelligence. Proceedings of the National Academy of Sciences, 117(48), 30033–30038. https://doi.org/10.1073/pnas.1907373117
How many times has this paper been cited?
497 times, according to OpenAlex on 22 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at PubMed Central: sign in and open the full text from this page.
Who wrote this paper?
Terrence J. Sejnowski A B.
What is the DOI of this paper?
10.1073/pnas.1907373117, permanently at https://doi.org/10.1073/pnas.1907373117. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 22 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.