Deep Learning as a Convex Paradigm of Computation: Minimizing Circuit Size with ResNets
Arthur Jacot
New York University’s Courant Institute of Mathematical Sciences
The general intelligence properties of deep neural networks (DNNs) could stem from their ability to implement a computational Occam’s razor: searching over data-fitting programs to select the simplest one. However, minimizing algorithmic complexity is notoriously difficult; how could a local search algorithm such as gradient descent recover the optimal program? For example,