Florestan Brunck, Christoph Hertrich, Kilian Ruess, Jack Stade, Amir Yehudayoff · 2026 · arXiv
DOI: 10.48550/arXiv.2610.28587 · open-access PDF
우리는 각 $\operatorname{ReLU}$ 네트워크가 두 개의 숨겨진 레이어를 가진 $\operatorname{ReLU}$ 네트워크에 의해 정확하게 시뮬레이션 될 수 있다는 것을 증명합니다.We present two proofs: one that is based on fillings in homological algebra and a direct combinatorial proof.
Machine translation (Meta M2M100); the English original follows.
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
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.txtSources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange