Analyzing bandit-based adaptive operator selection mechanisms
DOI10.1007/S10472-010-9213-YzbMATH Open1226.68081OpenAlexW1977474365MaRDI QIDQ647443FDOQ647443
Authors: Álvaro Fialho, Luis Da Costa, Marc Schoenauer, Michèle Sebag 
Publication date: 23 November 2011
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-010-9213-y
Recommendations
- An experimental analysis of the bandit problem
- Tuning Bandit Algorithms in Stochastic Environments
- Evaluating strategies for generalized bandit problems
- Bandit algorithms
- Multi-armed bandit processes with optimal selection of the operating times
- Optimal learning and experimentation in bandit problems.
- Stochastic Algorithms: Foundations and Applications
- On the evaluation of strategies for branching bandit processes
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Introduction to evolutionary computing
- Asymptotically efficient adaptive allocation rules
- Title not available (Why is that?)
- Finite-time analysis of the multiarmed bandit problem
- Inference about the change-point from cumulative sum tests
- Evolutionary computation in practice
- The Sequential Parameter Optimization Toolbox
- Analyzing bandit-based adaptive operator selection mechanisms
- Parameter setting in evolutionary algorithms.
- Algorithm portfolio selection as a bandit problem with unbounded losses
- Autonomous operator management for evolutionary algorithms
- Artificial Evolution
Cited In (17)
- Adaptive operator selection with reinforcement learning
- Latest stored information based adaptive selection strategy for multiobjective evolutionary algorithm
- Learning to select the recombination operator for derivative-free optimization
- Self-adjusting mutation rates with provably optimal success rules
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics
- Autonomous operator management for evolutionary algorithms
- Multi-constructor CMSA for the maximum disjoint dominating sets problem
- Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems
- Adaptive multimeme algorithm for flexible job shop scheduling problem
- An adaptive evolutionary approach for real-time vehicle routing and dispatching
- Using Automated Algorithm Configuration for Parameter Control
- Gorthaur-EXP3: bandit-based selection from a portfolio of recommendation algorithms balancing the accuracy-diversity dilemma
- Analyzing bandit-based adaptive operator selection mechanisms
- A dynamic Thompson sampling hyper-heuristic framework for learning activity planning in personalized learning
- Hyperparameter autotuning of programs with HybridTuner
- Differential evolution with adaptive trial vector generation strategy and cluster-replacement-based feasibility rule for constrained optimization
- A comparative study of ad hoc techniques and evolutionary methods for multi-armed bandit problems
Uses Software
This page was built for publication: Analyzing bandit-based adaptive operator selection mechanisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647443)
