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 right granularity level before training a learning algorithm. We call this the label attribution problem. In this paper, we develop an approach to the label attribution problem which is both theoretically justified and practical. We dub our solution the robust label attribution because it satisfies several desirable properties, including distributional robustness. Moreover, we develop a fixed point algorithm that allows for large scale implementation and showcase our solution using a large scale publicly available dataset from Criteo, a large Demand Side Platform.
翻译:大部分显示式广告库存都是通过实时拍卖出售的。 这些拍卖的参与者通常是以广告商名义参与的投标人(Google、Criteo、RTB House、Trading Desk等),为了估计每个展示机会的价值,他们通常使用历史数据来培训先进的机器学习算法。在标签培训组中,输入的内容是代表每个显示机会的特性的矢量,标签是产生的奖励。在实践中,奖赏是由广告商给予的,与某一用户转换与否挂钩。因此,奖赏是在用户一级汇总的,在展示一级从未看到过。我们最了解的一个基本任务就是在培训学习算法之前说明这种不匹配和分裂或属性,在正确的颗粒度一级作出奖励。我们称之为标签归属问题。在本文中,我们开发了一种标签归属问题的方法,既理论上合理,又实际可行。我们将稳健的标签归属作为解决办法,因为它满足了包括分配稳健性在内的一些理想属性。此外,我们从我们所知的最好程度来看,一个基本任务是说明这种不匹配的、分裂或属性,我们从大规模地平方算出一个大比例的固定点数据展示,从而可以大规模地进行大规模的执行。