arXiv (All)
open access
A Witnessing Duality for ReLU Network Depth
A depth lower bound for ReLU networks asserts that every shallower network errs on some input; we ask when a weak theory can prove such a bound so that an error can be computed. For the exact computation of $\max(x_1,\ldots,x_n)$, recent work shows two hidden layers suffice with unrestricted rationa
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
- Sieve-free ReLU Bayesian priors with near-minimax posterior contraction#1387586
- Configuration-Dependent Lower Bounds for Approximation by Shallow ReLU$^k$ Networks on the Sphere#998028
- Connecting max-entropy with computational geometry, LP and SDP#1014588
- Informational Linkage Gaps and the Structural Limits#113259
- Mixture-of-Top-k Attention: Efficient Attention via Scalable Fast Weights#1117316
Record · ID 1489073
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