Asymptotic Safety Guarantees Based On Scalable Oversight episode artwork

EPISODE · May 6, 2025 · 19 MIN

Asymptotic Safety Guarantees Based On Scalable Oversight

from Best AI papers explained · host Enoch H. Kang

This details a presentation by Geoffrey Irving, Chief Scientist at the UK AI Safety Institute, discussing approaches to achieving asymptotic safety guarantees for AI. Irving critiques existing methods like scalable oversight (including techniques like debate), arguing that current theories and experiments suggest they will likely fail due to issues such as obfuscated arguments and exploration hacking. He proposes that while a full formal verification of neural networks is likely too difficult, an intermediate goal involving theoretical frameworks combined with empirical testing offers a more promising path forward. The discussion highlights the need for novel complexity theory to address problems like obfuscated arguments and suggests that the field needs significantly more researchers to tackle these fundamental challenges in AI safety.

Episode metadata supplied by the publisher feed · Published May 6, 2025

Embed this episode

NOW PLAYING

Asymptotic Safety Guarantees Based On Scalable Oversight

0:00 19:19

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

Frequently Asked Questions

How long is this episode of Best AI papers explained?

This episode is 19 minutes long.

When was this Best AI papers explained episode published?

This episode was published on May 6, 2025.

Can I download this Best AI papers explained episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!