Using activation histograms to bound the number of affine regions in ReLU feed-forward neural networks
Not on the map. Why?
Abstract (arXiv)
Several current bounds on the maximal number of affine regions of a ReLU feed-forward neural network are special cases of the framework [1] which relies on layer-wise activation histogram bounds. We analyze and partially solve a problem in algebraic topology the solution of which would fully exploit this framework. Our partial solution already induces slightly tighter bounds and suggests insight in how parameter initialization methods can affect the number of regions. Furthermore, we extend the framework to allow the composition of subnetwork instead of layer-wise activation histogram bounds to reduce the number of required compositions which negatively affect the tightness of the resulting bound.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 11 of its 17 references that are in the map. First posted on arXiv 31 Mar 2021.
Builds on
11 of 17 references.
References · 11
- 2014On the Number of Linear Regions of Deep Neural Networkscited by 378
- 2019Complexity of Linear Regions in Deep Networkscited by 166
- 2017Bounding and Counting Linear Regions of Deep Neural Networkscited by 161
- 2019Deep ReLU Networks Have Surprisingly Few Activation Patternscited by 160
- 2018How to Start Training: The Effect of Initialization and Architecturecited by 109
- 2019On the Impact of the Activation Function on Deep Neural Networks Trainingcited by 101
- 2017On weight initialization in deep neural networkscited by 67
- 2020On the Number of Linear Regions of Convolutional Neural Networkscited by 49
- 2020Empirical Studies on the Properties of Linear Regions in Deep Neural Networkscited by 36
- 2018A Framework for the construction of upper bounds on the number of affine linear regions of ReLU feed-forward neural networkscited by 15
- 2020A General Computational Framework to Measure the Expressiveness of Complex Networks Using a Tighter Upper Bound of Linear Regionscited by 3
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 3; 2024: 1; 2025: 0; 2026: 1.
7 papers.
- 2023When Deep Learning Meets Polyhedral Theory: A Surveycited by 39
- 2021On the Expected Complexity of Maxout Networkscited by 15
- 2022Lower and Upper Bounds for Numbers of Linear Regions of Graph Convolutional Networkscited by 9
- 2024On the Local Complexity of Linear Regions in Deep ReLU Networkscited by 9
- 2023The Evolution of the Interplay Between Input Distributions and Linear Regions in Networkscited by 3
- 2026Training-Time Batch Normalization Reshapes Local Partition Geometry in Piecewise-Affine Networkscited by 1
- 2023The Power of Typed Affine Decision Structures: A Case Studycited by 0
- 2026Training-Time Batch Normalization Reshapes Local Partition Geometry in Piecewise-Affine Networks6 May 2026
- 2024On the Local Complexity of Linear Regions in Deep ReLU Networks24 Dec 2024
- 2023The Evolution of the Interplay Between Input Distributions and Linear Regions in Networks28 Oct 2023
- 2023When Deep Learning Meets Polyhedral Theory: A Survey29 Apr 2023
- 2023The Power of Typed Affine Decision Structures: A Case Study28 Apr 2023
- 2022Lower and Upper Bounds for Numbers of Linear Regions of Graph Convolutional Networks1 Jun 2022
- 2021On the Expected Complexity of Maxout Networks1 Jul 2021