Old Web
English
Sign In
Acemap
>
Paper
>
Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexity.
Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexity.
2022
Laixi Shi
Gen Li
Yuting Wei
Yuxin Chen
Yuejie Chi
Correction
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]