Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Federated Linear Bandits with Finite Adversarial Actions
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Doubly Adversarial Federated Bandits (ICML 2023 · similarity 0.92)
- An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction (NeurIPS 2025 · similarity 0.92)
- A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits (NeurIPS 2022 · similarity 0.91)
- A Near-Optimal Best-of-Both-Worlds Algorithm for Federated Bandits (ICLR 2026 · similarity 0.91)
- Sparsity-Agnostic Linear Bandits with Adaptive Adversaries (NeurIPS 2024 · similarity 0.90)
- Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback (NeurIPS 2025 · 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.