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 | 18 | 2023 |
On the foundation of distributionally robust reinforcement learning S Wang, N Si, J Blanchet, Z Zhou arXiv preprint arXiv:2311.09018, 2023 | 8 | 2023 |
Sample complexity of variance-reduced distributionally robust Q-learning S Wang, N Si, J Blanchet, Z Zhou arXiv preprint arXiv:2305.18420, 2023 | 7 | 2023 |
Optimal Sample Complexity of Reinforcement Learning for Uniformly Ergodic Discounted Markov Decision Processes. S Wang, J Blanchet, P Glynn CoRR, 2023 | 2 | 2023 |
Optimal Sample Complexity for Average Reward Markov Decision Processes S Wang, J Blanchet, P Glynn arXiv preprint arXiv:2310.08833, 2023 | | 2023 |