2min chapter

Lex Fridman Podcast cover image

#75 – Marcus Hutter: Universal Artificial Intelligence, AIXI, and AGI

Lex Fridman Podcast

CHAPTER

Is There an Approximation of the Induction?

The solomov induction part which was you know find the shortest program describing your data just replaces by standard data compressors. We focus on a particular compressor called context reweighting which is pretty amazing not so well known. Has beautiful theoretical properties also works reasonably well in practice. And for the planning part we essentially just took the ideas from a computer go from 2006 it was Java, separate,. Barry also now I did mine who developed the so called UCT algorithm upper confidence bound for trees algorithm on top of the Monte Carlo tree search. So we approximate this planning part by sampling. It's successful on some small toy problems. The agent does know the rules of the game really nothing and all

00:00

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode