arXiv (All)
open access
Variance-Aware Non-Stationary Bandits:All-Budget Regret Bounds and Adaptation Costs
Low reward variance reduces estimation cost, but does not eliminate monitoring of arms that may improve while unobserved. We refine the variance--variation tradeoff and characterize how both costs depend on supplied variance and variation budgets in bounded, non-stationary multi-armed bandits. Let $
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
- Optimal Priors for Betting Tests with Bounded Payoffs: An Exact Efficiency Characterization#1400637
- Improved Multiplayer Bandit Algorithm for Bernoulli Rewards#1062113
- Adaptive inference for functionals of M-estimands#1144241
- Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Bandits#1052033
- Learning from a Bandit Learner#1401282
Record · ID 1401295
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