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. 1507.04523
  4. Cited By
Upper-Confidence-Bound Algorithms for Active Learning in Multi-Armed
  Bandits

Upper-Confidence-Bound Algorithms for Active Learning in Multi-Armed Bandits

16 July 2015
Alexandra Carpentier
A. Lazaric
Mohammad Ghavamzadeh
Rémi Munos
P. Auer
András Antos
ArXiv (abs)PDFHTML

Papers citing "Upper-Confidence-Bound Algorithms for Active Learning in Multi-Armed Bandits"

3 / 3 papers shown
Title
Active Learning for Accurate Estimation of Linear Models
Active Learning for Accurate Estimation of Linear Models
C. Riquelme
Mohammad Ghavamzadeh
A. Lazaric
62
11
0
02 Mar 2017
Empirical Bernstein Bounds and Sample Variance Penalization
Empirical Bernstein Bounds and Sample Variance Penalization
Andreas Maurer
Massimiliano Pontil
400
545
0
21 Jul 2009
Adaptive optimal allocation in stratified sampling methods
Adaptive optimal allocation in stratified sampling methods
P. Étoré
B. Jourdain
123
63
0
28 Nov 2007
1