AI Paper Atlas

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

Lift-Based Bidding in Ad Selection

AAAI 2016 · Bandits and online learning › Online convex optimization and games · approach: Learning for pricing and auctions · 18 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
bid on predicted AR lift instead of absolute ARRTB bidder (GBDT AR model) · 5 pilot advertiser A/B testsaction lift vs passive: 11.2% -> 28.7% (Adv 1); 19.6% -> 47.8% (Adv 5)Helped
bid on AR lift instead of absolute ARRTB bidder · 5 pilot advertisersDSP inventory cost at equal attributions: +1.2% to +37.8%Hurt
bid on AR lift instead of absolute ARRTB bidder · 5 pilot advertiserscost per impression: -3.6% to -16.5%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