Skip to content

Risk-Aware Online Conformal State Probing

Sep 2026 · 0 citations · 17 references
Engineering Computer Science

TL;DR

This work proposes online conformal state probing (OCSP), an action and probing policy that certifies worst-case reliability levels without relying on distributional assumptions, and can be applied to existing pre-trained value-based control policies without requiring retraining or fine-tuning.

Abstract

AI-based autonomous agents, typically hosted at data centers, must acquire state information from robots or edge devices in order to issue informed control decisions. Managing uncertainty about the state is particularly consequential in safety-critical settings, in which average-case guarantees are insufficient. In this context, we study a sequential decision maker process that jointly decides which actions to take and when to probe given access to an arbitrary state prediction model. We propose online conformal state probing (OCSP), an action and probing policy that certifies worst-case reliability levels without relying on distributional assumptions. OCSP is designed to provably control the missed query error (MQE), i.e., the fraction of instances where probing would have been beneficial, while minimizing the probing rate. OCSP can be applied to existing pre-trained value-based control policies without requiring retraining or fine-tuning. We validate OCSP through numerical simulations to verify theoretical guarantees and to assess performance trade-offs as a function of the calibration of the state predictor.

View source

Similar papers

#machine learning Preprint Oct 2026

Coverage You Can Steer: Online Conformal Calibration for RL-Driven Hardware-Aware NAS

Hardware-aware neural architecture search (NAS) is dominated by evaluation cost: every architecture must be trained before its reward is known. Conformal-prediction filters cut this cost by pruning candidates whose predicted-reward upper bound misses a threshold, with a distribution-free guarantee that at most a fracti...

P. Brandimarte, N. Aranjuelo, M. Nieto et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Mini-Batch Risk-Averse Deep Q-Learning: A Robot Navigation Case Study

This work studies the control of Markov decision processes in which the quality of a policy is evaluated by a dynamic, time-consistent Markov risk measure rather than by an expected discounted cost, and employs mini-batch transition risk mappings.

A. Patel, Andrzej Ruszczyński · 0 citations
#artificial intelligence Preprint Oct 2026

Selective Critique for Cost-Aware LLM Agents in Long-Horizon Decision Making

Improving the reliability of large language model (LLM) agents in long-horizon decision-making remains a key challenge. When deployed as autonomous agents interacting with complex environments, early mistakes can propagate through trajectories and cause cascading failures. Recent approaches improve reliability by incor...

Heewon Park, Somin Im, Minhae Kwon · 0 citations
#machine learning Preprint Sep 2026

Model-based Bootstrap for Offline Policy Evaluation in Tabular Reinforcement Learning

This paper proposes a model-based bootstrap framework for uncertainty quantification of OPE in finite-horizon, time-inhomogeneous Markov decision processes (MDPs), and establishes bootstrap distributional consistency, asymptotically valid confidence intervals, and consistent variance estimation for the target policy va...

Wei-Wei Wang, Yu-Qiang Li, Xian-Yi Wu et al. · 0 citations
Open access Aug 2026

Dual-critic constrained deceptive Q-learning for deployment-time policy protection

The Dual-Critic Constrained Deceptive Q-Learning (DCD-Q) method is proposed, a deployment-time trajectory protection framework that aims to reduce the information leaked by released trajectories while preserving acceptable task performance.

Guang-Yu Pan, Bo Hou, Yao Chen et al. · 0 citations
#machine learning Preprint Sep 2026

ICMAPE: In-Context Multiagent Pure Exploration

ICMAPE converts the fixed-confidence identification objective into a reward derived from inference confidence, so that standard reinforcement learning machinery can be applied to decentralized pure exploration.

Xin-Yi Hu, Alessio Russo, Aldo Pacchiano · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.