AI Paper Atlas

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

UCB-based Algorithms for Multinomial Logistic Regression Bandits

Sanae Amani, Christos Thrampoulidis

NeurIPS 2021 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Linear and generalized linear bandits · 1 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
increase number of outcomes K from 1 to 3MNL-UCB · synthetic MNL bandit (d=2, T=1000, 20 arms)average regretHurt
increase kappa upper bound from 30 to 60 to 100 (K=2)MNL-UCB · synthetic MNL bandit (K=2)average regretHurt
use the locally adaptive estimator and bonus instead of the global-bound tilde estimator and bonus (ablation)MNL-UCB · synthetic MNL bandit (K=2, kappa=30)average 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