Fixed point label attribution for real-time bidding
Martin Bompaire, Antoine D\'esir, Benjamin Heymann

TL;DR
This paper introduces FiPLA, a fixed point algorithm for accurately attributing user-level rewards to individual display opportunities in real-time bidding, improving the training of machine learning models for ad valuation.
Contribution
The paper proposes a novel fixed point algorithm for label attribution in real-time bidding, addressing the mismatch between user-level rewards and display-level data.
Findings
The FiPLA algorithm is scalable for large datasets.
Application to Criteo data demonstrates effectiveness.
The method improves reward attribution accuracy.
Abstract
Problem definition: Most of the display advertising inventory is sold through real-time auctions. The participants of these auctions are typically bidders (Google, Criteo, RTB House, Trade Desk for instance) who participate on behalf of advertisers. In order to estimate the value of each display opportunity, they usually train advanced machine learning algorithms using historical data. In the labeled training set, the inputs are vectors of features representing each display opportunity and the labels are the generated rewards. In practice, the rewards are given by the advertiser and are tied to whether or not a particular user converts. Consequently, the rewards are aggregated at the user level and never observed at the display level. A fundamental task that has, to the best of our knowledge, been overlooked is to account for this mismatch and split, or attribute, the rewards at the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAuction Theory and Applications · Consumer Market Behavior and Pricing · Optimization and Search Problems
