Metraipolis › archive › dc_67deb304b75f
Efficient Bayes-Adaptive Reinforcement Learning with Temporal Logic Specifications — arXiv:2609.20954
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.20954
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T01:44:31.832Z
- SHA-256 of the archived text
8be17ffb768b46779af9ebbf80e9787792970c7cf97dd234e1d545d65eca423d- Stable URL of this page
https://metraipolis.com/documento/dc_67deb304b75f
How to cite
Efficient Bayes-Adaptive Reinforcement Learning with Temporal Logic Specifications — arXiv:2609.20954 — arXiv (en), https://arxiv.org/abs/2609.20954 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_67deb304b75f (Metraipolis archive dc_67deb304b75f, sha256 8be17ffb768b46779af9ebbf80e9787792970c7cf97dd234e1d545d65eca423d)
BibTeX
@misc{dc67deb304b75f,
title = {Efficient Bayes-Adaptive Reinforcement Learning with Temporal Logic Specifications — arXiv:2609.20954},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.20954},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_67deb304b75f; sha256 8be17ffb768b46779af9ebbf80e9787792970c7cf97dd234e1d545d65eca423d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20954. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We present a novel end-to-end model-based Reinforcement Learning (RL) algorithm for efficient policy synthesis under given Linear Temporal Logic (LTL) specifications (e.g., safety or reachability) in unknown environments. To do so, a Limit-Deterministic B{ü}chi Automaton (LDBA) representation of the LTL task is synchronised with a Bayes-Adaptive Markov Decision Process (BAMDP) representation of the environment, which allows us to leverage an enhanced exploration-exploitation trade-off that is achieved via Bayesian RL, as opposed to traditional non-Bayesian approaches. We further propose a novel Bayes-Adaptive Monte-Carlo Planning (BAMCP) algorithm to allow for approximate Bayes-optimal strategy synthesis in the synchronised BAMDP construct. A range of finite- and infinite-horizon task experiments demonstrate the effectiveness of our approach in terms of both property satisfaction and sample efficiency, when compared to traditional model-free approaches. Additional ablation studies also successfully highlight the value of the novel BAMCP algorithm in comparison to classical BAMCP for LTL task satisfaction. Finally, we also showcase a successful application of our approach for \textit{cautious} RL, namely to reduce the number of task violations incurred during policy training.
Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-21 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.20954 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T01:14:16.595Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).