Cover Image

On the Architectural Complexity of Neural Networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cooper, Nicholas J., Meyer, François G., Roberts, Michael L., Zapata-Carratalá, Carlos, Chen, Lijun, Gurari, Danna
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Better Neural Network Expressivity: Subdividing the Simplex
by: Bakaev, Egor, et al.
Published: (2025)

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs
by: Bressan, Marco, et al.
Published: (2025)

Bounds on the price of feedback for mistake-bounded online learning
by: Geneson, Jesse, et al.
Published: (2024)

Graphons of Line Graphs
by: Kandanaarachchi, Sevvandi, et al.
Published: (2024)

Maxout Polytopes
by: Balakin, Andrei, et al.
Published: (2025)

Optimal Mixed Integer Linear Optimization Trained Multivariate Classification Trees
by: Alston, Brandon, et al.
Published: (2024)

On the Depth of Monotone ReLU Neural Networks and ICNNs
by: Bakaev, Egor, et al.
Published: (2025)

Depth-Bounds for Neural Networks via the Braid Arrangement
by: Grillo, Moritz, et al.
Published: (2025)

Towards Lower Bounds on the Depth of ReLU Neural Networks
by: Hertrich, Christoph, et al.
Published: (2021)

The Computational Complexity of Counting Linear Regions in ReLU Neural Networks
by: Stargalla, Moritz, et al.
Published: (2025)

Neural Networks and (Virtual) Extended Formulations
by: Hertrich, Christoph, et al.
Published: (2024)

The Symmetries of Three-Layer ReLU Networks
by: Gegenfurtner, Johanna Marie, et al.
Published: (2026)

Extending Robinson Spaces: Complexity and Algorithmic Solutions for Non-Symmetric Dissimilarity Spaces
by: Brucker, Francois, et al.
Published: (2024)

Arithmetic Circuits and Neural Networks for Regular Matroids
by: Hertrich, Christoph, et al.
Published: (2025)

Rainbow copies of spanning subgraphs
by: Cooper, Colin, et al.
Published: (2025)

Complexity Issues Concerning the Quadruple Roman Domination Problem in Graphs
by: Palagiri, V. S. R., et al.
Published: (2024)

The Parameterized Complexity of Computing the VC-Dimension
by: Foucaud, Florent, et al.
Published: (2025)

On the Expressive Power of Spectral Invariant Graph Neural Networks
by: Zhang, Bohang, et al.
Published: (2024)

Digraph Branchings and Matrix Determinants
by: Ghosh, Sayani, et al.
Published: (2023)

On Minimal Depth in Neural Networks
by: Valerdi, Juan L.
Published: (2024)

How to Learn a Star: Binary Classification with Starshaped Polyhedral Sets
by: Brandenburg, Marie-Charlotte, et al.
Published: (2025)

On the Expressibility of the Reconstructional Color Refinement
by: Arvind, V., et al.
Published: (2024)

Trees and Graphs with Non Log-concave Dominating Set Sequence via AI Tools
by: Du, Alina, et al.
Published: (2026)

An AI enhanced approach to the tree unimodality conjecture
by: Ramos, Eric, et al.
Published: (2025)

Density Measures for Language Generation
by: Kleinberg, Jon, et al.
Published: (2025)

Optimizing alphabet reduction pairs of arrays
by: Culus, Jean-François, et al.
Published: (2024)

Acyclic colourings of graphs with obstructions
by: Chuet, Quentin, et al.
Published: (2022)

A Note on the Complexity of Graph Recoloring
by: Bousquet, Nicolas
Published: (2024)

On the Identity and Group Problems for Complex Heisenberg Matrices
by: Bell, Paul C., et al.
Published: (2023)

$k$-Hyperopic Cops and Robber
by: Crawford, Nicholas, et al.
Published: (2024)

The Complexity of Color-constrained Paths in Semicomplete Multipartite Digraphs
by: Brinkmann, Julian
Published: (2025)

Hypergraphs with Polynomial Representation: Introducing $r$-splits
by: Pitois, François, et al.
Published: (2022)

New bounds for proper $h$-conflict-free colourings
by: Chuet, Quentin, et al.
Published: (2025)

Fractional domatic number and minimum degree
by: Chuet, Quentin, et al.
Published: (2025)

On the Complexity of Hop Domination and 2-Step Domination in Graph Classes
by: Das, Sandip, et al.
Published: (2026)

Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
by: Goetze, Miriam, et al.
Published: (2024)

Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles
by: Burke, Kyle, et al.
Published: (2024)

Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
by: Spirkl, Sophie, et al.
Published: (2026)

$χ$-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs
by: Bonamy, Marthe, et al.
Published: (2025)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
by: Baste, Julien, et al.
Published: (2025)