atlas

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

Real-Time Bidding with Side Information

NeurIPS 2017 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Ranking bandits · 8 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
Overbidding (optimistic bids from confidence-set upper bound) used to incentivize exploration of theta*, bid = max over confidence set of theta^T xcontextual bidding with unlimited budget (Section 2) · B = infinity, real-time biddingpseudo-regret R_THelped
Lazy batch updates of the confidence set (update only when det(M_t) grows by factor 1+A) instead of every round (ablation)unlimited-budget contextual bidding · B = infinitypseudo-regret R_TMixed
Bid multiplier lambda found by stochastic bisection search (phases with fixed lambda_k) combined with ellipsoidal confidence sets, master phasesgeneral limited-budget case (B = beta*T) · B linear in Tpseudo-regret R_{B,T}Helped
Bid multiplier lambda learned via stochastic bisection search with known theta* (no confidence set estimation)limited-budget bidding with known theta* · B linear in Tpseudo-regret R_{B,T}Helped

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