When constructing high-order schemes for solving hyperbolic conservation laws with multi-dimensional finite volume schemes, the corresponding high-order reconstructions are commonly performed in characteristic spaces to eliminate spurious oscillations as much as possible. For multi-dimensional finite volume schemes, we need to perform the characteristic decomposition several times in different normal directions of the target cell, which is very time-consuming. We propose a rotated characteristic decomposition technique that requires only one-time decomposition for multi-dimensional reconstructions. This technique not only reduces the computational cost remarkably, but also controls spurious oscillations effectively. We take a third-order weighted essentially non-oscillatory finite volume scheme for solving the Euler equations as an example to demonstrate the efficiency of the proposed technique. We apply the new methodology to the simulation of instabilities in direct initiation of gaseous detonations in free space.

Discussing the concept of correlation and how to interpret it alone (marginally) or within a more complex environment (conditionally). This rather simple observation is the key observation behind a lot of exciting developments and connections in statistics that can be leveraged for improved computations and better motivated statistical models.

In many problems in statistical signal processing, regularization is employed to deal with uncertainty, ill-posedness, and insufficiency of training data. It is possible to tune these regularizers optimally asymptotically, i.e. when the dimension of the problem becomes very large, by using tools from random matrix theory and Gauss Process Theory. In this talk, we demonstrate the optimal turning of regularization for three problems : i) Regularized least squares for solving ill-posed and/or uncertain linear systems, 2) Regularized least squares for signal detection in multiple antenna communication systems and 3) Regularized linear and quadratic discriminant binary classifiers.

No summary is available.

Transcription factors are an important family of proteins that control the transcription rate from DNAs to messenger RNAs through the binding to specific DNA sequences. Transcription factor regulation is thus fundamental to understanding not only the system-level behaviors of gene regulatory networks, but also the molecular mechanisms underpinning endogenous gene regulation. In this talk, I will introduce our efforts on developing novel optimization and deep learning methods to quantitatively understanding transcription factor regulation at network- and molecular-levels. Specifically, I will talk about how we estimate the kinetic parameters from sparse time-series readout of gene circuit models, and how we model the relationship between the transcription factor binding sites and their binding affinities.

An important stream of research in computational design aims at digital tools which support users in realizing their design intent in a simple and intuitive way, while simultaneously taking care of key aspects of function and fabrication. Such tools are expected to shorten the product development cycle through a reduction of costly feedback loops between design, engineering and fabrication. The strong coupling between shape generation, function and fabrication is a rich source for the development of new geometric concepts, with an impact to the original applications as well as to geometric theory. This will be illustrated at hand of applications in architecture and fabrication with a mathematical focus on discrete differential geometry and geometric optimization problems.

The thesis focuses on the computation of high-dimensional multivariate normal (MVN) and multivariate Student-t (MVT) probabilities. Firstly, a generalization of the conditioning method for MVN probabilities is proposed and combined with the hierarchical matrix representation. Next, I revisit the Quasi-Monte Carlo (QMC) method and improve the state-of-the-art QMC method for MVN probabilities with block reordering, resulting in a ten-time-speed improvement. The thesis proceeds to discuss a novel matrix compression scheme using Kronecker products. This novel matrix compression method has a memory footprint smaller than the hierarchical matrices by more than one order of magnitude. A Cholesky factorization algorithm is correspondingly designed and shown to accomplish the factorization in 1 million dimensions within 600 seconds. To make the computational methods for MVN probabilities more accessible, I introduce an R package that implements the methods developed in this thesis and show that the package is currently the most scalable package for computing MVN probabilities in R. Finally, as an application, I derive the posterior properties of the probit Gaussian random field and show that the R package I introduce makes the model selection and posterior prediction feasible in high dimensions.

This talk presents a new classification method for functional data. We consider the case where different groups of functions have similar means so that it is difficult to classify them based on only the mean function. To overcome this limitation, we propose the second moment based functional classifier (SMFC). Here, we demonstrate that the new method is sensitive to divergence in the second moment structure and thus produces lower rate of misclassification compared to other competitor methods. Our method uses the Hilbert-Schmidt norm to measure the divergence of second moment structure. One important innovation of our classification procedure lies in the dimension reduction step. The method data-adaptively discovers the basis functions that best capture the discrepancy between the second moment structures of the groups, rather than uses the functional principal component of each individual group, and good performance can be achieved as unnecessary variability is removed so that the classification accuracy is improved. Consistency properties of the classification procedure and the relevant estimators are established. Simulation study and real data analysis on phoneme and rat brain activity trajectories empirically validate the superiority of the proposed method.

Functional data analysis is a very active research area due to the overwhelming existence of functional data. In the first part of this talk, I will introduce how functional data depth is used to carry out exploratory data analysis and explain recently-developed depth techniques. In the second part, I will discuss spatio-temporal statistical modeling. It is challenging to build realistic space-time models and assess the validity of the model, especially when datasets are large. I will present a set of visualization tools we developed using functional data analysis techniques for visualizing covariance structures of univariate and multivariate spatio-temporal processes. I will illustrate the performance of the proposed methods in the exploratory data analysis of spatio-temporal data.

In the lecture we present a three dimensional mdoel for the simulation of signal processing in neurons. To handle problems of this complexity, new mathematical methods and software tools are required. In recent years, new approaches such as parallel adaptive multigrid methods and corresponding software tools have been developed allowing to treat problems of huge complexity. Part of this approach is a method to reconstruct the geometric structure of neurons from data measured by 2-photon microscopy. Being able to reconstruct neural geometries and network connectivities from measured data is the basis of understanding coding of motoric perceptions and long term plasticity which is one of the main topics of neuroscience. Other issues are compartment models and upscaling.

In this talk I will discuss statistical models which incorporate temperature response to the radiative forcing components. The models can be used to estimate important climate sensitivity measures and give temperature forecasts. Bayesian inference is obtained using the methodology of integrated nested Laplace approximation and Monte Carlo simulations. The resulting approach will be demonstrated in analyzing instrumental data and Earth system model ensembles.

​Author of more than 290 journal and conference publications, Professor Stenchikov's research interests are in multi-scale modeling of environmental processes and numerical methods; global climate change, climate downscaling, atmospheric convection; assessment of anthropogenic impacts and geoengineering; air-sea interaction, evaluating environmental consequences of catastrophic events like volcanic eruptions, nuclear explosions, forest and urban fires; and air pollution, transport of aerosols, chemically and optically active atmospheric tracers, their radiative forcing and effect on climate.

In this talk, I will give an overview of my research which focuses on the development of innovative statistical methods and interactive visualization applications for geospatial data analysis and health surveillance. I will illustrate some of my projects in the following areas: 1. Development of new statistical methodology; 2. Development of open-source statistical software such as the R packages; 3. Health surveillance projects. Finally, I will describe my future research on innovation in data acquisition and visualization, precision disease mapping, and digital health surveillance, and how it can inform policymaking and improve population health globally.

Abstract

The analysis of solar irradiance ha

Abstract

There are several Bayesian models where the posterior density

In this talk, I will describe two recent results on detecting and understanding backdoor attacks on deep learning systems. I will first present Neural Cleanse (IEEE S&P 2019), the first robust tool to detect a wide range of backdoors in deep learning models. We use the idea of perturbation distances between classification labels to detect when a backdoor trigger has created shortcuts to misclassification to a particular label.  Second, I will also summarize our new work on Latent Backdoors (CCS 2019), a stronger type of backdoor attack that is more difficult to detect and survives retraining in commonly used transfer learning systems. Latent backdoors are robust and stealthy, even against the latest detection tools (including neural cleanse).

I will present an overview of our activities around estimation problems for partial and fractional differential equations. I will present the methods and the algorithms we develop for the state, source and parameters estimation and illustrate the results with some simulations and real applications.

2019 Statistics and Data Science Workshop confirmed speakers include Prof. Alexander Aue, University of California Davis, USA, Prof. Francois Bachoc, University Toulouse 3, France, Prof. Rosa M. Crujeiras Casais, University of Santiago de Compostela, Spain, Prof. Emanuele Giorgi, Lancaster University, UK, Prof. Jeremy Heng, ESSEC Asia-Pacific, Singapore, Prof. Birgir Hrafnkelsson, University of Iceland, Iceland, Prof. Ajay Jasra, KAUST, Saudi Arabia, Prof. Emtiyaz Khan, RIKEN Center for Advanced Intelligence Project, Japan, Prof. Robert Krafty, University of Pittsburgh, USA, Prof. Guido Kuersteiner, University of Maryland, USA, Prof. Paula Moraga, University of Bath, UK, Prof. Tadeusz Patzek, KAUST, Saudi Arabia, Prof. Brian Reich, North Carolina State University, USA, Prof. Dag Tjostheim, University Bergen, Norway, Prof. Xiangliang Zhang, KAUST, Saudi Arabia, Sylvia Rose Esterby, University of British Colombia, Canada, Prof. Abdel El-Shaarawi, Retired Professor at the National Water Research Institute, Canada. View Workshop schedule and abstracts here.

The talk will give an overview of some recent developments of statistical models based on stochastic partial differential equations. We will in particular focus on equations with non-local differential operators or non-Gaussian driving noise, and explain when any why such models are useful. As motivating applications, analysis of longitudinal medical data and ocean waves will be considered.

We consider the problem of recovering a low-rank signal matrix in the presence of a general, unknown additive noise; more specifically, noise where the eigenvalues of the sample covariance matrix have a general bulk distribution. We assume given an upper bound for the rank of the assumed orthogonally invariant signal, and develop a selector for hard thresholding of singular values, which adapts to the unknown correlation structure of the noise.

A variety of intriguing patterns in eigenvalues were observed and speculated about in ML conference papers. We describe the work of Vardan Papyan showing that the traditional subdisciplines, properly deployed, can offer insights about these objects that ML researchers had.

Tareq Al-Naffouri is a professor of Electrical Engineering (EE) and Principale investigator of the Information System Lab (ISL). He is also an active member of the Sensor Initiative (SI) at the King Abdullah University of Sciences and Technology, Saudi Arabia.

Abstract

In this talk, we discuss a mean-fie

Roy Maxion will give three lectures focusing broadly on different aspects of an increasingly important topic: reproducibility. Reproducibility tests the reliability of an experimental result and is one of the foundations of the entire scientific enterprise.

We often hear that certain foods are good for you, and a few years later we learn that they're not. A series of results in cancer research was examined to see if they were reproducible. A startling number of them - 47 out of 53 - were not. Matters of reproducibility are now cropping up in computer science, and given the importance of computing in the world, it's essential that our own results are reproducible -- perhaps especially the ones based on complex models or data sets, and artificial intelligence or machine learning. This lecture series will expose attendees to several issues in ensuring reproducibility, with the goal of teaching students (and others) some of the crucial aspects of making their own science reproducible. Hint: it goes much farther than merely making your data available to the public.

Roy Maxion will give three lectures focusing broadly on different aspects of an increasingly important topic: reproducibility. Reproducibility tests the reliability of an experimental result and is one of the foundations of the entire scientific enterprise.

We often hear that certain foods are good for you, and a few years later we learn that they're not. A series of results in cancer research was examined to see if they were reproducible. A startling number of them - 47 out of 53 - were not. Matters of reproducibility are now cropping up in computer science, and given the importance of computing in the world, it's essential that our own results are reproducible -- perhaps especially the ones based on complex models or data sets, and artificial intelligence or machine learning. This lecture series will expose attendees to several issues in ensuring reproducibility, with the goal of teaching students (and others) some of the crucial aspects of making their own science reproducible. Hint: it goes much farther than merely making your data available to the public.