Algorithmic Determination of the Combinatorial Structure of the Linear Regions of ReLU Neural Networks

Author name not available (Why is that?)

Publication date: 15 July 2022

Abstract: We algorithmically determine the regions and facets of all dimensions of the canonical polyhedral complex, the universal object into which a ReLU network decomposes its input space. We show that the locations of the vertices of the canonical polyhedral complex along with their signs with respect to layer maps determine the full facet structure across all dimensions. We present an algorithm which calculates this full combinatorial structure, making use of our theorems that the dual complex to the canonical polyhedral complex is cubical and it possesses a multiplication compatible with its facet structure. The resulting algorithm is numerically stable, polynomial time in the number of intermediate neurons, and obtains accurate information across all dimensions. This permits us to obtain, for example, the true topology of the decision boundaries of networks with low-dimensional inputs. We run empirics on such networks at initialization, finding that width alone does not increase observed topology, but width in the presence of depth does. Source code for our algorithms is accessible online at https://github.com/mmasden/canonicalpoly.

Has companion code repository: https://github.com/mmasden/canonicalpoly

This page was built for publication: Algorithmic Determination of the Combinatorial Structure of the Linear Regions of ReLU Neural Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6405122)