Towards Verified Artificial Intelligence
read the original abstract
Verified artificial intelligence (AI) is the goal of designing AI-based systems that that have strong, ideally provable, assurances of correctness with respect to mathematically-specified requirements. This paper considers Verified AI from a formal methods perspective. We describe five challenges for achieving Verified AI, and five corresponding principles for addressing these challenges.
This paper has not been read by Pith yet.
Forward citations
Cited by 4 Pith papers
-
Interactions Between Crosscoder Features: A Compact Proofs Perspective
Derives an interaction measure between crosscoder features from reconstruction error in compact proofs and applies it to produce computationally sparse crosscoders retaining 60% MLP performance with single-feature sel...
-
Effect-Transparent Governance for AI Workflow Architectures: Semantic Preservation, Expressive Minimality, and Decidability Boundaries
A Rocq formalization of 12,000 lines proves that effect governance in AI workflows preserves Turing completeness, expressivity, and observational equivalence to ungoverned executions.
-
Effect-Transparent Governance for AI Workflow Architectures: Semantic Preservation, Expressive Minimality, and Decidability Boundaries
A 12,000-line Rocq development proves that effect-level governance on AI workflows is semantically transparent, preserves expressivity, and separates decidable governance predicates from undecidable semantic properties.
-
Skilldex: A Package Manager and Registry for Agent Skill Packages with Hierarchical Scope-Based Distribution
Skilldex provides a TypeScript-based package manager with line-level format validation and skillset bundling to ensure coherent LLM agent skills.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.