Computational Hardness of Reinforcement Learning with Partial $q^π$-Realizability

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Karimi, Shayan, Tan, Xiaoqi
Format:	Preprint
Published:	2025
Subjects:	Artificial Intelligence Computational Complexity Machine Learning 68Q17 (Primary) 68T05, 68T42 (Secondary) F.2.2; I.2.6; I.2.8
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2510.21888