Pages that link to "Item:Q4645646"
From MaRDI portal
The following pages link to A minimax and asymptotically optimal algorithm for stochastic bandits (Q4645646):
Displaying 11 items.
- An asymptotically optimal policy for finite support models in the multiarmed bandit problem (Q415624) (← links)
- A penalized bandit algorithm (Q1039016) (← links)
- Ballooning multi-armed bandits (Q2238588) (← links)
- An Efficient Algorithm for Learning with Semi-bandit Feedback (Q2859220) (← links)
- A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem (Q3524258) (← links)
- (Q3794059) (← links)
- Learning the distribution with largest mean: two bandit frameworks (Q4606431) (← links)
- Minimax Off-Policy Evaluation for Multi-Armed Bandits (Q5096994) (← links)
- An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback (Q5361319) (← links)
- Greedy Algorithm Almost Dominates in Smoothed Contextual Bandits (Q5890034) (← links)
- Empirical Gittins index strategies with \(\varepsilon\)-explorations for multi-armed bandit problems (Q6167036) (← links)