# CMI Seminar: Gitta Kutyniok

Tuesday March 5, 2019 4:00 PM

Approximation Theory meets Deep Learning

Speaker: Gitta Kutyniok, TU Berlin
Location: Gates-Thomas 135

PLEASE NOTE THE NEW LOCATION: Hall Auditorium, 135 Gates Thomas

Despite the outstanding success of deep neural networks in real-world applications, most of the related research is empirically driven and a mathematical foundation is almost completely missing. One central task of a neural network is to approximate a function, which for instance encodes a classification task. In this talk, we will be concerned with the question, how well a function can be approximated by a neural network with sparse connectivity. Using methods from approximation theory and applied harmonic analysis, we will derive a fundamental lower bound on the sparsity of a neural network. By explicitly constructing neural networks based on certain representation systems, so-called $\alpha$-shearlets, we will then demonstrate that this lower bound can in fact be attained. Finally, we present numerical experiments, which surprisingly show that already the standard backpropagation algorithm generates deep neural networks obeying those optimal approximation rates.

March 12, 2019

Series Center for the Mathematics of Information (CMI) Seminar Series