Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2306.17418

ReLU Neural Networks, Polyhedral Decompositions, and Persistent Homolog

Yajing Liu·Christina M Cole·Chris Peterson·Michael Kirby
View original source ↗Read source document ↗Export metadata ↓

Abstract

A ReLU neural network leads to a finite polyhedral decomposition of input space and a corresponding finite dual graph. We show that while this dual graph is a coarse quantization of input space, it is sufficiently robust that it can be combined with persistent homology to detect homological signals of manifolds in the input space from samples. This property holds for a variety of networks trained for a wide range of purposes that have nothing to do with this topological application. We found this feature to be surprising and interesting; we hope it will also be useful.

Explore related subjects

math.ATcs.LGmath.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yajing Liu, Christina M Cole, Chris Peterson, Michael Kirby. 2023-06-30. ReLU Neural Networks, Polyhedral Decompositions, and Persistent Homolog. https://arxiv.org/abs/2306.17418

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Galois Connections in Persistent Homology

We present a new language for persistent homology in terms of Galois connections. This language has two main advantages over traditional approaches. First, it simplifies and unifies central concepts such as interleavings and matchings. Second, it provides access to Rota's Galois connection theorem -- a powerful tool with many potential applications in applied topology. To illustrate this, we use Rota's Galois connection theorem to give a substantially easier proof of the bottleneck stability theorem. Finally, we use this language to establish relationships between various notions of multiparameter persistence diagrams.

math.AT↗
arXiv2026

The Dold-Kan theorem for paracyclic modules

We study the Karoubi operator on the unnormalized chain complex of a paracyclic module; its restriction to the normalized chain complex has previously been considered by Dwyer and Kan, and in the cyclic case by Cuntz and Quillen. We obtain a direct proof of the Dold-Kan theorem for paracyclic modules of Dwyer and Kan, by directly relating the Karoubi operator to projection to the normalized subcomplex.

math.AT↗
arXiv2026

The relative join operad and polyhedral products

An inclusion of nonvoid simplicial complexes induces an arrow of polyhedral products. Applying Ayzenberg's polyhedral join to both complexes gives a symmetric relative join operad. Its endpoint suboperads recover Abramyan--Panov substitution and Ayzenberg composition. Neither endpoint operad nor either relative join operad is finitely generated. The suboperad with nonvoid lower complex arises as the nonempty power-set quotient of the subset-inclusion operad. When tensoring preserves colimits of nonempty finite diagrams, the suboperad acts on arrows by polyhedral colimits up to coherent natural isomorphism. The action induces a set-operad algebra on isomorphism classes of arrows. The dual construction produces Stanley--Reisner quotient arrows, and the colimit action refines Eldridge's loop-space decomposition to arrows. PL ball--boundary pairs form a suboperad of the relative join operad, and minimal interior faces give an operad morphism. Principal pairs have odd-dimensional spherical moment-angle homotopy fibers and yield a closure result for Eldridge's loop-space class.

math.AT↗