AI Paper Atlas

Research map / Bandits and online learning / Contextual bandits and Thompson sampling

Learning from Distributed Users in Contextual Linear Bandits Without Sharing the Context

Osama Hanna, Lin Yang, Christina Fragouli

NeurIPS 2022 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Oracle-efficient contextual bandits · 0 citations (OpenAlex)

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 changedWhereMeasuredEffect
central learner runs a single-context bandit algorithm on designed action set and sends parameter estimates, instead of agents sending contextsAlgorithm 1 (known context distribution) · distributed contextual linear banditcommunication per context: 0 bits per contextImproved
wrap LinUCB-type algorithm in Algorithm 1 with quantized 1-bit rewardsAlgorithm 1 · distributed contextual linear banditregretNo clear effect
use Algorithm 2 with about 5d bits per context for unknown context distributionAlgorithm 2 · distributed contextual linear banditregretImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy