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. 2006.03632
  4. Cited By
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

5 June 2020
Aurélien F. Bibaut
Antoine Chambaz
Mark van der Laan
ArXivPDFHTML

Papers citing "Rate-adaptive model selection over a collection of black-box contextual bandit algorithms"

3 / 3 papers shown
Title
Best of Both Worlds Model Selection
Best of Both Worlds Model Selection
Aldo Pacchiano
Christoph Dann
Claudio Gentile
28
10
0
29 Jun 2022
Leveraging Good Representations in Linear Contextual Bandits
Leveraging Good Representations in Linear Contextual Bandits
Matteo Papini
Andrea Tirinzoni
Marcello Restelli
A. Lazaric
Matteo Pirotta
30
26
0
08 Apr 2021
Generalized Policy Elimination: an efficient algorithm for Nonparametric
  Contextual Bandits
Generalized Policy Elimination: an efficient algorithm for Nonparametric Contextual Bandits
Aurélien F. Bibaut
Antoine Chambaz
Mark van der Laan
OffRL
25
3
0
05 Mar 2020
1