arXiv (All)
open access
On Minimal Depth in Neural Networks
Understanding the relationship between the depth of a neural network and its representational capacity is a central problem in deep learning theory. In this work, we develop a geometric framework to analyze the expressivity of ReLU networks with the notion of depth complexity for convex polytopes. T
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Every Layer Counts: An Exponential $L_2$ Depth Hierarchy for ReLU Networks#793908
- Every Layer Counts: An Exponential $L_2$ Depth Hierarchy for ReLU Networks#789889
- Official Review · ICLR 2025#787156
- Representation Similarity and Transformation-Dependent Stability: Distinction and Boundary Conditions in Neural Networks#81454
- Generalization in Neural Networks Through the Lens of Magnitude Potential#1156904
Record · ID 1051957
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive