arXiv (All)
open access
When May a Bandit Leave Its Anchor? E-Process-Authorized Thompson Sampling under Non-stationarity
Stationarity rewards memory, but after a change the same history can mislead. We ask when forgetting should be permitted. E-process-authorized Thompson sampling (e-ATS) gives each arm full-history and discounted Beta states. An anytime-valid e-process first authorizes the discounted state, then a re
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
- When May a Bandit Leave Its Anchor? E-Process-Authorized Thompson Sampling under Non-stationarity#1181630
- Asymptotically Optimal Best Arm Identification with Fixed-Budget under Differential Privacy#1200251
- Statistical Inference for Continuous Action Bandits#1234168
- Memory--Batch Tradeoffs in Lipschitz Bandits#1118682
- Bayesian Nonparametric Thompson Sampling for Multi-Armed Bandits#1342259
Record · ID 1188357
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