On the Expressiveness of Rational ReLU Neural Networks With Bounded Depth
Gennadiy Averkov, Christopher Hojny, Maximilian Merkert
Abstract
To confirm that the expressive power of ReLU neural networks grows with their depth, the function has been considered in the literature. A conjecture by Hertrich, Basu, Di Summa, and Skutella [NeurIPS 2021] states that any ReLU network that exactly represents has at least hidden layers. The conjecture has recently been confirmed for networks with integer weights by Haase, Hertrich, and Loho [ICLR 2023]. We follow up on this line of research and show that, within ReLU networks whose weights are decimal fractions, can only be represented by networks with at least hidden layers. Moreover, if all weights are -ary fractions, then can only be represented by networks with at least layers. These results are a partial confirmation of the above conjecture for rational ReLU networks, and provide the first non-constant lower bound on the depth of practically relevant ReLU networks.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 59afa650-72b9-4a39-b599-d3a4e89e4c7dCited by top-tier papers2
- Better Neural Network Expressivity: Subdividing the SimplexEgor Bakaev, Florestan Brunck, Christoph Hertrich, Jack Stade et al.STOC 2026 · 16 citations
- Depth-Bounds for Neural Networks via the Braid ArrangementMoritz Grillo, Christoph Hertrich, Georg LohoNeurIPS 2025 · 15 citations
Builds on8
- Up or Down? Adaptive Rounding for Post-Training QuantizationMarkus Nagel, Rana Ali Amjad, Mart van Baalen, Christos Louizos et al.ICML 2020 · 816 citations
- Towards Lower Bounds on the Depth of ReLU Neural NetworksChristoph Hertrich, Amitabh Basu, Marco Di Summa, Martin SkutellaNeurIPS 2021 · 70 citations
- Training Fully Connected Neural Networks is ∃R-CompleteDaniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow et al.NeurIPS 2023 · 39 citations
- Training Neural Networks is NP-Hard in Fixed DimensionVincent Froese, Christoph HertrichNeurIPS 2023 · 36 citations
- Neural Networks with Small Weights and Depth-Separation BarriersGal Vardi, Ohad ShamirNeurIPS 2020 · 23 citations
Related papers
- Lower Bounds on the Depth of Integral ReLU Neural Networks via Lattice PolytopesChristian Haase, Christoph Hertrich, Georg LohoICLR 2023 · 3 citations
- How Many Neurons Does it Take to Approximate the Maximum?Itay Safran, Daniel Reichman, Paul ValiantSODA 2024 · 3 citations
- On Minimum Depth and Width of Floating-Point Neural Networks for Representing Floating-Point FunctionsSejun Park, Yeachan Park, Geonho HwangICML 2026
- On Enhancing Expressive Power via Compositions of Single Fixed-Size ReLU NetworkShijun Zhang, Jianfeng Lu, Hongkai ZhaoICML 2023 · 9 citations
- On the Number of Linear Regions of Convolutional Neural NetworksHuan Xiong, Lei Huang, Mengyang Yu, Li Liu et al.ICML 2020 · 80 citations
