arXiv (All)
open access
Saturation-Insensitive Dueling Bandits with General Function Approximation
We study contextual dueling bandits with general function approximation under the Bradley-Terry-Luce (BTL) preference model. A key challenge in this setting is the saturation of the preference model: when the current reward model can already distinguish two actions with high confidence, the resultin
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
- The Power of Simple Mechanisms: A Tight $e$-Approximation for Gains from Trade in Matching Markets#1142298
- A Preference Analysis of Reinforcer Variation and Choice#448414
- Fairness under uncertainty in sequential decisions#126517
- On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings#797214
- Official Review · ICLR 2026#787023
Record · ID 1117723
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