Skip to content

Low-dimensional topology of deep neural networks

Jun 2026 · arXiv.org · Vol abs/2606.31856 · 0 citations · 51 references
Computer Science Mathematics

TL;DR

The results suggest that low-dimensional topology can be a useful tool to guide designs of AI architectures, and generalize the results from $d = 3$ to arbitrary $d>3$.

Abstract

We study layered models, including feedforward networks, ResNets, and transformers, by limiting each layer to a width of $d = 3$, i.e., $\mathbb{R}^3$ as representation space. This allows us to track how a neural network changes low-dimensional topological invariants through its layers. Just about any topological structure may be simplified or even trivialized by simply increasing dimension; e.g., any knot is equivalent to an unknot in $\mathbb{R}^4$. By restricting to $\mathbb{R}^3$, we not only isolate the effects of activation and depth from that of width, we work in a space that lends itself to easy visualization. We focus on linking number here, deferring other invariants like link groups, Milnor's $\bar{\mu}$-invariants, knot types, ambient cobordisms, to a sequel. We provide full proofs and empirical experiments to justify the following insights: When measured by their power to effect changes in linking numbers, the layer-skipping feature in ResNets is as powerful as the attention mechanism in transformers; both ResNets and transformers are strictly more powerful than feedforward neural networks with monotonic activations, which are in turn more powerful than invertible and flow-based models; but replacing monotonic activation with a nonmonotonic one elevates a feedforward network into the same expressivity class as ResNets and transformers. These results suggest that low-dimensional topology can be a useful tool to guide designs of AI architectures. We also generalize our results from $d = 3$ to arbitrary $d>3$.

View source

Similar papers

Jul 2026

Shallower ReLU Network Representations via Exact Linear Algebra

It is proved that $\max_n(x)$ is exactly representable with two hidden layers for every $n\leq 12$, and these results improve upon [Bakaev, Brunck, Hertrich, Stade, Yehudayoff, STOC'26], who proved analogous logarithmic bounds with base three.

Kilian Ruess, G. Averkov, Florestan Brunck et al. · 2 citations · ⚡1
Jul 2026

Approximation of Analytic Functions by ReLU Neural Networks with Adjustable Depth and Width

The findings reveal that depth plays a more critical role than width in the context of analytic function approximation, and establishes upper bounds for the approximation of analytic functions, which possess infinite smoothness, via ReLU networks under the $(N,L)-characterization.

Yanming Lai, De-Feng Sun, Yang Wang · 0 citations
Preprint Aug 2026

Representing MAX functions using two-hidden-layer ReLU networks

The techniques share most of the high-level ideas presented in [Ruess et al., 2026], but there are also some minor differences which may be of interest for future research on this problem.

Zhi-Mao Wang, A. Basu · 1 citation · ⚡1
Preprint Aug 2026

$L^p$ approximation results for infinite dimensional Neural Networks

A global universal approximation theorem in the topology of L^p(\mu) is shown, where any function $f:\mathfrak X\to \mathbb R$ in $L^p(\mu)$ can be approximated to any degree of accuracy by suitable infinite dimensional architectures.

Luca Galimberti · 0 citations
#graph neural networks Preprint Aug 2026

Learning Topological Features of $\widehat Z$-invariants

This paper initiates a systematic approach to handling mathematical data structured as (truncated) infinite $q-series, or equivalently, infinite series of integers, and demonstrates that neural networks can reliably extract essential topological information, such as homology class and underlying graph structure, direct...

Brandon Robinson, Shimal Harichurn, Fabian Ruehle et al. · 0 citations
Preprint Jul 2026

Weight Feedback Computes the Jacobian Transpose Locally in Modern Deep Networks

Predictive Coding (PC) offers a biologically motivated alternative to backpropagation via local weight updates, yet routing error between layers still relies on an autograd Jacobian-transpose ($J^\top$) product - the last non-local operation in PC. We show that this dependency is largely avoidable. For any layer $f(x)=...

Junlong Shen, Xingyu Li · 0 citations

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.