Zenodo (CERN)
open access
A Lean formalization of Bayesian bandit value interpolation
This technical note and reproducible Lean packet formalize Bayesian bandit value interpolation from Seungki Min, Costis Maglaras and Ciamac C. Moallemi, Thompson Sampling with Information Relaxation Penalties, arXiv:1902.04251v2, Appendix D.3.2. In the exact independent-arm Bayesian model with me
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
- Validation of Dynamic Bayesian Optimization for a Non-Stationary Human-in-the-Loop Optimization Problem.#710
- BOBA: Dynamic Bayesian Optimization through Bayesian Active Inference#1061926
- Minimax PAC Bounds for Learning in Exogenous Contextual MDPs#1248487
- Kernel weighted importance sampling for off-policy evaluation in contextual bandits#373386
- On-line Learning in Tree MDPs by Treating Policies as Bandit Arms#158565
Record · ID 1417652
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