Low-dimensional topology of deep neural networks
Not on the map. Why?
Abstract (arXiv)
We study layered models, including feedforward networks, ResNets, and transformers, by limiting each layer to a width of d = 3, i.e., ℝ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 ℝ4. By restricting to ℝ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μ-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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 27 of its 51 references that are in the map. First posted on arXiv 30 Jun 2026.
Builds on
27 of 51 references.
References · 27
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2022Flow Matching for Generative Modelingcited by 5,702
- 2018Neural Ordinary Differential Equationscited by 3,779
- 2016Gaussian Error Linear Units (GELUs)cited by 3,502
- 2016Density estimation using Real NVPcited by 2,042
- 2018Glow: Generative Flow with Invertible 1x1 Convolutionscited by 1,545
- 2021E(n) Equivariant Graph Neural Networkscited by 965
- 2017Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learningcited by 950
- 2018FFJORD: Free-form Continuous Dynamics for Scalable Reversible Generative Modelscited by 594
- 2016Error bounds for approximations with deep ReLU networkscited by 574
- 2017SchNet: A continuous-filter convolutional neural network for modeling quantum interactionscited by 571
15 more
- 2025Mean Flows for One-step Generative Modelingcited by 561
- 2019Augmented Neural ODEscited by 397
- 2016Benefits of depth in neural networkscited by 250
- 2017The Reversible Residual Network: Backpropagation Without Storing Activationscited by 217
- 2018i-RevNet: Deep Invertible Networkscited by 137
- 2017Approximating Continuous Functions by ReLU Nets of Minimal Widthcited by 122
- 2020Topology of deep neural networkscited by 112
- 2020Minimum Width for Universal Approximationcited by 94
- 2018Deep, Skinny Neural Networks are not Universal Approximatorscited by 38
- 2022Achieve the Minimum Width of Neural Networks for Universal Approximationcited by 26
- 2023Minimum width for universal approximation using ReLU networks on compact domaincited by 18
- 2023Minimum Width of Leaky-ReLU Neural Networks for Uniform Universal Approximationcited by 13
- 2024E(3)-equivariant models cannot learn chirality: Field-based molecular generationcited by 6
- 2024New advances in universal approximation with neural networks of minimal widthcited by 5
- 2023Topological Obstructions and How to Avoid Themcited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.