Scientific

Epidemic Model-Based Benchmark for Optimal Control on Networks

Speaker: 
Yaroslav V. Salii
Date: 
Tue, Oct 26, 2021
Location: 
Online
Conference: 
Workshop on Mean Field Games on Networks
Abstract: 

Network dynamical systems add an additional challenge of scale to optimal control schemes. There are many options of overcoming it, such as approximations and heuristics based on mean field games, neural networks, or reinforcement learning, or the actual structure of the networks, each with its own advantages and tradeoffs.

Metapopulation epidemic models, where each population is an entity on a map, such as a city or a district, are a convenient option for benchmarking varying optimal control schemes: these can be designed with varying number of nodes (dimension), have a natural per-node optimal control, e.g. the “lockdown level,” and a straightforward visualization option of choropleth maps.

In this talk, we will describe a procedure for generating plausible instances of such models with from 1 to circa 64,000 nodes based on publicly available census data for the contiguous U.S., each with the network of short-range travel (commute) and long-range travel (airplane), the latter derived from publicly available passenger flight statistics---along with a formal aggregation routine enabling a view of the same geography at different resolutions.

As a showcase, we designed a “baseline” optimal control scheme for three instances covering Oregon and Washington states: a 2-node instance on state level, a 75-node on county level, and a 2,072-node instance made of “atomic” population units, the census tracts, which are put through a metapopulation SIR model with per-node “lockdown level” optimal control on a 180-day time horizon, with the objective of minimizing the cumulative number of infections and the square of this lockdown control; the results are compared with the “no-lockdown” model.
The optimal control was derived through the Pontryagin Maximum Principle and numerically computed by the forward-backward sweep method, which converges within 5 seconds on the 2- and 75-node instances and within 40 seconds on the 2,072-node one.

Class: 
Subject: 

Controlling Human Microbiota

Speaker: 
Yang-Yu Liu
Date: 
Tue, Oct 26, 2021
Location: 
Online
Conference: 
Workshop on Mean Field Games on Networks
Abstract: 

We coexist with a vast number of microbes—our microbiota—that live in and on our bodies, and play an important role in human physiology and diseases. Many scientific advances have been made through the work of large-scale, consortium-driven metagenomic projects. Despite these advances, there are still many fundamental questions regarding the dynamics and control of microbiota to be addressed. Indeed, it is well established that human-associated microbes form a very complex and dynamic ecosystem, which can be altered by drastic diet change, medical interventions, and many other factors. The alterability of our microbiome offers opportunities for practical microbiome-based therapies, e.g., fecal microbiota transplantation and probiotic administration, to restore or maintain our healthy microbiota. Yet, the complex structure and dynamics of the underlying ecosystem render the quantitative study of microbiome-based therapies extremely difficult. In this talk, I will discuss our recent theoretical progress on controlling human microbiota from network science, dynamical systems, and control theory perspectives.

Class: 
Subject: 

Differential Equations and Algebraic Geometry - 1

Speaker: 
Hossein Movasati
Date: 
Wed, Oct 27, 2021
Location: 
PIMS, University of Alberta
Zoom
Conference: 
PIMS Network Courses
Differential Equations and Algebraic Geometry
Abstract: 

This is a guest lecture in the PIMS Network Wide Graduate Course in Differential Equations in Algebraic Geometry.

Class: 

Quantum Operations as Resources

Speaker: 
Thomas Theurer
Date: 
Wed, Oct 27, 2021
Location: 
Online
Conference: 
Emergent Research: The PIMS Postdoctoral Fellow Seminar
Abstract: 

Protocols and devices that exploit quantum mechanical effects can outperform their classical counterparts in certain tasks ranging from communication and computation to sensing. Intuitively speaking, the reason for this is that different physical laws allow for different technological applications. Therefore, the question where quantum mechanics differs from classical physics is not only of foundational or philosophical interest but might have technological implications too. To address it in a systematic manner, so-called quantum resource theories were developed. These are mathematical frameworks that emerge from (physically motivated) restrictions that are put on top of the laws of quantum mechanics and single out specific aspects of quantum theory as resources. A widely studied example would be the restriction to local operations and classical communication, which leads to the resource theory of entanglement. It is then investigated how these restrictions influence our abilities to do certain tasks (e.g., communicate securely), how these restrictions can be overcome, and how the resulting resources can be quantified. Historically, resource theories were mainly focused on the resources present in quantum states. After an introduction to the general topic, I will speak about my recent research on how these concepts can be extended to quantum operations and why this is of interest.

Class: 
Subject: 

Conditional Sampling with Block-Triangular Transport Maps

Speaker: 
Bamdad Hosseini
Date: 
Thu, Oct 21, 2021
Location: 
PIMS, University of Washington
Zoom
Online
Conference: 
Kantorovich Initiative Seminar
Abstract: 

Generative models such as Generative Adversarial Nets (GANs), Variational Autoencoders and Normalizing Flows have been very successful in the unsupervised learning task of generating samples from a high-dimensional probability distribution. However, the task of conditioning a high-dimensional distribution from limited empirical samples has attracted less attention in the literature but it is a central problem in Bayesian inference and supervised learning. In this talk we will discuss some ideas in this direction by viewing generative modelling as a measure transport problem. In particular, we present a simple recipe using block-triangular maps and monotonicity constraints that enables standard models such as the original GAN to perform conditional sampling. We demonstrate the effectiveness of our method on various examples ranging from synthetic test sets to image in-painting and function space inference in porous medium flow.

Class: 
Subject: 

The Connection Between RDEs and PDEs

Speaker: 
Louigi Addario-Berry
Date: 
Thu, Oct 14, 2021
Location: 
PIMS, University of Victoria
Zoom
Online
Conference: 
PIMS-UVic Distinguished Lecture
Abstract: 

Recursive distributional equations (RDEs) are ubiquitous in probability. For example, the standard Gaussian distribution can be characterized as the unique fixed point of the following RDE

$$
X = (X_1 + X_2) / \sqrt{2}
$$

among the class of centered random variables with standard deviation of 1. (The equality in the equation is in distribution; the random variables and must all be identically distributed; and and must be independent.)

Recently, it has been discovered that the dynamics of certain recursive distributional equations can be solved using by using tools from numerical analysis, on the convergence of approximation schemes for PDEs. In particular, the framework for studying stability and convergence for viscosity solutions of nonlinear second order equations, due to Crandall-Lions, Barles-Souganidis, and others, can be used to prove distributional convergence for certain families of RDEs, which can be interpreted as tree- valued stochastic processes. I will survey some of these results, as well as the (current) limitations of the method, and our hope for further interplay between these two research areas.

Class: 

A reproducing kernel Hilbert space framework for functional classification

Speaker: 
Peijun Sang
Date: 
Wed, Sep 22, 2021
Location: 
Online
Abstract: 

The intrinsic infinite-dimensional nature of functional data creates a bottleneck in the application of traditional classifiers to functional settings. These classifiers are generally either unable to generalize to infinite dimensions or have poor performance due to the curse of dimensionality. To address this concern, we propose building a distance-weighted discrimination (DWD) classifier on scores obtained by projecting data onto one specific direction. We choose this direction by minimizing, over a reproducing kernel Hilbert space, an empirical risk function containing the DWD classifier loss function. Our proposed classifier avoids overfitting and enjoys the appealing properties of DWD classifiers. We further extend this framework to accommodate functional data classification problems where scalar covariates are involved. In contrast to previous work, we establish a non-asymptotic estimation error bound on the relative misclassification rate. Through simulation studies and a real-world application, we demonstrate that the proposed classifier performs favourably relative to other commonly used functional classifiers in terms of prediction accuracy in finite-sample settings.

Class: 
Subject: 

Optimal Study Design for Reducing Variances of Coefficient Estimators in Change-Point Models

Speaker: 
Li Xing
Date: 
Wed, Oct 6, 2021
Location: 
Online
Abstract: 

In longitudinal studies, we measure the same variables at multiple time-points to track their change over time. The exact data collection schedules (i.e., time of participants' visits) are often pre-determined to accommodate the ease of project management and compliance. Therefore, it is common to schedule those visits at equally spaced time intervals. However, recent publications based on simulated experiments indicate that the power of studies and the precision of model parameter estimators is related to the participants' visiting scheme. So, in this work, we investigate how to schedule participants' visits to better study the accelerated cognitive decline of senior adults, where a broken-stick model is often applied. We formulate this optimal design problem on scheduling participants' visiting into a high- dimensional optimization problem and derive its approximate solution by adding reasonable constraints. Based on this approximation, we propose a novel design of the visiting scheme that aims to maximize the power (i.e. reduce the variance of estimators) in identifying the onset of accelerated decline. Using both simulation studies and evidence from real data, we demonstrate that our design outperforms the standard equally-spaced one when we have strong prior knowledge on the change-points. This novel design helps researchers plan their longitudinal studies with improved power in detecting pattern change without collecting extra data. Also, this individual-level scheduling system helps monitor seniors' cognitive function and, therefore, benefits the development of personal level treatment for cognitive decline, which agrees with the trend of the health care system.

Class: 
Subject: 

Variational Autoencoders: an introduction to new applications and a new regularization approach

Speaker: 
Cedric Beaulac
Date: 
Wed, Oct 13, 2021
Location: 
Online
Abstract: 

In this presentation, we discuss the Variational AutoEncodeur (VAE): a latent variable model emerging from the machine learning community. To begin, we introduce the theoretical foundations of the model and its relationship with well-established statistical models. Then, we discuss how we used VAEs to solve two widely different problems. First, we tackled a classic statistical problem, survival analysis, and then a classic machine learning problems, image analysis and image generation. We conclude with a short discussion of our latest research project where we establish a new metric for the evaluation or regularization of latent variable models such a Gaussian Mixture Models and VAEs.​

Class: 
Subject: 

Programmable Human Organoids via Genetic Design and Engineering

Speaker: 
Mo Ebrahimkhani
Date: 
Wed, Oct 13, 2021
Location: 
PIMS, University of British Columbia
Zoom
Online
Conference: 
Mathematical Biology Seminar
Abstract: 

Synthetic biology offers bottom-up engineering strategies that intends to understand complex systems via design-build-test cycles. In development, gene regulatory networks emerge into collective cellular behaviors with multicellular forms and functions. Here, I will introduce a synthetic developmental biology approach for tissue engineering. It involves building developmental trajectories in stem cells via programmed gene circuits and network analysis. The outcome of our approach is decoding our own development and to create programmable organoids with both natural or artificial designs and augmented functions.

Class: 

Pages