In the next UAI research meeting on Oct. 12th at 3 pm EDT, Dr. Bruno Bauwens will present his work on Solomonoff induction of selected bits. We will use the regular meets link (also in the UAI Reading Group calendar‘s description).
Bio
Dr. Bruno Bauwens is an Associate Professor at the Higher School of Economics (HSE) University’s Faculty of Computer Science in Moscow. He is a specialist in Kolmogorov complexity and algorithmic information theory, having previously completed postdoctoral positions at Porto, Montpellier and Lorraine.
Abstract
When only some bits of a sequence follow a computable pattern, Solomonoff induction is known to learn those bits eventually. This work bounds how fast that happens. It also applies the bounds to online classification and shows where standard Solomonoff induction can fail, which motivates the online variant used in universal AI.
Leave a Reply