data-driven machine learning methods such as those based on deep learning are playing a growing role in many areas of science and engineering for modeling time series, including fluid flows, and climate data. however, deep neural networks are known to be sensitive to various adversarial environments, and thus out of the box models and methods are often not suitable for mission critical applications. hence, robustness and trustworthiness are increasingly important aspects in the process of engineering new neural network architectures and models. in this talk, i am going to view neural networks for time series prediction through the lens of dynamical systems. first, i will discuss deep dynamic autoencoders and argue that integrating physics-informed energy terms into the learning process can help to improve the generalization performance as well as robustness with respect to input perturbations. second, i will discuss novel continuous-time recurrent neural networks that are more robust and accurate than other traditional recurrent units. i will show that leveraging classical numerical methods, such as the higher-order explicit midpoint time integrator, improves the predictive accuracy of continuous-time recurrent units as compared to using the simpler one-step forward euler scheme. finally, i will discuss extensions such as multiscale ordinary differential equations for learning long-term sequential dependencies and a connection between recurrent neural networks and stochastic differential equations.

speaker’s bio:

michael w. mahoney is at the university of california at berkeley in the department of statistics and at the international computer science institute (icsi).  he is also an amazon scholar as well as head of the machine learning and analytics group at the lawrence berkeley national laboratory.  he works on algorithmic and statistical aspects of modern large-scale data analysis.  much of his recent research has focused on large-scale machine learning, including randomized matrix algorithms and randomized numerical linear algebra, scalable stochastic optimization, geometric network analysis tools for structure extraction in large informatics graphs, scalable implicit regularization methods, computational methods for neural network analysis, physics informed machine learning, and applications in genetics, astronomy, medical imaging, social network analysis, and internet data analysis.  he received his phd from yale university with a dissertation in computational statistical mechanics, and he has worked and taught at yale university in the mathematics department, at yahoo research, and at stanford university in the mathematics department.  among other things, he was on the national advisory committee of the statistical and applied mathematical sciences institute (samsi), he was on the national research council's committee on the analysis of massive data, he co-organized the simons institute's fall 2013 and 2018 programs on the foundations of data science, he ran the park city mathematics institute's 2016 pcmi summer session on the mathematics of data, he ran the biennial mmds workshops on algorithms for modern massive data sets, and he was the director of the nsf/tripods-funded foda (foundations of data analysis) institute at uc berkeley.  more information is available at https://www.stat.berkeley.edu/~mmahoney/.