research
∙
04/11/2023
Did we personalize? Assessing personalization by an online reinforcement learning algorithm using resampling
There is a growing interest in using reinforcement learning (RL) to pers...
share
research
∙
01/14/2023
Compress Then Test: Powerful Kernel Testing in Near-linear Time
Kernel two-sample testing provides a powerful framework for distinguishi...
research
∙
11/25/2022
Doubly robust nearest neighbors in factor models
In this technical note, we introduce an improved variant of nearest neig...
research
∙
11/14/2022
On counterfactual inference with unobserved confounding
Given an observational study with n independent but heterogeneous units ...
research
∙
02/14/2022
Counterfactual inference for sequential experimental design
We consider the problem of counterfactual inference in sequentially desi...
research
∙
11/15/2021
Distribution Compression in Near-linear Time
In distribution compression, one aims to accurately summarize a probabil...
research
∙
10/04/2021
Generalized Kernel Thinning
The kernel thinning (KT) algorithm of Dwivedi and Mackey (2021) compress...
research
∙
05/12/2021
Kernel Thinning
We introduce kernel thinning, a new procedure for compressing a distribu...
research
∙
08/23/2020
Stable discovery of interpretable subgroups via calibration in causal studies
Building on Yu and Kumbier's PCS framework and for randomized experiment...
research
∙
06/17/2020
Revisiting complexity and the bias-variance tradeoff
The recent success of high-dimensional models, such as deep neural netwo...
research
∙
05/22/2020
Instability, Computational Efficiency and Statistical Accuracy
Many statistical estimators are defined as the fixed point of a data-dep...
research
∙
05/16/2020
Curating a COVID-19 data repository and forecasting county-level death counts in the United States
As the COVID-19 outbreak continues to evolve, accurate forecasting conti...
research
∙
05/29/2019
Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients
Hamiltonian Monte Carlo (HMC) is a state-of-the-art Markov chain Monte C...
research
∙
02/01/2019
Challenges with EM in application to weakly identifiable mixture models
We study a class of weakly identifiable location-scale mixture models fo...
research
∙
10/01/2018
Singularity, Misspecification, and the Convergence Rate of EM
A line of recent work has characterized the behavior of the EM algorithm...
research
∙
01/08/2018
Log-concave sampling: Metropolis-Hastings algorithms are fast!
We consider the problem of sampling from a strongly log-concave density ...
research
∙
10/23/2017