Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

The max K-armed bandit: a new model of exploration applied to search heuristic selection

6 references·5 citing·32 second hop

FromToDepth

this work references cited by second hop

References

2001An Introduction to Statistical Modeling of Extreme Values7,338 cited
2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
1987Bandit Problems, Sequential Allocation of Experiments.566 cited
2002A Constraint-Based Method for Project Scheduling with Time Windows206 cited
1995The Continuum-Armed Bandit Problem201 cited

Cited by

2007Learning dynamic algorithm portfolios107 cited
2010ε-first policies for budget-limited multi-armed bandits83 cited
2006An asymptotically optimal algorithm for the max k-armed bandit problem77 cited
2011Efficient Multi-Start Strategies for Local Search Algorithms69 cited
2017Max K-Armed Bandit: On the ExtremeHunter Algorithm and Beyond58 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work