Algorithmic Advances For The Design And Analysis Of Randomized Control Trials

APA

(2022). Algorithmic Advances For The Design And Analysis Of Randomized Control Trials. The Simons Institute for the Theory of Computing. https://simons.berkeley.edu/talks/algorithmic-advances-design-and-analysis-randomized-control-trials

MLA

Algorithmic Advances For The Design And Analysis Of Randomized Control Trials. The Simons Institute for the Theory of Computing, Feb. 11, 2022, https://simons.berkeley.edu/talks/algorithmic-advances-design-and-analysis-randomized-control-trials

BibTex

          @misc{ scivideos_19619,
            doi = {},
            url = {https://simons.berkeley.edu/talks/algorithmic-advances-design-and-analysis-randomized-control-trials},
            author = {},
            keywords = {},
            language = {en},
            title = {Algorithmic Advances For The Design And Analysis Of Randomized Control Trials},
            publisher = {The Simons Institute for the Theory of Computing},
            year = {2022},
            month = {feb},
            note = {19619 see, \url{https://scivideos.org/Simons-Institute/19619}}
          }
          
Christopher Harshaw (Yale)
Source Repository Simons Institute

Abstract

In this talk, I will survey some of my dissertation work on algorithmic problems arising in the design and analysis of randomized experiments. I hope to give a sense of the style of problems and technical work that I enjoy. During my dissertation work, I was asking: How can we design sampling algorithms to achieve desired levels of covariate balance in a randomized experiment? How can we estimate the variance of a treatment effect estimator in the presence of general interference? How should we analyze and design so-called "bipartite" experiments where units which receive treatment are distinct from units on which outcomes are measured?