Provably Efficient Offline Reinforcement Learning with Perturbed Data Sources (Conference Paper) | NSF PAGES

skip to main content

Citation Details

Provably Efficient Offline Reinforcement Learning with Perturbed Data Sources

Award ID(s):: 2003131 1956276 2030026 2133170

NSF-PAR ID:: 10450254

Author(s) / Creator(s):: Shi, C.; Xiong, W.; Shen, C.; Yang, J.

Date Published:: 2023-01-01

Journal Name:: Proceedings of the 40th International Conference on Machine Learning

Volume:: 202

Page Range / eLocation ID:: 31353-31388

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
The DOI is not currently available.