arXiv CS
open access
Explore Once, Evaluate Many: Multiple Policy Evaluation for Stochastic Linear Bandits
We study how to evaluate $K$ target policies simultaneously in stochastic contextual bandits with linear reward structure. Given a known $d$-dimensional feature map and reward-free access to policy queries, we propose PRISMA (Policy evaluation through Regularized Information Sharing and Mixture Allo
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
- Explore Once, Evaluate Many: Multiple Policy Evaluation for Stochastic Linear Bandits#1357907
- Constrained Contextual Bandits with Adversarial Contexts#1342472
- Efficient learning by implicit exploration in bandit problems with side observations#138929
- QASP: Query-Adaptive Robust Vector Search Policy#422238
- Meritocratic Fairness in Budgeted Combinatorial Multi-armed Bandits via Shapley Values#151720
Record · ID 1348848
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