Active Learning in Multi-armed Bandits
From MaRDI portal
Recommendations
Cites work
- Adaptive optimal allocation in stratified sampling methods
- Asymptotically efficient adaptive allocation rules
- Finite-time analysis of the multiarmed bandit problem
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- Measure Theory and Probability Theory
- Probability Inequalities for Sums of Bounded Random Variables
Cited in
(14)- Upper-Confidence-Bound Algorithms for Active Learning in Multi-armed Bandits
- V-optimal designs for heteroscedastic regression
- Active Learning of Multiple Source Multiple Destination Topologies
- Learning the distribution with largest mean: two bandit frameworks
- scientific article; zbMATH DE number 7387623 (Why is no real title available?)
- On the bias, risk, and consistency of sample means in multi-armed bandits
- Efficient Algorithms for General Active Learning
- scientific article; zbMATH DE number 6542809 (Why is no real title available?)
- Incentive Compatible Active Learning.
- Optimal activation of halting multi‐armed bandit models
- Multinomial Thompson sampling for rating scales and prior considerations for calibrating uncertainty
- Active learning with multi-criteria decision making systems
- Models of active learning in group-structured state spaces
- Active learning in heteroscedastic noise
This page was built for publication: Active Learning in Multi-armed Bandits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3529929)