SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
An asymptotically optimal algorithm for the max k-armed bandit problem
3 references·3 citing·15 second hop
An asymptotically optimal algorithm for the max k-armed bandit problem (2006)An asymptotically optimal algorithm for t…The max K-armed bandit: a new model of exploration applied to search heuristic selection (2005)The max K-armed bandit: a new…An Introduction to Statistical Modeling of Extreme Values (2001)An Introduction to Statistica…Bandit Problems, Sequential Allocation of Experiments. (1987)Bandit Problems, Sequential A…Efficient Multi-Start Strategies for Local Search Algorithms (2011)Efficient Multi-Start Strateg…Bandits Games and Clustering Foundations (2010)Bandits Games and Clustering …Algorithm Selection as a Bandit Problem with Unbounded Losses (2010)Algorithm Selection as a Band…Finite-time Analysis of the Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed Bandit Problem (2002)Learning dynamic algorithm portfolios (2007)ε-first policies for budget-limited multi-armed bandits (2010)Some aspects of the sequential design of experiments (1952)Data fusion (2009)Multivariate stochastic approximation using a simultaneous perturbation gradient approximation (1992)Implementation of the simultaneous perturbation algorithm for stochastic optimization (1998)Idea Generation and the Quality of the Best Idea (2010)Quantitative Risk Management (2011)Top Incomes in the Long Run of History (2011)Learning by Doing and the Choice of Technology (1996)Linearly Parameterized Bandits (2010)Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms (2011)Prediction with Limited Advice and Multiarmed Bandits with Paid Observations (2014)
this work references cited by second hop

References

  • 2001An Introduction to Statistical Modeling of Extreme Values7,338 cited
  • 1987Bandit Problems, Sequential Allocation of Experiments.566 cited
  • 2005The max K-armed bandit: a new model of exploration applied to search heuristic selection114 cited

Cited by

  • 2011Efficient Multi-Start Strategies for Local Search Algorithms69 cited
  • 2010Bandits Games and Clustering Foundations47 cited
  • 2010Algorithm Selection as a Bandit Problem with Unbounded Losses40 cited

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