Thompson Sampling for Optimizing Stochastic Local Search
Authors:
- 30 December 2017
- book chapter
- Published by Springer Nature
- p. 493-510
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Kullback–Leibler upper confidence bounds for optimal sequential allocationThe Annals of Statistics, 2013
- Refining Restarts Strategies for SAT and UNSAT2012
- Sequential Model-Based Optimization for General Algorithm Configuration2011
- An Investigation of Reinforcement Learning for Reactive Search Optimization2011
- Analyzing bandit-based adaptive operator selection mechanismsAnnals of Mathematics and Artificial Intelligence, 2010
- Time-Bounded Sequential Parameter OptimizationLecture Notes in Computer Science, 2010
- A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms2009
- Adaptive operator selection with dynamic multi-armed bandits2008
- Finite-time Analysis of the Multiarmed Bandit ProblemMachine Learning, 2002
- Asymptotically efficient adaptive allocation rulesAdvances in Applied Mathematics, 1985