arXiv (All)
open access
Computationally efficient safe exploration in reinforcement learning
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 computational
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Provably Optimal Reinforcement Learning under Safety Filtering#1034680
- Safety-aware Skill Adaptation for Reinforcement Learning in Dynamic Environments#998962
- Certified Safety Curation: Distribution-Free Guarantees for Safe Offline Reinforcement Learning#999991
- Bellman Meets Lyapunov: Unsupervised Reinforcement Learning via Mastering Chaos#1161048
- Bellman Meets Lyapunov: Unsupervised Reinforcement Learning via Mastering Chaos#1157360
Record · ID 1037602
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive