Non-Incremental Osearch

• In phase i=1,2,3… execute all programs p with -logP(p) + log t(p) = i.

• Bit programs: size(p) + lg t(p) = i.

• First applications : Schmidhuber, ICML 95, Neural Networks 97, Schmidhuber & Wiering & Schraudolph, ICML 97, MLJ 97

• My postdoc Hutter’s more complex optimal algorithm for all well-defined problems (IJFCS 2002): constant factor ə+? ! Additive unknown constant :-(

Previous slide

Next slide

Back to first slide

View graphic version