| Extreme: dynamic multi-armed bandits for adaptive operator selection |
| Full text |
Pdf
(330 KB)
|
Source
|
Genetic And Evolutionary Computation Conference
archive
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
table of contents
Montreal, Québec, Canada
WORKSHOP SESSION: Automated heuristic design: crossing the chasm for search methods
table of contents
Pages 2213-2216
Year of Publication: 2009
ISBN:978-1-60558-505-5
|
|
Authors
|
|
Álvaro Fialho
|
Microsoft Research - INRIA Joint Centre, Orsay, France
|
|
Luis Da Costa
|
Project-team TAO, LRI / INRIA Saclay - Île-de-France, Orsay, France
|
|
Marc Schoenauer
|
Microsoft Research - INRIA Joint Centre & Project-team TAO, LRI / INRIA Saclay - ÎÎle-de-France, Orsay, France
|
|
Michèle Sebag
|
Microsoft Research - INRIA Joint Centre & Project-team TAO, LRI / INRIA Saclay - ÎÎle-de-France, Orsay, France
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 5, Downloads (12 Months): 17, Citation Count: 0
|
|
|
ABSTRACT
The performance of evolutionary algorithms is highly affected by the selection of the variation operators to solve the problem at hand. This abstract presents a survey of results that have been obtained using the "Extreme - Dynamic Multi-Armed Bandit" (Ex-DMAB), a technique used to automatically select the operator to be applied between the available ones, while searching for the solution. Experiments on three well-known artificial problems of the EC community are presented, namely the OneMax, the long k-path and the Royal Road, demonstrating some improvements over both any choice of a single-operator alone, and the naive uniform choice of one operator at each application. The Ex-DMAB approach is also compared to the optimal choice of operators, whenever available. The results are discussed in the light of the new parameters that are introduced to tune the selection technique...
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
H. J. C. Barbosa and A. M. S´a. On adaptive operator probabilities in real coded genetic algorithms. In Proc. Intl. Conf. Chilean Computer Science Society, 2000.
|
| |
3
|
|
 |
4
|
Luis DaCosta , Alvaro Fialho , Marc Schoenauer , Michèle Sebag, Adaptive operator selection with dynamic multi-armed bandits, Proceedings of the 10th annual conference on Genetic and evolutionary computation, July 12-16, 2008, Atlanta, GA, USA
[doi> 10.1145/1389095.1389272]
|
| |
5
|
|
| |
6
|
|
| |
7
|
A. Fialho, L. DaCosta, M. Schoenauer, and M. Sebag. Dynamic multi-armed bandits and extreme value-based rewards for adaptive operator selection. In Proc. LION-3. Springer-Verlag, 2009.
|
 |
8
|
|
| |
9
|
|
| |
10
|
C. Hartland, N. Baskiotis, S. Gelly, O. Teytaud, and M. Sebag. Change point detection and meta-bandits for online learning in dynamic environments. In Proc. CAp'07, July 2007.
|
| |
11
|
|
| |
12
|
F. Lobo and D. Goldberg. Decision making in a hybrid genetic algorithm. In Proc. ICEC'97, pages 121--125. IEEE Press, 1997.
|
| |
13
|
J. Maturana, A. Fialho, F. Saubion, M. Schoenauer, and M. Sebag. Extreme compass and dynamic multi-armed bandits for adaptive operator selection. In CEC'09: Proceedings of the IEEE International Conference on Evolutionary Computation (to appear). IEEE, 2009.
|
| |
14
|
|
| |
15
|
E. Page. Continuous inspection schemes. Biometrika, 41:100--115, 1954.
|
 |
16
|
|
| |
17
|
|
 |
18
|
|
| |
19
|
Wong, Lee, Leung, and Ho. A novel approach in parameter adaptation and diversity maintenance for GAs. Soft Computing, 7(8):506--515, 2003.
|
|