Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Learning Kernelized Contextual Bandits in a Distributed and Asynchronous Environment
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
- Communication Efficient Distributed Learning for Kernelized Contextual Bandits (NeurIPS 2022 · similarity 0.95)
- Kernel Methods for Cooperative Multi-Agent Contextual Bandits (ICML 2020 · similarity 0.90)
- Communication Efficient Federated Learning for Generalized Linear Bandits (NeurIPS 2022 · similarity 0.90)
- On Kernelized Multi-Armed Bandits with Constraints (NeurIPS 2022 · similarity 0.90)
- Communication-Efficient Federated Non-Linear Bandit Optimization (ICLR 2024 · similarity 0.87)
- Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit (NeurIPS 2024 · similarity 0.87)
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.