arXiv (All)
open access
High-Probability Regret Bounds for Feel-Good Thompson Sampling
Feel-good Thompson sampling (FGTS) augments the posterior of vanilla Thompson sampling with an exploration term that favors reward functions with high predicted optimal values. This modification achieves minimax-optimal regret up to logarithmic factors in linear contextual bandits, but existing anal
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
- Improved Multiplayer Bandit Algorithm for Bernoulli Rewards#1062113
- Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Bandits#1052033
- Rethinking Langevin Thompson Sampling from A Stochastic Approximation Perspective#1324474
- Self-Consuming Generative Models with Co-Evolving Human Preferences#1233454
- Adaptive inference for functionals of M-estimands#1144241
Record · ID 1345336
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