The ReLU Transition Graph paper restates known region-count bounds and adjacency facts, but its new claims about VC dimension and compression are unsupported by invalid proofs and circular experiments.
Neural networks as universal finite-state machines: A constructive deterministic finite automaton theory, 2025
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
The Geometry of ReLU Networks through the ReLU Transition Graph
The ReLU Transition Graph paper restates known region-count bounds and adjacency facts, but its new claims about VC dimension and compression are unsupported by invalid proofs and circular experiments.