Abstract: We study the problem of certification: given queries to an n-variable boolean function f with certificate complexity k and an input x, output a size-k certificate for f's value on x. This abstractly models a problem of interest in explainable machine learning, where we think of f as a blackbox model that we seek to explain the predictions of. For monotone functions, classic algorithms of Valiant and Angluin accomplish this task with n queries to f. Our main result is…

Abstract: The development of CRISPR-based assays and small molecule screens holds the promise of engineering precise cell state transitions to move cells from one cell type to another or from a diseased state to a healthy state. The main bottleneck is the huge space of possible perturbations/interventions, where even with the breathtaking technological advances in single-cell biology it will never be possible to experimentally perturb all combinations of thousands of genes or compounds. This important biological problem calls for a…

Abstract:  Many new random matrix ensembles arise in learning and modern signal processing. As shown in recent studies, the spectral properties of these matrices help answer crucial questions regarding the training and generalization performance of neural networks, and the fundamental limits of high-dimensional signal recovery. As a result, there has been growing interest in precisely understanding the spectra and other asymptotic properties of these matrices. Unlike their classical counterparts, these new random matrices are often highly structured and are the…

Abstract: Under the current Swiss law, taxpayers can deduct charitable donations from their individual’s taxable income subject to a 20%-ceiling. This deductible ceiling was increased at the communal and cantonal level from a previous 5%-ceiling in 2009. The goal of the reform was boosting charitable giving to non-profit entities. However, the effects of this reform, and more generally of the existing Swiss system of tax deductions for charitable giving has never been empirically studied. The aim of this work is…

Abstract: This talk will cover recent work in our group developing and applying algorithms to simulate rare events in atmospheric science and other areas. I will review a rare event simulation scheme that biases model simulations toward the rare event of interest by preferentially duplicating simulations making progress toward the event and removing others. I will describe applications of this approach to rapid intensification of tropical cyclones and instability of Mercury's orbit with an emphasis on the elements of algorithm…

Abstract: Many existing literature on bandits and reinforcement learning assume a linear reward/value function, but what happens if the reward is non-linear? Two curious phenomena arise for non-linear bandits: first, in addition to the "learning phase" with a standard \Theta(\sqrt(T)) regret, there is an "initialization phase" with a fixed cost determined by the reward function; second, achieving the smallest cost of the initialization phase requires new learning algorithms other than traditional ones such as UCB. For a special family of…

ABSTRACT Recent advances in data collection have made sports an attractive testing ground for new analyses and algorithms, and a fascinating controlled microcosm in which to explore social interactions. In this talk I will describe two studies in this arena: one related to public health and the pandemic and one related to decision-making in basketball.  In the first, I will discuss what can be learned from the natural experiments that were (fortuitously) run in America football stadiums. During the 2020…