Revisiting Deep Information Propagation: Fractal Frontier and Finite-size Effects
Not on the map. Why?
Abstract (arXiv)
Information propagation characterizes how input correlations evolve across layers in deep neural networks. This framework has been well studied using mean-field theory, which assumes infinitely wide networks. However, these assumptions break down for practical, finite-size networks. In this work, we study information propagation in randomly initialized neural networks with finite width and reveal that the boundary between ordered and chaotic regimes exhibits a fractal structure. This shows the fundamental complexity of neural network dynamics, in a setting that is independent of input data and optimization. To extend this analysis beyond multilayer perceptrons, we leverage recently introduced Fourier-based structured transforms, and show that information propagation in convolutional neural networks also follow the same behavior. In practice, our investigation highlights the importance of finite network depth with respect to the tradeoff between separation and robustness.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 12 of its 22 references that are in the map. First posted on arXiv 5 Aug 2025.
Builds on
12 of 22 references.
References · 12
- 2017Attention Is All You Needcited by 60,361
- 2016Exponential expressivity in deep neural networks through transient chaoscited by 261
- 2016Deep Information Propagationcited by 195
- 2016Orthogonal Random Featurescited by 91
- 2019Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizationscited by 76
- 2023Dynamics of Finite Width Kernel and Prediction Fluctuations in Mean Field Neural Networkscited by 43
- 2015ACDC: A Structured Efficient Linear Layercited by 19
- 2020Reservoir Computing meets Recurrent Kernels and Structured Transformscited by 16
- 2024The boundary of neural network trainability is fractalcited by 13
- 2022Asymptotic Stability in Reservoir Computingcited by 5
- 2024Comparison of Reservoir Computing topologies using the Recurrent Kernel approachcited by 3
- 2025Mapping the Edge of Chaos: Fractal-Like Boundaries in The Trainability of Decoder-Only Transformer Modelscited by 1
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.