2min chapter

AI Safety Fundamentals: Alignment cover image

AI Safety via Debate

AI Safety Fundamentals: Alignment

CHAPTER

The MNIST Debate Game

The MNIST debate game is simple enough that we can play it with pure Monte Carlo tree search, reference to Coulomb 2006. We use 10,000 rollouts per move, where each rollout descends to a leaf for evaluation using the judge. During rollouts, we select nodes to expand using the PUCT variant in Silver et al 2017A. At node S, we pick action A to maximize and N of S and A is the visit count. High is a broken randomly. The model pre-commit, we play nine different games for the same image,. With the nine possible liars, the liar wins if any liar wins. Taking the best liar performance over nine games gives an

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