ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2003.02873
  4. Cited By
Generalized Policy Elimination: an efficient algorithm for Nonparametric
  Contextual Bandits

Generalized Policy Elimination: an efficient algorithm for Nonparametric Contextual Bandits

Conference on Uncertainty in Artificial Intelligence (UAI), 2020
5 March 2020
Aurélien F. Bibaut
Antoine Chambaz
Mark van der Laan
    OffRL
ArXiv (abs)PDFHTML

Papers citing "Generalized Policy Elimination: an efficient algorithm for Nonparametric Contextual Bandits"

3 / 3 papers shown
Risk Minimization from Adaptively Collected Data: Guarantees for
  Supervised and Policy Learning
Risk Minimization from Adaptively Collected Data: Guarantees for Supervised and Policy LearningNeural Information Processing Systems (NeurIPS), 2021
Aurélien F. Bibaut
Antoine Chambaz
Maria Dimakopoulou
Nathan Kallus
Mark van der Laan
OffRL
241
17
0
03 Jun 2021
Sequential causal inference in a single world of connected units
Sequential causal inference in a single world of connected units
Aurélien F. Bibaut
M. Petersen
N. Vlassis
Maria Dimakopoulou
Mark van der Laan
CMLOffRL
195
12
0
18 Jan 2021
Rate-adaptive model selection over a collection of black-box contextual
  bandit algorithms
Rate-adaptive model selection over a collection of black-box contextual bandit algorithms
Aurélien F. Bibaut
Antoine Chambaz
Mark van der Laan
206
6
0
05 Jun 2020
1
Page 1 of 1