Looking for something?
Use the form below to search the site:
Still not finding what you're looking for? Drop a comment on a post or contact us so we can
take care of it!
Marcus Hutter (born 1967) is a German computer scientist and professor at the Australian National University. Hutter was born and educated in Munich, where he studied physics and computer science. In 2000 he joined Jürgen Schmidhuber’s group at the Swiss Artificial Intelligence lab IDSIA, where he developed the first mathematical theory of optimal Universal Artificial Intelligence, based on Kolmogorov complexity and Ray Solomonoff’s theory of universal inductive inference. In 2006 he also accepted a professorship at the Australian National University in Canberra.
Hutter’s notion of universal AI describes the optimal strategy of an agent that wants to maximize its future expected reward in some unknown dynamic environment, up to some fixed future horizon. This is the general reinforcement learning problem. Solomonoff/Hutter’s only assumption is that the reactions of the environment in response to the agent’s actions follow some unknown but computable probability distribution.
At any time, given the limited observation sequence so far, what is the Bayes-optimal way of selecting the next action? Hutter proved that the answer is to use Solomonoff’s universal prior to predict the future, and execute the first action of the action sequence that will maximize the predicted reward up to the horizon. He called this universal algorithm AIXI.
This is mainly a theoretical result. To overcome the problem that Solomonoff’s prior is incomputable, in 2002 Hutter also published an asymptotically fastest algorithm for all well-defined problems. Given some formal description of a problem class, the algorithm systematically generates all proofs in a sufficiently powerful axiomatic system that allows for proving time bounds of solution-computing programs. Simultaneously, whenever a proof has been found that shows that a particular program has a better time bound than the previous best, a clever resource allocation scheme will assign most of the remaining search time to this program. Hutter showed that his method is essentially as fast as the unknown fastest program for solving problems from the given class, save for an additive constant independent of the problem instance. For example, if the problem size is n, and there exists an initially unknown program that solves any problem in the class within n7 computational steps, then Hutter’s method will solve it within 5n7 + O(1) steps. The additive constant hidden in the O() notation may be large enough to render the algorithm practically infeasible despite its useful theoretical properties.
Several algorithms approximate AIXI in order to make it run on a modern computer, at the expense of its perfect optimality.
On August 6, 2006, Hutter announced the Hutter Prize for Lossless Compression of Human Knowledge with an initial purse of 50,000 Euros, the intent of which is to encourage the advancement of artificial intelligence through the exploitation of Hutter’s theory of optimal universal artificial intelligence.
Science. I’m interested in problems on the boundary between science and philosophy, which have a chance of being solved in my expected lifetime, especially Artificial Intelligence and a physical Theory of Everything. Math in its whole breadth (statistics, numerics, algebra, …) has become my constant and cherished companion. With computer graphics one can convince oneself and others that math is beautiful indeed. For details consult my projects, or publications or curriculum vitae.
Universal Artificial Intelligence. You may be interested in my book, which presents sequential decision theory from a novel algorithmic information theory perspective. While the former theory is suited for active agents in known environments, the latter is suited for passive prediction in unknown environments. The book introduces these two well-known but very different ideas and removes the limitations by unifying them to an optimal reinforcement learning agent embedded in an arbitrary unknown environment.
Calculators. Computers of the old days and, especially programmable pocket calculators, were not just mass-produced, noname PC compatibles like nowadays, but possessed a personal character. You knew every bit by name, you were proud of every single byte and tact cycle you optimized away, and you got very exited when occasionally meeting someone who had the same/a compatible model. You may enjoy browsing through my virtual exhibition of my old “calcis” and my program collection.
Puzzles & Games. If you want to knock me out, just give me a puzzle and I won’t disturb you until I’ve solved it. Of course the puzzle should be a challenge. It should be neither trivial nor solvable by brute force combinatorics only. I got/want all games without a solution and in decomposed/scrambled form. Some of them would be too easy if one were to undo them carefully oneself. The gallery contains some of my puzzles together with solutions I found by myself (during boring school lessons) in case I bothered writing them down.
Personal. On my personal pages you can find a selection of photos of my USA and my Australia trips, each 5 weeks, 10000km by car, my property on the moon, what I think about the future, some fun, my curriculum vitae. Feel free to contact me or write in my guestbook.