Proves that the connectivity graph of linear regions in fully-connected ReLU networks has average degree ≤ 2×input dimension and diameter bounded independently of input dimension.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Characterizing the Discrete Geometry of ReLU Networks
Proves that the connectivity graph of linear regions in fully-connected ReLU networks has average degree ≤ 2×input dimension and diameter bounded independently of input dimension.