AI Paper Atlas

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

Laplacian Kernelized Bandit

Shuang Wu, Arash A. Amini

ICLR 2026 · 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
use Laplacian kernelized GP-UCB/TS (LK-GP-UCB, LK-GP-TS) instead of linear graph bandits (GoB.Lin, GraphUCB)multi-user contextual bandit · Laplacian-Kernel regime (synthetic)cumulative regretImproved
use LK-GP-UCB instead of Coop-KernelUCB with tuned similarity kernelmulti-user contextual bandit · synthetic regimescumulative regretImproved
use LK-GP-UCB/TS in the linear regime (Linear-GOB)multi-user contextual bandit · Linear-GOB (synthetic)cumulative regretImproved
use LK-GP-UCB/TS on representer-draw rewardsmulti-user contextual bandit · representer draw (synthetic)regret growthImproved
use inverse regularized Laplacian as similarity kernel Kz instead of other four choices (ablation)Coop-KernelUCB · synthetic taskscumulative regretImproved

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