mlsanityData to 14 Oct 2026

Do not Waste Money on Advertising Spend: Bid Recommendation via Concavity Changes

arXiv 2212.13923 ↗First posted 26 Dec 2022cs.IR cs.AI cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

In computational advertising, a challenging problem is how to recommend the bid for advertisers to achieve the best return on investment (ROI) given budget constraint. This paper presents a bid recommendation scenario that discovers the concavity changes in click prediction curves. The recommended bid is derived based on the turning point from significant increase (i.e. concave downward) to slow increase (convex upward). Parametric learning based method is applied by solving the corresponding constraint optimization problem. Empirical studies on real-world advertising scenarios clearly demonstrate the performance gains for business metrics (including revenue increase, click increase and advertiser ROI increase).

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 8 of its 29 references that are in the map. First posted on arXiv 26 Dec 2022.

Builds on

8 of 29 references.

References · 8

  1. 2017Real-Time Bidding by Reinforcement Learning in Display Advertisingcited by 91
  2. 2017Optimized Cost per Click in Taobao Display Advertisingcited by 57
  3. 2016Feedback Control of Real-Time Display Advertisingcited by 22
  4. 2017Profit Maximization for Online Advertising Demand-Side Platformscited by 9
  5. 2015Lift-Based Bidding in Ad Selectioncited by 8
  6. 2015Optimal Real-Time Bidding Strategiescited by 8
  7. 2016A Field Guide to Personalized Reserve Pricescited by 6
  8. 2017Managing Risk of Bidding in Display Advertisingcited by 5

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.