Efficient Exploration in Average-Reward Constrained Reinforcement Learning: Achieving Near-Optimal Regret With Posterior Sampling

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Provodin, Danil, Kaptein, Maurits, Pechenizkiy, Mykola
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2405.19017