arXiv (All)
open access
Accelerating Linear Bandits with Persistent Candidate Sets
Exhaustive optimistic scoring can make action selection costly in linear bandits with a large fixed set of $K$ actions, requiring $\mathcal{O}(K)$ score evaluations per round. We introduce Persistent Candidate LinUCB (\textsc{PC-LinUCB}), which maintains $k$ active actions and samples $q$ challenger
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
- Sharp Characterization of Bias in Post-Bandit Inference#1052257
- Reserve-Aware Contrast Certificates for Conservative Bandits with Uncertain Baselines#1144073
- Multi-Armed Bernoulli Bandits via Minimax Single-Arm Stopping#1037373
- Allocation Stability and Wald Inference under Variance-Aware UCB#1232583
- Managing Self-Learning Experts under Per-Round Budget Constraints#1129130
Record · ID 1297759
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