Approaching the Ad Placement Problem with Online Linear Classification: The winning solution to the NIPS'17 Ad Placement Challenge

12/05/2017
by   Alexey Grigorev, et al.
0

The task of computational advertising is to select the most suitable advertisement candidate from a set of possible options. The candidate is selected in such a way that the user is most likely to positively react to it: click and perform certain actions afterwards. Choosing the best option is done by a "policy" -- an algorithm which learns from historical data and then is used for future actions. This way the policy should deliver better targeted content with higher chances of interactions. Constructing the policy is a difficult problem and many researches and practitioners from both the industry and the academia are concerned with it. To advance the collaboration in this area, the organizers of NIPS'17 Workshop on Causal Inference and Machine Learning challenged the community to develop the best policy algorithm. The challenge is based on the data generously provided by Criteo from the logs of their production system. In this report we describe the winning approach to the challenge: our team was able to achieve the IPS of 55.6 and secured the first position. Our solution is made available on GitHub.

READ FULL TEXT

page 1

page 2

page 3

research
08/10/2021

Method Towards CVPR 2021 SimLocMatch Challenge

This report describes Megvii-3D team's approach towards SimLocMatch Chal...
research
10/15/2020

Causal Inference in the Presence of Interference in Sponsored Search Advertising

In classical causal inference, inferring cause-effect relations from dat...
research
08/15/2022

Placement Laundering and the Complexities of Attribution in Online Advertising

A basic assumption in online advertising is that it is possible to attri...
research
05/27/2021

Model Selection for Production System via Automated Online Experiments

A challenge that machine learning practitioners in the industry face is ...
research
01/31/2022

Lessons from the AdKDD'21 Privacy-Preserving ML Challenge

Designing data sharing mechanisms providing performance and strong priva...
research
08/01/2018

Off-Policy Evaluation and Learning from Logged Bandit Feedback: Error Reduction via Surrogate Policy

When learning from a batch of logged bandit feedback, the discrepancy be...
research
10/23/2016

Cross Device Matching for Online Advertising with Neural Feature Ensembles : First Place Solution at CIKM Cup 2016

We describe the 1st place winning approach for the CIKM Cup 2016 Challen...

Please sign up or login with your details

Forgot password? Click here to reset