arXiv (All)
open access
Elicitation and Decision Geometry in Single-Index Bandits
We study two-arm contextual bandits with arm-specific single indices and a shared unknown monotone link. Monotonicity makes the optimal action depend only on the contrast between the index directions, hence arm-specific reward functions need not be estimated. We introduce Natural Boundary Learning (
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
- Elicitation and Decision Geometry in Single-Index Bandits#1108766
- When Greedy Sampling Explores: KL-Regularized Contextual Bandits without Eluder-Dimension Dependence#1160767
- High-dimensional Linear Bandits with Knapsacks#974143
- Statistical inference of additive monotone models and instance-optimality of multi-armed bandits and reinforcement learning#206992
- Least-Favorable Location for Binomial Top-$t$ Selection#926385
Record · ID 1130276
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