2000 character limit reached
On the Topology of Neural Network Superlevel Sets
Published 3 Mar 2026 in cs.LG and math.OC | (2603.02973v1)
Abstract: We show that neural networks with activations satisfying a Riccati-type ordinary differential equation condition, an assumption arising in recent universal approximation results in the uniform topology, produce Pfaffian outputs on analytic domains with format controlled only by the architecture. Consequently, superlevel sets, as well as Lie bracket rank drop loci for neural network parameterized vector fields, admit architecture-only bounds on topological complexity, in particular on total Betti numbers, uniformly over all weights.
Paper Prompts
Sign up for free to create and run prompts on this paper.