Données et systèmes dynamiques
Org:
Tanya Schmah (University of Ottawa) et
Cristina Stoica (Wilfrid Laurier)
[
PDF]
 JAHRUL ALAM, Memorial University of Newfoundland
Dictionarybased operator learning for nonlinear partial differential equations [PDF]

The study of turbulent flows is computationally intensive due to the intrinsic multiscale behavior of their nonlinear dynamics. Thus, it requires relatively highresolution grids to capture their complexity fully. For instance, imagine the range of length and time scales in the numerical study of a hurricane passing over a city. The field of fluid mechanics traditionally deals with massive amounts of data. However, methods to precisely quantify complex and multiscale phenomena of fluid flows remain unresolved to a large extent. More specifically, turbulent fluid data require algorithms capable of addressing nonlinearities and multiscale phenomena that may not be available in classical machine learning methods. This talk presents a dictionary based operator learning method as a reducedorder datadriven model of the chaotic behavior of turbulent flows. First, I will outline the convergence criteria for extracting the governing operator from noisy measurements underlying a nonlinear dynamical system. I will then show numerical results comparing dictionarybased and neural networkbased methods. Finally, I will discuss the dictionarybased reducedorder representation of the NaiverStokes operator. The current findings indicate the potential extension of wavelet methods in dictionarybased operator learning for chaotic systems.
 ALEX BIHLO, Memorial University of Newfoundland
A multimodel physicsinformed neural network approach for solving the shallowwater equations on the sphere [PDF]

We propose the use of physicsinformed neural networks for solving the shallowwater equations on the sphere in the meteorological context. Physicsinformed neural networks are trained to satisfy the differential equations along with the prescribed initial and boundary data, and thus can be seen as an alternative approach to solving differential equations compared to traditional numerical approaches such as finite difference, finite volume or spectral methods. We discuss the training difficulties of physicsinformed neural networks for the shallowwater equations on the sphere and propose a simple multimodel approach to tackle test cases of comparatively long time intervals. Here we train a sequence of neural networks instead of a single neural network for the entire integration interval. We also avoid the use of a boundary value loss by encoding the boundary conditions in a custom neural network layer. We illustrate the abilities of the method by solving the most prominent test cases proposed by Williamson et al. [J. Comput. Phys. 102 (1992), 211224]. This is joint work with Roman O. Popovych.
 MONICA COJOCARU, University of Guelph
Reclustering populations based on mobility driven wellmixing using reinforcement learning  disease spread insights [PDF]

In this talk we present an algorithm designed to recast a population (here that of the US) through the lens of county population's mobility patterns. The result is a reclustering of the US population in regions that are not geographically distinct, but instead have low interregion travelling. Such subpopulations are now wellmixed from the perspective of a ODE model of SEIRtype, hence indepth analyses of infection spread are much better supported. We highlight differences and similarities in the epidemic evolution of Covid19 in 2020 in the US, following the population reclustering, and the interplay between population sociodemographic factors, NPI compliance (i.e., masks) and sizes of the initial local reproduction numbers, R0, and time delays between local peaks and sizes of reported incidence throughout 2020. Further, we look at ways to use the current Covid19 based modelling to derive insights on the impact of different pathogen scenarios such as flu.
 MARICELA BEST MCKAY, University of British Columbia
Approximation rates and training dynamics for Physicsinformed Neural Networks [PDF]

Physicsinformed Neural Networks (PINNs) are an alternative to traditional numerical methods for approximating solutions to systems of Partial Differential Equations. They are especially promising for applications where it is desirable to include realworld data into a numerical model. However, PINNs can be particularly challenging to train. PINNs may fail to train altogether for multiscale problems, or problems containing multiple frequencies. The gradient flow for PINN loss functions often exhibits characteristics of stiffness and instability. Even when PINNs are able to train, they are unable to achieve the highorder accuracy of traditional methods. Recently, theoretical guarantees for the approximation rates of continuous functions by ReLU networks have been proposed. These rates rely on the existence of an optimal network, which may or may not be findable during training. While ReLU is not a suitable choice for most PINNs, we demonstrate that ReLU like activation functions can improve PINN training dynamics. We illustrate how challenges in PINN training dynamics impact numerical error rates and explore the gaps between theory and practice for the PINN setting.
 FLORIAN PUCHHAMMER, University of Waterloo
Simulating Chemical Reaction Networks with Randomized QuasiMonte Carlo [PDF]

The $\tau$leap algorithm by Gillespie is used to simulate chemical reaction networks as a discrete time Markov chain, as an alternative to solving the typically highdimensional chemical master equation. The objective is to estimate the expectation of a function of the molecule numbers at a given future time. We combine this approach with a powerful randomized quasiMonte Carlo (RQMC) technique, ArrayRQMC, which has been proven to outperform Monte Carlo and conventional RQMC in many applications. For chemical reaction networks, this combination can reduce the variance by factors in the thousands, compared to Monte Carlo. Even more than it was observed for ordinary RQMC by Beentjes and Baker (2018).
ArrayRQMC efficiently simulates an array of realizations of the Markov chain in parallel, but requires to sort the chains at each step by their (multidimensional) states. In our simulations, ArrayRQMC always performed better than ordinary MC, regardless of the sort. Yet, the choice of the sorting function can have a significant impact on both variance reduction and simulation speed. We demonstrate how different sorting algorithms can increase the efficiency of the method and discuss how they can be customized for specific applications and for different performance measures.
 GIANG TRAN, University of Waterloo
Epidemiological Predictive Modelling using Delayed Time Embedding [PDF]

In this talk, we will present a new method to predict the infectious using sparse random feature models. The model is motivated by Taken's delay embedding theorem and the theoretical guarantee of sparse random features. The proposed model outperforms the benchmark on various real datasets, including COVID19, Ebola, and Flu datasets.
© Société mathématique du Canada