Bandit-based Estimation of Distribution Algorithms for Noisy Optimization: Rigorous Runtime Analysis
Résumé
We show complexity bounds for noisy optimization, in frame- works in which noise is stronger than in previously published papers[19]. We also propose an algorithm based on bandits (variants of [16]) that reaches the bound within logarithmic factors. We emphasize the differ- ences with empirical derived published algorithms.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...