Towards Guaranteed Safe AI

Summary

This partial ingest is based on the extracted full PDF text. Dalrymple et al. define guaranteed safe (GS) AI as a family of AI-safety approaches that aim to equip an AI system and its surrounding infrastructure with high-assurance quantitative safety guarantees. Their core architecture combines a world model, a safety specification, and a verifier; the paper argues that empirical evaluation alone is too weak for high-risk autonomous systems because it depends on test-distribution assumptions, long-horizon extrapolation, and vulnerability to deceptive or distribution-aware behavior.

Key Claims

  • Safety-critical AI systems should carry quantitative safety guarantees, not only empirical test results or informal arguments.
  • A GS AI system is characterized by a world model, one or more safety specifications, and a verifier that produces a proof certificate, probabilistic bound, asymptotic guarantee, or comparable assurance.
  • The world model should capture all future effects relevant to the specification, using manual models, learned probabilistic programs, Bayesian or SMC inference, sound abstractions, or formally verified physics-grounded models where feasible.
  • Safety specifications are broader than reward functions and may use probabilistic temporal logics, reachability constraints, causal counterfactual queries, or bounded evaluative criteria.
  • Verifiers form a spectrum from red-teaming and empirical evaluation through probabilistic inference, optimal control, proof certificates, and human-checkable proofs; GS AI requires the stronger end of that spectrum.

Methods / Formalism

  • The paper’s central object is a deployed AI system plus world model(s), safety specification(s), and verifier.
  • The source’s definition says the specification should encode societal risk criteria; the verifier should show that the AI satisfies the specification relative to the world model; and the world model should conservatively cover relevant future effects of the AI and environment.
  • A compact wiki-level schema for the guarantee is:

where epsilon=0 is a proof-style guarantee and epsilon>0 covers sound probabilistic upper bounds.

  • Guaranteed Safe AI keeps the reusable concept-level triad and the distinction between empirical evaluation, model-based assurance, and proof-like verification.
  • Guaranteed Safe AI Safety Case records the focused tuple, probability-bound judgment, and deployment-monitoring implications.

Evidence / Experiments

  • The paper is primarily programmatic and conceptual rather than experimental.
  • It supports its case by comparing existing safety-assurance routes across world-model, specification, and verification spectra, and by giving concrete application sketches such as critical infrastructure, cybersecurity, geofencing, remote kill switches, verified sensors and actuators, and backup systems.
  • It argues for an “anytime” R&D portfolio: cheaper evaluations and red-teaming remain useful, but stronger GS-style methods are needed as system risk increases.

Connections

  • Extends Goal Alignment from objective matching toward system-level assurance: the key question is whether a specification, model, and verifier can jointly bound harmful behavior.
  • Connects Safe Reinforcement Learning to broader high-assurance AI safety by treating shields, constraints, safe sets, and model checking as pieces of a larger assurance architecture.
  • Fits Formal Methods because the proposed safety case depends on specifications, abstractions, model checking, proof certificates, and runtime monitoring.
  • Connects to AI Evaluation and Benchmarking by arguing that empirical evaluations are necessary but insufficient for high-assurance safety claims.
  • Complements Everitt2019 - Towards Safe Artificial General Intelligence, which formalizes alignment and reward tampering failures that a GS AI safety case would need to rule out or bound.

Open Questions

  • Which parts of current safe-RL tooling can provide sound bounds rather than approximate diagnostics?
  • How should a wiki distinction be drawn between GS AI as a broad safety case and narrower verified-control, shielding, or model-checking methods?
  • Can learned world models be audited enough for high-assurance claims without losing the scalability that makes them attractive?

Citation

Dalrymple, David, Joar Skalse, Yoshua Bengio, Stuart Russell, Max Tegmark, Sanjit Seshia, Steve Omohundro, Christian Szegedy, Ben Goldhaber, Nora Ammann, Alessandro Abate, Joe Halpern, Clark Barrett, Ding Zhao, Tan Zhi-Xuan, Jeannette Wing, and Joshua Tenenbaum. 2024. “Towards Guaranteed Safe AI: A Framework for Ensuring Robust and Reliable AI Systems.” arXiv:2405.06624v2.