Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, October 13, 2020, 12:15 pm
Duration: 30 minutes
Location: Zoom: conference room
Speaker: Christopher Harshaw (Yale University)
In randomized experiments, such as a medical trials, we randomly assign the treatment, such as a drug or a placebo, that each experimental subject receives. Randomization can help us accurately estimate the difference in treatment effects with high probability. We also know that we want the two groups to be similar: ideally the two groups would be similar in every statistic we can measure beforehand. Recent advances in algorithmic discrepancy theory allow us to divide subjects into groups with similar statistics. By exploiting the recent Gram-Schmidt Walk algorithm of Bansal, Dadush, Garg, and Lovett, we can obtain random assignments of low discrepancy. These allow us to obtain more accurate estimates of treatment effects when the information we measure about the subjects is predictive, while also bounding the worst-case behavior when it is not.
We will explain the experimental design problem we address, how we use and analyze the Gram-Schmidt walk algorithm, and remaining open problems. This is joint work with Fredrik Sävje, Daniel Spielman, and Peng Zhang.
Automatic MiSe System Software Version 1.4803M | admin login