Dynamic Algorithm Selection Using Reinforcement Learning

Authors:
Warren Armstrong;Peter Christen;Eric McCreath;Alistair P. Rendell
Affiliations:
The Australian National University, Australia;The Australian National University, Australia;The Australian National University, Australia;The Australian National University, Australia
Venue:
AIDM '06 Proceedings of the International Workshop on on Integrating AI and Data Mining
Year:
2006

Citing 0
Cited 3

Cross-disciplinary perspectives on meta-learning for algorithm selection

ACM Computing Surveys (CSUR)
Dynamic ADTs: a "don't ask, don't tell" policy for data abstraction

Proceedings of the 2007 International Lisp Conference
A generic adaptive simulation algorithm for component-based simulation systems

Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is often the case that many algorithms exist to solve a single problem, each possessing different performance characteristics. The usual approach in this situation is to manually select the algorithm which has the best average performance. However, this strategy has drawbacks in cases where the optimal algorithm changes during an invocation of the program, in response to changes in the program's state and the computational environment. This paper presents a prototype tool that uses reinforcement learning to guide algorithm selection at runtime, matching the algorithm used to the current state of the computation. The tool is applied to a simulation similar to those used in some computational chemistry problems. It is shown that the low dimensionality of the problem enables the optimal choice of algorithm to be determined quickly, and that the learning system can react rapidly to phase changes in the target program.