资源分类
》 资源 》论文》Revenue Optimization with Approximate Bid Predictions

Revenue Optimization with Approximate Bid Predictions

2020-02-10 | |  233 |   46 |   0

Abstract 

In the context of advertising auctions, finding good reserve prices is a notoriously challenging learning problem. This is due to the heterogeneity of ad opportunity types, and the non-convexity of the objective function. In this work, we show how to reduce reserve price optimization to the standard setting of prediction under squared loss, a well understood problem in the learning community. We further bound the gap between the expected bid and revenue in terms of the average loss of the predictor. This is the first result that formally relates the revenue gained to the quality of a standard machine learned model.

上一篇：Clustering Stable Instances of Euclidean k-means

下一篇：Learning spatiotemporal piecewise-geodesic trajectories from longitudinal manifold-valued data

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...