arXiv (All)
open access
m-Set Adversarial Bandits with Winner Feedback
We show upper and lower bounds on the regret of $m$-set adversarial bandits for different utilities (winner reward or sum of rewards) and feedback models (winner index, winner reward, sum of rewards, and their combinations). By comparing to standard bounds for combinatorial and MNL bandits, our resu
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
- An Efficient Near-Optimal Algorithm for Adversarial $m$-Set Bandits#447923
- Reserve-Aware Contrast Certificates for Conservative Bandits with Uncertain Baselines#1144073
- Sharp Characterization of Bias in Post-Bandit Inference#1052257
- Sharp Minimax Regret for Infinite-Memory Logistic Prediction#985234
- Multi-Armed Bandits With Machine Learning-Generated Surrogate Rewards#158736
Record · ID 1234495
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