Optimal Ordered Problem Solver

@misc{citeulike:1019356, abstract = {We present a novel, general, optimally fast, incremental way of searching for a universal algorithm that solves each task in a sequence of tasks. The Optimal Ordered Problem Solver (OOPS) continually organizes and exploits previously found solutions to earlier tasks, efficiently searching not only the space of domain-specific algorithms, but also the space of search algorithms. Essentially we extend the principles of optimal nonincremental universal search to build an incremental universal learner that is able to improve itself through experience. In illustrative experiments, our self-improver becomes the first general system that learns to solve all n disk Towers of Hanoi tasks (solution size 2^n-1) for n up to 30, profiting from previously solved, simpler tasks involving samples of a simple context free language.}, author = {Schmidhuber, Juergen }, citeulike-article-id = {1019356}, eprint = {cs/0207097}, keywords = {exploitation, exploration, oops, optimality, problem-solving, program-space, proof-space, search, searching, towers-of-hanoi}, month = {Dec}, posted-at = {2006-12-29 19:18:30}, priority = {2}, title = {Optimal Ordered Problem Solver}, url = {http://arxiv.org/abs/cs/0207097}, year = {2002} }

TY - ELEC ID - citeulike:1019356 L3 - citeulike-article-id:1019356 TI - Optimal Ordered Problem Solver N2 - We present a novel, general, optimally fast, incremental way of searching for a universal algorithm that solves each task in a sequence of tasks. The Optimal Ordered Problem Solver (OOPS) continually organizes and exploits previously found solutions to earlier tasks, efficiently searching not only the space of domain-specific algorithms, but also the space of search algorithms. Essentially we extend the principles of optimal nonincremental universal search to build an incremental universal learner that is able to improve itself through experience. In illustrative experiments, our self-improver becomes the first general system that learns to solve all n disk Towers of Hanoi tasks (solution size 2^n-1) for n up to 30, profiting from previously solved, simpler tasks involving samples of a simple context free language. KW - exploitation KW - exploration KW - oops KW - optimality KW - problem-solving KW - program-space KW - proof-space KW - search KW - searching KW - towers-of-hanoi AU - Schmidhuber, Juergen PY - 2002/Dec/23/ UR - http://arxiv.org/abs/cs/0207097 ER -