arXiv (All)
open access
Minimax-Optimality of Posterior Sampling for Reinforcement Learning
Posterior sampling for reinforcement learning (PSRL) is one of the simplest and most effective exploration methods, but a basic question has remained open: does unmodified PSRL achieve minimax regret without structural assumptions on the prior? We answer yes. Exact vanilla PSRL is minimax optimal in
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Simple-regret rates and minimax optimality of fixed-prior expected improvement in Matérn and squared-exponential RKHSs#422276
- Le Critique: Privileged Value Functions for LLM Reinforcement Learning#625298
- Le Critique: Privileged Value Functions for LLM Reinforcement Learning#623025
- Le Critique: Privileged Value Functions for LLM Reinforcement Learning#459655
- Tail-Likelihood Reinforcement Learning#996949
Record · ID 1117958
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive