[2605.04325] On the Architectural Complexity of Neural Networks
-->
Computer Science > Machine Learning
arXiv:2605.04325 (cs)
[Submitted on 5 May 2026]
Title:On the Architectural Complexity of Neural Networks
Authors:Nicholas J. Cooper, François G. Meyer, Michael L. Roberts, Carlos Zapata-Carratalá, Lijun Chen, Danna Gurari<br>View a PDF of the paper titled On the Architectural Complexity of Neural Networks, by Nicholas J. Cooper and 5 other authors
View PDF<br>HTML (experimental)
Abstract:We introduce a unified theoretical framework for the rigorous analysis and systematic construction of deep neural networks (DNNs). This framework addresses a gap in existing theory by explicitly modeling the structure of tensor operations -- lower level information that is often abstracted. Our framework enables two novel objectives: (1) analysis of the evolution of architectural complexity over deep learning history, and (2) automatic construction of novel architectures based on new types of tensor operations. Our study of DNNs introduced over the past 40 years reveals a connection between groundbreaking architectures and increases in different types of architectural complexity. Moreover, we identify several large classes of higher complexity architectures that have not yet been explored. We then collect a dataset of 3,000+ higher complexity architectures, which we publicly release at: this https URL.
Comments:<br>67 pages, 54 figures, 11 tables
Subjects:
Machine Learning (cs.LG); Discrete Mathematics (cs.DM); Combinatorics (math.CO)
Cite as:<br>arXiv:2605.04325 [cs.LG]
(or<br>arXiv:2605.04325v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2605.04325
Focus to learn more
arXiv-issued DOI via DataCite (pending registration)
Submission history<br>From: Nicholas Cooper [view email]<br>[v1]<br>Tue, 5 May 2026 22:05:34 UTC (8,638 KB)
Full-text links:<br>Access Paper:
View a PDF of the paper titled On the Architectural Complexity of Neural Networks, by Nicholas J. Cooper and 5 other authors<br>View PDF<br>HTML (experimental)<br>TeX Source
view license
Current browse context:
cs.LG
next >
new<br>recent<br>| 2026-05
Change to browse by:
cs<br>cs.DM<br>math<br>math.CO
References & Citations
NASA ADS<br>Google Scholar
Semantic Scholar
export BibTeX citation<br>Loading...
BibTeX formatted citation
×
loading...
Data provided by:
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos
Demos
Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers
Recommenders and Search Tools
Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
IArxiv recommender toggle
IArxiv Recommender<br>(What is IArxiv?)
Author
Venue
Institution
Topic
About arXivLabs
arXivLabs: experimental projects with community collaborators
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 .
Which authors of this paper are endorsers? |<br>Disable MathJax (What is MathJax?)