mlsanityData to 14 Oct 2026

Local and global topological complexity measures OF ReLU neural network functions

arXiv 2204.06062 ↗First posted 12 Apr 2022math.AT cs.CG cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

We apply a generalized piecewise-linear (PL) version of Morse theory due to Grunert-Kuhnel-Rote to define and study new local and global notions of topological complexity for fully-connected feedforward ReLU neural network functions, F: R^n -> R. Along the way, we show how to construct, for each such F, a canonical polytopal complex K(F) and a deformation retract of the domain onto K(F), yielding a convenient compact model for performing calculations. We also give a construction showing that local complexity can be arbitrarily high.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 4 of its 19 references that are in the map. First posted on arXiv 12 Apr 2022.

Builds on

4 of 19 references.

References · 4

  1. 2016Understanding Deep Neural Networks with Rectified Linear Unitscited by 257
  2. 2019Deep ReLU Networks Have Surprisingly Few Activation Patternscited by 161
  3. 2018On Characterizing the Capacity of Neural Networks using Algebraic Topologycited by 38
  4. 2020On transversality of bent hyperplane arrangements and the topological expressiveness of ReLU neural networkscited by 35

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 1; 2023: 4; 2024: 2; 2025: 0; 2026: 1.

8 papers.