Analyzing bandit-based adaptive operator selection mechanisms
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 867338 (Why is no real title available?)
- Algorithm portfolio selection as a bandit problem with unbounded losses
- Analyzing bandit-based adaptive operator selection mechanisms
- Artificial Evolution
- Asymptotically efficient adaptive allocation rules
- Autonomous operator management for evolutionary algorithms
- Evolutionary computation in practice
- Finite-time analysis of the multiarmed bandit problem
- Inference about the change-point from cumulative sum tests
- Introduction to evolutionary computing
- Parameter setting in evolutionary algorithms.
- The Sequential Parameter Optimization Toolbox
Cited in
(17)- Analyzing bandit-based adaptive operator selection mechanisms
- Multi-constructor CMSA for the maximum disjoint dominating sets problem
- Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems
- Hyperparameter autotuning of programs with HybridTuner
- Latest stored information based adaptive selection strategy for multiobjective evolutionary algorithm
- A comparative study of ad hoc techniques and evolutionary methods for multi-armed bandit problems
- Gorthaur-EXP3: bandit-based selection from a portfolio of recommendation algorithms balancing the accuracy-diversity dilemma
- Differential evolution with adaptive trial vector generation strategy and cluster-replacement-based feasibility rule for constrained optimization
- Using Automated Algorithm Configuration for Parameter Control
- Autonomous operator management for evolutionary algorithms
- Self-adjusting mutation rates with provably optimal success rules
- Adaptive operator selection with reinforcement learning
- Learning to select the recombination operator for derivative-free optimization
- An adaptive evolutionary approach for real-time vehicle routing and dispatching
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics
- Adaptive multimeme algorithm for flexible job shop scheduling problem
- A dynamic Thompson sampling hyper-heuristic framework for learning activity planning in personalized learning
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)
