The following pages link to Batched bandit problems (Q282463):
Displaying 14 items.
- Batched bandit problems (Q282463) (← links)
- Gaussian two-armed bandit: limiting description (Q2211179) (← links)
- Customization of J. Bather's UCB strategy for a Gaussian multiarmed bandit (Q2689638) (← links)
- Learning the distribution with largest mean: two bandit frameworks (Q4606431) (← links)
- Rejoinder (Q4690950) (← links)
- Learning Unknown Service Rates in Queues: A Multiarmed Bandit Approach (Q4994160) (← links)
- Bayesian adaptive bandit-based designs using the Gittins index for multi-armed trials with normally distributed endpoints (Q5035752) (← links)
- (Q5043718) (← links)
- Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability (Q5868941) (← links)
- Functional Sequential Treatment Allocation (Q5881136) (← links)
- Greedy Algorithm Almost Dominates in Smoothed Contextual Bandits (Q5890034) (← links)
- Online learning of energy consumption for navigation of electric vehicles (Q6157210) (← links)
- Invariant description of control in a Gaussian one-armed bandit problem (Q6570243) (← links)
- Optimization of two-alternative batch processing with parameter estimation based on data inside batches (Q6599849) (← links)
