arXiv (All)
open access
Expected Sample Complexity in Multi-Armed Bandits
Sample complexity is a widely used metric in sequential decision-making problems, defined as the number of suboptimal decisions during the interaction between the agent and an environment. We study the sample complexity of stochastic multi-armed bandit problems and introduce the expected sample comp
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
- Understanding Generalization Requires Universal Induction#1128728
- From Restless to Contextual: A Thresholding Bandit Reformulation For Finite-horizon Improvement#1342304
- Complexity and Biases#164110
- KTO: Model Alignment as Prospect Theoretic Optimization#984793
- High-dimensional Linear Bandits with Knapsacks#974143
Record · ID 1234296
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