Local and global topological complexity measures OF ReLU neural network functions

J. Elisenda Grigsby; Kathryn Lindsey; Marissa Masden

REVIEW

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2204.06062 v2 pith:UUTGZFW6 submitted 2022-04-12 math.AT cs.CGcs.LGmath.GT

Local and global topological complexity measures OF ReLU neural network functions

J. Elisenda Grigsby , Kathryn Lindsey , Marissa Masden This is my paper

classification math.AT cs.CGcs.LGmath.GT

keywords complexitylocalfunctionsglobalnetworkneuralrelutopological

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

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.

Local and global topological complexity measures OF ReLU neural network functions

discussion (0)