使用预测权重进行广告投放
Using Predicted Weights for Ad Delivery
摘要:
我们研究了一个比例权重算法的性能在线容量限制的二分匹配建模的印象广告的交付。该算法使用对广告商节点的预测,以与其邻居的权重成比例地匹配到达的印象节点。本文给出了一个彻底的实证研究的算法上的广告印象从雅虎的数据集的性能!并且与诸如贪婪注水算法和排序算法的自然基线相比,显示出其优越的性能。比例权重算法最近在理论文献中得到了关注,在理论文献中,它被证明具有超出预测增强算法的最坏情况模型的强保证。我们扩展这些结果的情况下,广告客户的能力不再是固定的随着时间的推移。此外,我们表明,该算法具有接近最佳性能的随机顺序到达模型时,印象和最佳匹配的数量足够大。
英文摘要:
We study the performance of a proportional weights algorithm for online capacitated bipartite matching modeling the delivery of impression ads. The algorithm uses predictions on the advertiser nodes to match arriving impression nodes fractionally in proportion to the weights of its neighbors. This paper gives a thorough empirical study of the performance of the algorithm on a data-set of ad impressions from Yahoo! and shows its superior performance compared to natural baselines such as a greedy water-filling algorithm and the ranking algorithm. The proportional weights algorithm has recently received interest in the theoretical literature where it was shown to have strong guarantees beyond the worst-case model of algorithms augmented with predictions. We extend these results to the case where the advertisers' capacities are no longer stationary over time. Additionally, we show the algorithm has near optimal performance in the random-order arrival model when the number of impressions and the optimal matching are sufficiently large.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。