A study introduces a schematic for translating between a given piecewise linear Morse function on a canonical polyhedral complex and a compatible discrete Morse function for ReLU neural networks.
The study expands computational tools for analyzing the topological properties of ReLU neural networks using discrete Morse theory.
An algorithm is introduced to determine if a given vertex in a canonical polyhedral complex corresponds to a piecewise linear Morse critical point.
New realizability results are provided for shallow ReLU neural networks with respect to sublevel set topology.