21 citations · 29 across the 5 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LG2021★ 3 cited
Algorithms for Adaptive Experiments that Trade-off Statistical Analysis with Reward: Combining Uniform Random Assignment and Reward Maximization
Tong Li, Jacob Nogas, Haochen Song +8
Traditional randomized A/B experiments assign arms with uniform random (UR) probability, such as 50/50 assignment to two versions of a website to discover whether one version engag…
cs.LG2021★ 1 cited
Challenges in Statistical Analysis of Data Collected by a Bandit Algorithm: An Empirical Exploration in Applications to Adaptively Randomized Experiments
Joseph Jay Williams, Jacob Nogas, Nina Deliu +4
Multi-armed bandit algorithms have been argued for decades as useful for adaptively randomized experiments. In such experiments, an algorithm varies which arms (e.g. alternative in…