[2506.20904] Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL
![[2506.20904] Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL](https://arxiv.org/static/browse/0.3.4/images/arxiv-logo-fb.png){kind=logo}
Summary
Abstract page for arXiv paper 2506.20904: Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL
Description
Abstract page for arXiv paper 2506.20904: Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL
Original reporting
AFBytes is a read-only aggregator. Use the original source for full context and complete reporting.
Open original source