Expressive Power of ReLU and Step Networks under Floating-Point Operations
Not on the map. Why?
Abstract (arXiv)
The study of the expressive power of neural networks has investigated the fundamental limits of neural networks. Most existing results assume real-valued inputs and parameters as well as exact operations during the evaluation of neural networks. However, neural networks are typically executed on computers that can only represent a tiny subset of the reals and apply inexact operations, i.e., most existing results do not apply to neural networks used in practice. In this work, we analyze the expressive power of neural networks under a more realistic setup: when we use floating-point numbers and operations as in practice. Our first set of results assumes floating-point operations where the significand of a float is represented by finite bits but its exponent can take any integer value. Under this setup, we show that neural networks using a binary threshold unit or ReLU can memorize any finite input/output pairs and can approximate any continuous function within an arbitrary error. In particular, the number of parameters in our constructions for universal approximation and memorization coincides with that in classical results assuming exact mathematical operations. We also show similar results on memorization and universal approximation when floating-point operations use finite bits for both significand and exponent; these results are applicable to many popular floating-point formats such as those defined in the IEEE 754 standard (e.g., 32-bit single-precision format) and bfloat16.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 9 of its 28 references that are in the map. First posted on arXiv 26 Jan 2024.
Builds on
9 of 28 references.
References · 9
- 2016TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systemscited by 664
- 2017The Expressive Power of Neural Networks: A View from the Widthcited by 320
- 2017Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networkscited by 311
- 2018Optimal approximation of continuous functions by very deep ReLU networkscited by 166
- 2020Minimum Width for Universal Approximationcited by 94
- 2018Small ReLU networks are powerful memorizers: a tight analysis of memorization capacitycited by 78
- 2021On the Optimal Memorization Power of ReLU Neural Networkscited by 40
- 2020Provable Memorization via Deep Neural Networks using Sub-linear Parameterscited by 34
- 2018On the Universal Approximability and Complexity Bounds of Quantized ReLU Neural Networkscited by 12
Built on by
Citing papers per year: 2024: 2; 2025: 0; 2026: 3.
5 papers.
- 2024On Expressive Power of Quantized Neural Networks under Fixed-Point Arithmeticcited by 4
- 2026On the Expressive Power of Floating-Point Transformerscited by 2
- 2026Expressive Power of Floating-Point Neural Networks with Arbitrary Reduction Orders and Inexact Activation Implementationscited by 1
- 2024Tighter Learning Guarantees on Digital Computers via Concentration of Measure on Finite Spacescited by 0
- 2026Floating-Point Networks with Automatic Differentiation Can Represent Almost All Floating-Point Functions and Their Gradientscited by 0
- 2026Expressive Power of Floating-Point Neural Networks with Arbitrary Reduction Orders and Inexact Activation Implementations27 May 2026
- 2026Floating-Point Networks with Automatic Differentiation Can Represent Almost All Floating-Point Functions and Their Gradients3 May 2026
- 2026On the Expressive Power of Floating-Point Transformers23 Jan 2026
- 2024On Expressive Power of Quantized Neural Networks under Fixed-Point Arithmetic30 Aug 2024
- 2024Tighter Learning Guarantees on Digital Computers via Concentration of Measure on Finite Spaces8 Feb 2024