Search Results for author: Drew Dimmery

Found 8 papers, 2 papers with code

Interpretable Personalized Experimentation

no code implementations5 Nov 2021 Han Wu, Sarah Tan, Weiwei Li, Mia Garrard, Adam Obeng, Drew Dimmery, Shaun Singh, Hanson Wang, Daniel Jiang, Eytan Bakshy

Black-box heterogeneous treatment effect (HTE) models are increasingly being used to create personalized policies that assign individuals to their optimal treatments.

Online Discrepancy Minimization via Persistent Self-Balancing Walks

no code implementations4 Feb 2021 David Arbour, Drew Dimmery, Tung Mai, Anup Rao

We study the online discrepancy minimization problem for vectors in $\mathbb{R}^d$ in the oblivious setting where an adversary is allowed fix the vectors $x_1, x_2, \ldots, x_n$ in arbitrary order ahead of time.

Data Structures and Algorithms Discrete Mathematics Combinatorics

Experimentation for Homogenous Policy Change

no code implementations28 Jan 2021 Molly Offer-Westort, Drew Dimmery

When the Stable Unit Treatment Value Assumption (SUTVA) is violated and there is interference among units, there is not a uniquely defined Average Treatment Effect (ATE), and alternative estimands may be of interest, among them average unit-level differences in outcomes under different homogeneous treatment policies.

Methodology Applications

Efficient Balanced Treatment Assignments for Experimentation

1 code implementation21 Oct 2020 David Arbour, Drew Dimmery, Anup Rao

In this work, we reframe the problem of balanced treatment assignment as optimization of a two-sample test between test and control units.

Designing Transportable Experiments

1 code implementation8 Sep 2020 My Phan, David Arbour, Drew Dimmery, Anup B. Rao

To reduce the variance of our estimator, we design a covariate balance condition (Target Balance) between the treatment and control groups based on the target population.

Methodology

Balanced off-policy evaluation in general action spaces

no code implementations9 Jun 2019 Arjun Sondhi, David Arbour, Drew Dimmery

We show that minimizing the risk of the classifier implies minimization of imbalance to the desired counterfactual distribution of state-action pairs.

Binary Classification counterfactual +2

Cannot find the paper you are looking for? You can Submit a new open access paper.