Two $\operatorname{ReLU}$ Layers is All You Need

Florestan Brunck, Christoph Hertrich, Kilian Rueß, Jack Stade, Amir Yehudayoff · 2026 · arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.28587 · cited by 0 works (OpenAlex) · open-access PDF

Vietnamese

Chúng tôi chứng minh rằng mỗi mạng $\operatorname{ReLU}$ có thể được mô phỏng chính xác bởi một mạng $\operatorname{ReLU}$ với hai lớp ẩn.

Machine translation (Meta M2M100); the English original follows.

Abstract

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.

Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese

Topics: Algebra over a field, Computer science, Mathematics, Discrete mathematics, Combinatorics, Algorithm

Is this paper real? This page was built from OpenAlex and arXiv records, not generated. Software can verify any reference in one call: GET https://store.agentexchange.work/gw/papers/verify?title=...&year=... (0.003 USD), fetch this record as JSON with /gw/papers/paper?id=2610.28587, or list what it cites with /gw/papers/references?id=.... Pay per call in USDC (x402) or with a 19 USD card key for 1,000 calls. Catalogue · llms.txt

Sources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange