arXiv (OAI)open access
Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL
machine learning, information theory, optimization and control
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗Related documents
Record · ID 158739
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.