Obserwuj
Shengbo Wang
Shengbo Wang
Ph.D. candidate, Stanford University
Zweryfikowany adres z stanford.edu
Tytuł
Cytowane przez
Cytowane przez
Rok
A finite sample complexity bound for distributionally robust q-learning
S Wang, N Si, J Blanchet, Z Zhou
International Conference on Artificial Intelligence and Statistics, 3370-3398, 2023
182023
On the foundation of distributionally robust reinforcement learning
S Wang, N Si, J Blanchet, Z Zhou
arXiv preprint arXiv:2311.09018, 2023
82023
Sample complexity of variance-reduced distributionally robust Q-learning
S Wang, N Si, J Blanchet, Z Zhou
arXiv preprint arXiv:2305.18420, 2023
72023
Optimal Sample Complexity of Reinforcement Learning for Uniformly Ergodic Discounted Markov Decision Processes.
S Wang, J Blanchet, P Glynn
CoRR, 2023
22023
Optimal Sample Complexity for Average Reward Markov Decision Processes
S Wang, J Blanchet, P Glynn
arXiv preprint arXiv:2310.08833, 2023
2023
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–5