Depth-Width Trade-offs for Neural Networks via Topological Entropy

Abstract

One of the central problems in the study of deep learning theory is to understand how the structure properties, such as depth, width and the number of nodes, affect the expressivity of deep neural networks. In this work, we show a new connection between the expressivity of deep neural networks and topological entropy from dynamical system, which can be used to characterize depth-width trade-offs of neural networks. We provide an upper bound on the topological entropy of neural networks with continuous semi-algebraic units by the structure parameters. Specifically, the topological entropy of ReLU network with $l$ layers and $m$ nodes per layer is upper bounded by $O(l\log m)$. Besides, if the neural network is a good approximation of some function $f$, then the size of the neural network has an exponential lower bound with respect to the topological entropy of $f$. Moreover, we discuss the relationship between topological entropy, the number of oscillations, periods and Lipschitz constant.

arXiv comment17 pages

References in corpus (8)

• On the Number of Linear Regions of Deep Neural Networks
• Representation Benefits of Deep Feedforward Networks
• Understanding Deep Neural Networks with Rectified Linear Units
• On the Expressive Efficiency of Sum Product Networks
• On the Expressive Power of Deep Polynomial Neural Networks
• Is Deeper Better only when Shallow is Good?
• Depth-Width Trade-offs for ReLU Networks via Sharkovsky's Theorem
• Better Depth-Width Trade-offs for Neural Networks through the lens of Dynamical Systems

Cited by in corpus (2)

• Effects of quantum resources on the statistical complexity of quantum circuits
• Depth separation beyond radial functions