Large-time asymptotics in Deep Learning by Borjan Geshkovski

Large-time asymptotics in Deep Learning by Borjan Geshkovski

Last Friday October 23rd our team member Borjan Geshkovski PhD student at DyCon ERC Project from UAM, gave a talk at “Seminario de estadística” organized by the UAM – Universidad Autónoma de Madrid about Large-time asymptotics in Deep Learning

Abstract. It is by now well-known that practical deep supervised learning may roughly be cast as an optimal control problem for a specific discrete-time, nonlinear dynamical system called an artificial neural network. In this talk, we consider the continuous-time formulation of the deep supervised learning problem. We will present, using an analytical approach, this problem’s behavior when the final time horizon increases, a fact that can be interpreted as increasing the number of layers in the neural network setting. We show qualitative and quantitative estimates of the convergence to the zero training error regime depending on the functional to be minimised.

Take a look the slides from this seminar:

Slides (PDF)

Like this?

You might be interested in the “Math & Research” post by Borjan:

The interplay of control and Deep Learning


Check this event at CCM calendar