## Abstract

Given is a problem sequence and a probability distribution (the bias) on programs computing solution candidates. We present an optimally fast way of incrementally solving each task in the sequence. Bias shifts are computed by program prefixes that modify the distribution on their suffixes by reusing successful code for previous tasks (stored in non-modifiable memory). No tested program gets more runtime than its probability times the total search time. In illustrative experiments, ours becomes the first general system to learn a universal solver for arbitrary n disk Towers of Hanoi tasks (minimal solution size 2n - 1). It demonstrates the advantages of incremental learning by profiting from previously solved, simpler tasks involving samples of a simple context free language.

Original language | English (US) |
---|---|

Title of host publication | Advances in Neural Information Processing Systems |

Publisher | Neural information processing systems foundation |

ISBN (Print) | 0262025507 |

State | Published - Jan 1 2003 |

Externally published | Yes |