SOURCE-LINKED INTELLIGENCE

Computationally efficient safe exploration in reinforcement learning

arXiv · AI, language, vision and robotics · article · Sep 19, 2026 · UTC

Reinforcement learning in real-life applications requires safety guarantees during exploration. Typical reinforcement learning algorithms do not provide such guarantees, and many modifications that do rely on Gaussian processes (GPs), which have a large computational cost. We propose a computationally lightweight algorithm based on the Nadaraya-Watson estimator that safely explores and optimizes constrained Markov decision processes (MDPs). Our algorithm, \textsc{CoLSafe-MDP}, uses an estimator that scales in constant-time with bounds on the estimates, a significant improvement from its GP-bas

Read original source ↗ Open in workspace

recordType

paper

region

Global