atlas

Research map / Reinforcement learning / MDPs and planning

Incrementality Bidding via Reinforcement Learning under Mixed and Delayed Rewards

NeurIPS 2022 · Reinforcement learning › MDPs and planning · approach: POMDPs and confounded RL · 2 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 model-based UCB-style reinforcement learning with PAMM parameter estimates and offline planningIncrementality bidding · Online episodesregret: O(H^2 \sqrt{\log(HT/\delta) T} + H^2 \log(T/\delta))Helped
Match conversion-count moments across episodes with the same prior winning historyPAMM incrementality parameter estimation · Incrementality parameter estimationabsolute estimation error: C_1 \sqrt{\frac{\log{1/\delta}}{n_h}}; C_2 \sqrt{\frac{\log{1/\delta}}{n_{h}(\ell)}}Helped
Use an optimism confidence region for incrementality parametersOnline Bidding algorithm · Incrementality bidding, online episodesregret: O(H^2 \sqrt{\log(HT/\delta) T} + H^2 \log(T/\delta))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