Model-free dynamic algorithm portfolios, compared with parameterless GA
Abstract: Given is a search problem or a sequence of search problems, as well as a set of potentially useful search algorithms. We propose a general framework for online allocation of computation time to search algorithms based on experience with their performance so far. In an example instantiation, we use simple linear extrapolation of performance for allocating time to various simultaneously running genetic algorithms characterized by different parameter values. Despite the large number of searchers... (Update)
Cited by: More
Dynamic Algorithm Portfolios - And
(Correct)
Active bibliography (related documents): More All
0.7: A Neural Network Model for Inter-Problem Adaptive Online.. - Gagliolo, Schmidhuber (2005)
(Correct)
0.5: Model-Based Reinforcement Learning for Evolving Soccer .. - Wiering, Salustowicz, .. (2001)
(Correct)
0.3: Cooperative Transportation Scheduling: an Application.. - Fischer, Müller, Pischel (1995)
(Correct)
Similar documents based on text: More All
1.1: Applying LSTM to Time Series Predictable Through.. - Gers, Eck, Schmidhuber (2001)
(Correct)
1.0: Optimal Control Using the Tranport Equation: the Liouville.. - Kwee, Schmidhuber (2000)
(Correct)
0.9: Gradient-based Reinforcement Planning in Policy-Search.. - Kwee, Hutter, Schmidhuber (2001)
(Correct)
BibTeX entry: (Update)
Gagliolo, M., Zhumatiy, V., Schmidhuber, J.: Adaptive online time allocation to search algorithms. In Boulicaut, J.F., Esposito, F., Giannotti, F., Pedreschi, D., eds.: Machine Learning: ECML 2004. http://citeseer.ist.psu.edu/gagliolo04adaptive.html More
@inproceedings{ gagliolo04adaptive,
author = "M. Gagliolo and V. Zhumatiy and J. Schmidhuber",
title = "Adaptive online time allocation to search algorithms",
booktitle = {Machine Learning: {ECML} 2004. Proceedings of the 15th European Conference on Machine Learning, Pisa, Italy, September 20-24, 2004},
year = {2004},
month = {September},
editor = {J.F. Boulicaut and F.Esposito and F. Giannotti and Dino Pedreschi},
pages = {134-143},
publisher = {Springer},
note = {--- Extended tech. report available at \texttt{http://www.idsia.ch/idsiareport/{IDSIA}-23-04.ps.gz}},
url = {citeseer.ist.psu.edu/gagliolo04adaptive.html} }
Citations (may not include all citations):
1931
Adaptation in Natural and Artificial Systems (context) - Holland - 1975
374
Reinforcement learning: a survey
- Kaelbling, Littman et al. - 1996
89
Deliberation scheduling for problem solving in time-constrai.. (context) - Boddy, Dean - 1994
60
A representation for the adaptive generation of simple seque.. (context) - Cramer - 1985
59
Efficient algorithms for minimizing cross validation error
- Moore, Lee - 1994
33
Embedding decision-analytic control in a learning architectu.. (context) - Etzioni - 1991
30
New Genetic Local Search Operators for the Traveling Salesma..
- Freisleben, Merz - 1996
25
The algorithm selection problem (context) - Rice - 1976
22
A bayesian approach to tackling hard computational problems
- Horvitz, Ruan et al. - 2001
17
SATLIB: An Online Resource for Research on SAT
- Hoos, Stutzle - 2000
16
Algorithm selection using reinforcement learning
- Lagoudakis, Littman - 2000
14
Monitoring and control of anytime algorithms: A dynamic prog..
- Hansen, Zilberstein - 2001
14
Meta-learning by landmarking various learning algorithms
- Pfahringer, Bensusan et al. - 2000
13
Optimal ordered problem solver
- Schmidhuber - 2004
11
Russell and Eric H (context) - Stuart - 1991
10
Exponential smoothing: the state of the art (context) - Jr - 1985
10
A parameter-less genetic algorithm
- Harick, Lobo - 1999
9
Computational tradeoffs under bounded resources (context) - Horvitz, Zilberstein - 2001
5
A racing algorithm for configuring metaheuristics
- Birattari, Stutzle et al. - 2002
3
Gomes and Bart Selman (context) - Carla - 2001
3
and action: A practical model for robot control (context) - Russell, Zilberstein et al. - 1993
2
the use of fast subsampling estimates for algorithm recommen.. (context) - Furnkranz, Petrak et al. - 2002
2
Probabilistic incremental program evolution (context) - Sal, Schmidhuber - 1997
1
Introduction to the special issue on meta-learning (context) - Giraud-Carrier, Vilalta et al. - 2004
1
EU ESPRIT METAL Project (context) - Furnkranz, on - 2001
1
On data and algorithms: Understanding inductive performance (context) - Kalousis, Gama et al. - 2004
1
Progress in incremental machine learning
- Solomonoff - 2003
1
Giraud-Carrier (context) - Keller - 2000
1
A portfolio approach to algorithm selection (context) - Nudelman, Andrew et al. - 2003
1
A meta-learning method to select the kernel width in support.. (context) - Soares, Brazdil et al. - 2004
1
31st Annual Conference on Current Trends in Theory and Pract.. (context) - Petrik, combination et al. - 2005
http://lancet.mit.edu/ga
http://www.iwr.uni-heidelberg.de/groups/
Documents on the same site (http://www.idsia.ch/~matteo/): More
Dynamic Algorithm Portfolios - And
(Correct)
A Neural Network Model for Inter-Problem Adaptive Online.. - Gagliolo, Schmidhuber (2005)
(Correct)
Recurrent Support Vector Machines - Schmidhuber, al. (2005)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC