mlsanityData to 7 Oct 2026

Revenue Optimization with Approximate Bid Predictions

arXiv 1706.04732 ↗First posted 15 Jun 2017cs.LG cs.GTcited by 21

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 21 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Jun 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 7; 2022: 8; 2023: 1; 2024: 4; 2025: 0; 2026: 1.

21 papers.

Sort: