Dynamic model-based algorithm portfolios with online training, applied to GA
Abstract: Traditional Meta-Learning requires long training times, and is often focused on optimizing performance quality, neglecting computational complexity. Algorithm Portfolios are more robust, but present similar limitations. We reformulate algorithm selection as a time allocation problem: all candidate algorithms are run in parallel, and their relative priorities are continually updated based on runtime information, with the aim of minimizing the time to reach a desired performance level. Each... (Update)
Active bibliography (related documents): More All
0.6: Adaptive Online Time Allocation to Search Algorithms - Gagliolo, Zhumatiy.. (2004)
(Correct)
0.4: A Neural Network Model for Inter-Problem Adaptive Online.. - Gagliolo, Schmidhuber (2005)
(Correct)
0.3: A Portfolio Approach to Algorithm Selection - Leyton-Brown, Nudelman..
(Correct)
Similar documents based on text:
0.4: Bias-Optimal Incremental Learning of Control.. - Schmidhuber..
(Correct)
BibTeX entry: (Update)
@unpublished{ gagliolo06dynamic,
author = {Matteo Gagliolo and J\"{u}rgen Schmidhuber},
title = {Dynamic Algorithm Portfolios},
year = {2006},
month = {January},
note = {Ninth International Symposium on Artificial Intelligence and Mathematics},
url = {citeseer.ist.psu.edu/731557.html} }
Citations (may not include all citations):
1931
Adaptation in Natural and Artificial Systems (context) - Holland - 1975
1662
Neural networks for pattern recognition (context) - Bishop - 1995
374
Reinforcement learning: a survey
- Kaelbling, Littman et al. - 1996
89
Deliberation scheduling for problem solving in timeconstrain.. (context) - Boddy, Dean - 1994
65
Bandit Problems: Sequential Allocation of Experiments (context) - Berry, Fristedt - 1985
59
Efficient algorithms for minimizing cross validation error
- Moore, Lee - 1994
33
Shifting inductive bias with success-story algorithm
- Schmidhuber, Zhao et al. - 1996
25
The algorithm selection problem (context) - Rice - 1976
22
A bayesian approach to tackling hard computational problems
- Horvitz, Ruan et al. - 2001
18
Applied Life Data Analysis (context) - Nelson - 1982
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 - 2003
13
Learning the empirical hardness of optimization problems: Th.. (context) - Leyton-Brown, Nudelman et al. - 2002
10
A perspective view and survey of meta-learning
- Vilalta, Drissi - 2002
10
A parameter-less genetic algorithm
- Harick, Lobo - 1999
10
Artificial Intelligence (context) - Gomes, Selman - 2001
9
Computational tradeoffs under bounded resources (context) - Horvitz, Zilberstein - 2001
1
A neural network model for inter-problem adaptive online tim..
- Gagliolo, Schmidhuber - 2005
1
Adaptive online time allocation to search algorithms
- Gagliolo, Zhumatiy et al. - 2004
1
Presented at SOFSEM 2005 - 31st Annual Conference on Current.. (context) - Petrik - 2005
1
Progress in incremental machine learning (context) - Solomonoff - 2003
Documents on the same site (http://www.idsia.ch/~matteo/): More
A Neural Network Model for Inter-Problem Adaptive Online.. - Gagliolo, Schmidhuber (2005)
(Correct)
Adaptive Online Time Allocation to Search Algorithms - Gagliolo, Zhumatiy.. (2004)
(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