Two $\operatorname{ReLU}$ Layers is All You Need
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. --- Source: arXiv:2610.28587v1 - http://arxiv.org/abs/2610.28587v1 PDF: https://arxiv.org/pdf/2610.28587v1 Original Link: http://arxiv.org/abs/2610.28587v1
Description / Details
We prove that every network can be exactly simulated by a network with two hidden layers. We present two proofs: one that is based on fillings in homological algebra and a direct combinatorial proof.
Source: arXiv:2610.28587v1 - http://arxiv.org/abs/2610.28587v1 PDF: https://arxiv.org/pdf/2610.28587v1 Original Link: http://arxiv.org/abs/2610.28587v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Oct 21, 2026
Data Science
Machine Learning
0