Bounded Autonomy and Verifiable Safety for Agentic AI Enabled Automation
cs.LG, cs.ET, cs.SY, eess.SY
Submitted: 2026-09-24
Updated: 2026-09-24
Comments: This paper has been accepted and will appear in the Journal of Intelligent and Robotic Systems (10.1007/s10846-026-02467-w)
Code: https://github.com/icsdataset/hai
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
The gist: Agentic AI-enabled automation cannot be safely deployed in high-stakes environments on probabilistic reasoning alone.
Terminology
Abstract
Agentic AI-enabled automation cannot be safely deployed in high-stakes environments on probabilistic reasoning alone. A recurring risk is epistemic drift: as reasoning deepens, system behavior may move away from subject-matter-expert constraints for safe operation. This paper presents BRaVeS, a bounded reasoning and safety-governance framework termed the Defensible Next-Gen Reasoning System (DNRS). BRaVeS encodes SME-defined constraints as invariant anchors, proposes MoDA-Style (Mixture of Depths Attention) depth-aware access as a candidate mechanism for keeping these anchors visible during inference, and uses a state hierarchy (SMARtAutonomy) to reduce autonomy as epistemic risk increases. To formalize bounded recovery, we introduce the Lyapunov-Bounded Consensus Framework (LBCF), which maps continuous epistemic-risk signals into a finite K-bag abstraction and applies shielded state transitions that enforce Lyapunov-style energy descent or route the system to a human-mediated terminal state. The formal convergence result applies to the finite LBCF abstraction under fixed thresholds and feasible-shield assumptions; it does not prove safety of the full continuous neural activation space. We evaluate the framework through a discrete event Monte Carlo simulation using HAI 22.04 industrial-control-system time-series data with synthetic noise and sensor-degradation regimes. Across the tested parameter-grouping strategies and thresholds, the LBCF process achieved finite-step convergence and no safety-guard violations. These results provide simulation-based evidence that bounded governance behavior can be enforced under the stated abstraction, while motivating future work on deployed transformer implementations, live human-in-the-loop validation, and broader adversarial settings.
Sources
- Scaling Laws for Neural Language Models
- Post-LayerNorm Is Back: Stable, ExpressivE, and Deep
- Constitutional AI: Harmlessness from AI Feedback
- Self-critiquing models for assisting human evaluators
- Augmented Language Models: a Survey
- The Unconditional Performance of Control Charts for Zero-Inflated Processes with Estimated Parameters
- Mixture-of-Depths Attention
- Mixture-of-Depths: Dynamically allocating compute in transformer-based language models
- Attention Is All You Need For Mixture-of-Depths Routing
- Harness-1: Reinforcement Learning for Search Agents with State-Externalizing Harnesses
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks