cs.CC · 2026-10-21 · No. 150
Computational Complexity, 2026-10-21.
1 new papers in cs.CC. Titles, authors,
abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →
01 — The papers
1 entries-
01
Two $\operatorname{ReLU}$ Layers is All You Need
Florestan Brunck, Christoph Hertrich, Kilian Ruess, Jack Stade, Amir Yehudayoff
cs.CC · cs.CG · cs.LG
We prove that every $\operatorname{ReLU}$ network can be exactly simulated by a $\operatorname{ReLU}$ network with two hidden layers. We present two proofs: one that is based on fillings in homological algebra and a direct combinatorial proof.
This edition is part of The Daily Abstract — cs.CC archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.
Colophon
Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber
#D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.