Boosting Dilated Convolutional Networks with Mixed Tensor Decompositions
Not on the map. Why?
Abstract (arXiv)
The driving force behind deep networks is their ability to compactly represent rich classes of functions. The primary notion for formally reasoning about this phenomenon is expressive efficiency, which refers to a situation where one network must grow unfeasibly large in order to realize (or approximate) functions of another. To date, expressive efficiency analyses focused on the architectural feature of depth, showing that deep networks are representationally superior to shallow ones. In this paper we study the expressive efficiency brought forth by connectivity, motivated by the observation that modern networks interconnect their layers in elaborate ways. We focus on dilated convolutional networks, a family of deep models delivering state of the art performance in sequence processing tasks. By introducing and analyzing the concept of mixed tensor decompositions, we prove that interconnecting dilated convolutional networks can lead to expressive efficiency. In particular, we show that even a single connection between intermediate layers can already lead to an almost quadratic gap, which in large-scale settings typically makes the difference between a model that is practical and one that is not. Empirical evaluation demonstrates how the expressive efficiency of connectivity, similarly to that of depth, translates into gains in accuracy. This leads us to believe that expressive efficiency may serve a key role in the development of new tools for deep network design.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 20 Mar 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 1; 2024: 1.
5 papers.
- 2021Implicit Regularization in Tensor Factorizationcited by 44
- 2022Implicit Regularization in Hierarchical Tensor Factorization and Deep Convolutional Neural Networkscited by 27
- 2022On the Ability of Graph Neural Networks to Model Interactions Between Verticescited by 12
- 2023What Makes Data Suitable for a Locally Connected Neural Network? A Necessary and Sufficient Condition Based on Quantum Entanglementcited by 4
- 2024Lecture Notes on Linear Neural Networks: A Tale of Optimization and Generalization in Deep Learningcited by 1
- 2024Lecture Notes on Linear Neural Networks: A Tale of Optimization and Generalization in Deep Learning25 Aug 2024
- 2023What Makes Data Suitable for a Locally Connected Neural Network? A Necessary and Sufficient Condition Based on Quantum Entanglement20 Mar 2023
- 2022On the Ability of Graph Neural Networks to Model Interactions Between Vertices29 Nov 2022
- 2022Implicit Regularization in Hierarchical Tensor Factorization and Deep Convolutional Neural Networks27 Jan 2022
- 2021Implicit Regularization in Tensor Factorization19 Feb 2021