arXiv (All)
open access
Reliable Scale-Free Bandits via Empirical Likelihood
We study stochastic bandits without knowledge of reward scales or tail parameters. Almost-sure regret guarantees describe eventual learning but do not quantify expected performance or the risk of large regret in a finite run. We introduce $\texttt{EL-F}$, an anytime empirical-likelihood (EL) extensi
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
- Bandits for Efficient Experimentation: Adapting to Control Group, Preferences, and Context Drifts#267638
- Parameter-Free Heavy-Tailed Bandits#422257
- Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Bandits#1052033
- Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion#436425
- Memory--Batch Tradeoffs in Lipschitz Bandits#1118682
Record · ID 1343249
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