Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Contextual bandits with surrogate losses: Margin bounds and efficient algorithms
Dylan J Foster, Akshay Krishnamurthy
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use ramp loss with sequential metric entropy rather than a pointwise cover | Adversarial contextual bandits · Lipschitz contextual bandits | regret exponent: \otil(T^{\frac{p+2}{p+4}\vee\frac{p}{p+1}}) versus \otil(T^{\frac{p+1}{p+2}}) | Improved |
| Use hinge loss with Hinge-LMC sampling | Hinge-LMC · Bandit multiclass prediction | mistake bound: \otil((B/\gamma)\sqrt{dT}) | Improved |
| Use SmoothFTL for stochastic Lipschitz contextual bandits | SmoothFTL · Stochastic Lipschitz contextual bandits | regret exponent: T^{\frac{p}{p+1}} versus T^{\frac{p+1}{p+2}} | Improved |
| Use hinge loss as the surrogate and its induced action distribution | Hinge-LMC · Parametric contextual bandits | regret: \otil\left(\frac{B}{\gamma}\sqrt{dT}\right) | Improved |
Closest papers by meaning
- Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback (NeurIPS 2025 · similarity 0.91)
- Contextual Bandits for Unbounded Context Distributions (ICML 2025 · similarity 0.90)
- Second Order Bounds for Contextual Bandits with Function Approximation (ICLR 2025 · similarity 0.90)
- Contextual Bandits with Online Neural Regression (ICLR 2024 · similarity 0.90)
- Contextual Online Decision Making with Infinite-Dimensional Functional Regression (ICML 2025 · similarity 0.90)
- Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit (NeurIPS 2024 · similarity 0.89)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
