ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2112.08507
  4. Cited By
Algorithms for Adaptive Experiments that Trade-off Statistical Analysis
  with Reward: Combining Uniform Random Assignment and Reward Maximization
v1v2v3 (latest)

Algorithms for Adaptive Experiments that Trade-off Statistical Analysis with Reward: Combining Uniform Random Assignment and Reward Maximization

15 December 2021
Tong Li
Jacob Nogas
Haochen Song
Harsh Kumar
A. Durand
Anna N. Rafferty
Nina Deliu
S. Villar
Joseph Jay Williams
ArXiv (abs)PDFHTML

Papers citing "Algorithms for Adaptive Experiments that Trade-off Statistical Analysis with Reward: Combining Uniform Random Assignment and Reward Maximization"

4 / 4 papers shown
Title
Power Constrained Bandits
Power Constrained Bandits
Jiayu Yao
Emma Brunskill
Weiwei Pan
Susan Murphy
Finale Doshi-Velez
92
36
0
13 Apr 2020
Inference for Batched Bandits
Inference for Batched Bandits
Kelly W. Zhang
Lucas Janson
Susan Murphy
84
85
0
08 Feb 2020
Are sample means in multi-armed bandits positively or negatively biased?
Are sample means in multi-armed bandits positively or negatively biased?
Jaehyeok Shin
Aaditya Ramdas
Alessandro Rinaldo
69
37
0
27 May 2019
Accurate Inference for Adaptive Linear Models
Accurate Inference for Adaptive Linear Models
Y. Deshpande
Lester W. Mackey
Vasilis Syrgkanis
Matt Taddy
OffRL
101
61
0
18 Dec 2017
1