arXiv (All)
open access
Odds-Ratio Thompson Sampling: A Specification and Design Guide for Contrast-Based Multi-Armed Bandits
Batched multi-armed bandits update on a service's own schedule, and the usual implementation carries each arm's absolute reward rate from one update to the next. When the shared level moves between batches, that memory goes stale even though the comparisons between arms may not have. Odds-Ratio Thom
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
- Reserve-Aware Contrast Certificates for Conservative Bandits with Uncertain Baselines#1144073
- Low-Rank Single-Index Bandits with Unknown Links: From Matrices to Tensors#1117737
- Flow-Corrected Thompson Sampling for Non-Stationary Contextual Bandits#1048713
- Future Information-Directed Sampling for Bayesian Nonstationary Bandits#1119054
- Methods for Reproducible Comparison of Strategies in Stochastic Modelling#241491
Record · ID 1014297
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