[2505.12202] Near-Optimal Sample Complexities of Divergence-based S-rectangular Distributionally Robust Reinforcement Learning
![[2505.12202] Near-Optimal Sample Complexities of Divergence-based S-rectangular Distributionally Robust Reinforcement Learning](https://arxiv.org/static/browse/0.3.4/images/arxiv-logo-fb.png){kind=logo}
Summary
Abstract page for arXiv paper 2505.12202: Near-Optimal Sample Complexities of Divergence-based S-rectangular Distributionally Robust Reinforcement Learning
Description
Abstract page for arXiv paper 2505.12202: Near-Optimal Sample Complexities of Divergence-based S-rectangular Distributionally Robust Reinforcement Learning
Original reporting
AFBytes is a read-only aggregator. Use the original source for full context and complete reporting.
Open original source