AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

Simultaneously Learning Stochastic and Adversarial Bandits under the Position-Based Model

AAAI 2022 · Bandits and online learning › Online convex optimization and games · approach: Online decision-making with feedback structure · 3 citations (OpenAlex)

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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use FTRL-PBM with a PBM-specific self-bounding constraint and 1/2-Tsallis entropyOnline learning to rank under PBM · Stochastic environmentregret upper bound: O(\frac{mn}{\Delta_\beta \Delta} \log(T))Helped
Use FTRL-PBM with a 1/2-Tsallis entropy regularizerOnline learning to rank under PBM · Adversarial environmentregret upper bound: O(m\sqrt{nT})Helped
Replace the commonly defined suboptimality gap with a PBM-specific gap that accounts for misplaced itemsFTRL-PBM stochastic regret analysis · PBM stochastic environmentregret analysisHelped
Use a PBM-specific stochastic-and-adversarial algorithm rather than methods designed for only one environmentFTRL-PBM · Synthetic stochastic environmentsaveraged rewardsMixed

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