arXiv (All)
open access
Shallower ReLU Network Representations via Exact Linear Algebra
We study the depth required by ReLU networks to exactly represent piecewise linear functions, focusing specifically on the maximum function. This problem has recently received significant attention in both the ML and TCS literature. We prove that $\max_n(x)=\max\{x_1,\ldots,x_n\}$ is exactly represe
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
- Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach#974311
- The Road Taken: The Role of Optimizers at the Edge of Stability#1141626
- CyclOT: Learning Quadratic Optimal Transport Maps via Synchronized Forward-Backward Interpolants#1083386
- Configuration-Dependent Lower Bounds for Approximation by Shallow ReLU$^k$ Networks on the Sphere#998028
- Beyond Sequence Order: Syntax-Informed Positional Embeddings for Transformers#432586
Record · ID 821472
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