Pages that link to "Item:Q3524258"
From MaRDI portal
The following pages link to A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem (Q3524258):
Displaying 6 items.
- Dynamic sample budget allocation in model-based optimization (Q645551) (← links)
- Multi-armed bandits with episode context (Q766259) (← links)
- Learning dynamic algorithm portfolios (Q870809) (← links)
- An analysis of model-based interval estimation for Markov decision processes (Q959899) (← links)
- BoostingTree: parallel selection of weak learners in boosting, with application to ranking (Q2251442) (← links)
- Optimal Learning for Stochastic Optimization with Nonlinear Parametric Belief Models (Q4586173) (← links)
