Papers
Topics
Authors
Recent
Search
2000 character limit reached

Constructive Bounds for the Topological Expressivity of Neural Networks

Published 9 Oct 2026 in math.AT and cs.LG | (2610.13931v1)

Abstract: The expressivity of a neural network ΦΦ describes the class of functions that a network can express. The term topological expressivity refers to a family of measures particularly suited to understand binary classification and is often formulated in terms of the Betti numbers of a decision boundary β(Φ<sup>−1(0))β(Φ<sup>{-1}(0)). Despite its popularity, this measure is not as useful for regression and other problems that do not involve a decision boundary. Instead, we propose to study topological expressivity in terms of the Betti numbers of the output of a neural network β(Φ(X))β(Φ(X)). We formally prove that a ReLU network with architecture (d,∑k=1<sup>d</sup>β<em>k(3k+2),∑</em>k=1<sup>dβk(k+1))(d,\sum\limits_{k=1}<sup>{d</sup> } β<em>k(3k+2),\sum\limits</em>{k=1}<sup>{d}β_k(k+1)) can express spaces homotopy equivalent to wedge sums of spheres with arbitrary Betti numbers. This gives upper bounds for any arbitrary connected (β<em>0=1β<em>0=1) sequence of Betti numbers, but by constructing spaces homotopy equivalent to products of NN spheres of dimension d1,...,dNd_1,...,d_N we achieve much better bounds (∑</em>n=1dn,3∑n=1<sup>N</sup>dn+2N,∑n=1<sup>N</sup>dn+N)(\sum\limits</em>{n=1} d_n, 3\sum\limits_{n=1}\limits<sup>N</sup> d_n + 2N, \sum\limits_{n=1}\limits<sup>N</sup> d_n + N) for Betti numbers given by ∏n(1+x<sup>dn)\prod_n (1+x<sup>{d_n}). Finally we conjecture a much stronger tight bound which gives the architectural bound (d,d+1,d+1)(d,d+1,d+1) for a space homeomorphic to the sphere.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.