Demystifying Advertising Campaign Bid Recommendation: A Constraint target CPA Goal Optimization

• URL: http://arxiv.org/abs/2212.13915v1
• Date: Mon, 26 Dec 2022 07:43:26 GMT
• Title: Demystifying Advertising Campaign Bid Recommendation: A Constraint target CPA Goal Optimization
• Authors: Deguang Kong, Konstantin Shmakov and Jian Yang
• Abstract summary: This paper presents a bid optimization scenario to achieve the desired cost-per-acquisition (tCPA) goals for advertisers. We build the optimization engine to make a decision by solving the rigorously formalized constrained optimization problem. The proposed model can naturally recommend the bid that meets the advertisers' expectations by making inference over advertisers' historical auction behaviors.
• Score: 19.857681941728597
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In cost-per-click (CPC) or cost-per-impression (CPM) advertising campaigns, advertisers always run the risk of spending the budget without getting enough conversions. Moreover, the bidding on advertising inventory has few connections with propensity one that can reach to target cost-per-acquisition (tCPA) goals. To address this problem, this paper presents a bid optimization scenario to achieve the desired tCPA goals for advertisers. In particular, we build the optimization engine to make a decision by solving the rigorously formalized constrained optimization problem, which leverages the bid landscape model learned from rich historical auction data using non-parametric learning. The proposed model can naturally recommend the bid that meets the advertisers' expectations by making inference over advertisers' historical auction behaviors, which essentially deals with the data challenges commonly faced by bid landscape modeling: incomplete logs in auctions, and uncertainty due to the variation and fluctuations in advertising bidding behaviors. The bid optimization model outperforms the baseline methods on real-world campaigns, and has been applied into a wide range of scenarios for performance improvement and revenue liftup.

Related papers

• A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints [54.46126953873298]
  We address the problem of dynamically pricing complementary items that are sequentially displayed to customers. Coherent pricing policies for complementary items are essential because optimizing the pricing of each item individually is ineffective. We empirically evaluate our approach using synthetic settings randomly generated from real-world data, and compare its performance in terms of constraints violation and regret.
  arXiv  Detail & Related papers  (2024-07-08T09:55:31Z)
• Structured Dynamic Pricing: Optimal Regret in a Global Shrinkage Model [50.06663781566795]
  We consider a dynamic model with the consumers' preferences as well as price sensitivity varying over time. We measure the performance of a dynamic pricing policy via regret, which is the expected revenue loss compared to a clairvoyant that knows the sequence of model parameters in advance. Our regret analysis results not only demonstrate optimality of the proposed policy but also show that for policy planning it is essential to incorporate available structural information.
  arXiv  Detail & Related papers  (2023-03-28T00:23:23Z)
• Do not Waste Money on Advertising Spend: Bid Recommendation via Concavity Changes [19.857681941728597]
  In computational advertising, a challenging problem is how to recommend a bid for advertisers to achieve the best return on investment. This paper presents the concavity given budget constraint scenario that changes in click revenue.
  arXiv  Detail & Related papers  (2022-12-26T08:32:41Z)
• Adaptive Risk-Aware Bidding with Budget Constraint in Display Advertising [47.14651340748015]
  We propose a novel adaptive risk-aware bidding algorithm with budget constraint via reinforcement learning. We theoretically unveil the intrinsic relation between the uncertainty and the risk tendency based on value at risk (VaR)
  arXiv  Detail & Related papers  (2022-12-06T18:50:09Z)
• Risk-Aware Bid Optimization for Online Display Advertisement [9.255311854574915]
  This research focuses on the bid optimization problem in the real-time bidding setting for online display advertisements. We propose a risk-aware data-driven bid optimization model that maximizes the expected profit for the advertiser.
  arXiv  Detail & Related papers  (2022-10-28T02:14:33Z)
• A Unified Framework for Campaign Performance Forecasting in Online Display Advertising [9.005665883444902]
  Interpretable and accurate results could enable advertisers to manage and optimize their campaign criteria. New framework reproduces campaign performance on historical logs under various bidding types with a unified replay algorithm. Method captures mixture calibration patterns among related forecast indicators to map the estimated results to the true ones.
  arXiv  Detail & Related papers  (2022-02-24T03:04:29Z)
• Bid Optimization using Maximum Entropy Reinforcement Learning [0.3149883354098941]
  This paper focuses on optimizing a single advertiser's bidding strategy using reinforcement learning (RL) in real-time bidding (RTB) We first utilize a widely accepted linear bidding function to compute every impression's base price and optimize it by a mutable adjustment factor derived from the RTB auction environment. Finally, the empirical study on a public dataset demonstrates that the proposed bidding strategy has superior performance compared with the baselines.
  arXiv  Detail & Related papers  (2021-10-11T06:53:53Z)
• Mid-flight Forecasting for CPA Lines in Online Advertising [6.766999405722559]
  This paper investigates the forecasting problem for CPA lines in the middle of the flight. The proposed methodology generates relationships between various key performance metrics and optimization signals. The relationship between advertiser spends and effective Cost Per Action(eCPA) is also characterized.
  arXiv  Detail & Related papers  (2021-07-15T17:48:15Z)
• A Cooperative-Competitive Multi-Agent Framework for Auto-bidding in Online Advertising [53.636153252400945]
  We propose a general Multi-Agent reinforcement learning framework for Auto-Bidding, namely MAAB, to learn the auto-bidding strategies. Our approach outperforms several baseline methods in terms of social welfare and guarantees the ad platform's revenue.
  arXiv  Detail & Related papers  (2021-06-11T08:07:14Z)
• Dynamic Knapsack Optimization Towards Efficient Multi-Channel Sequential Advertising [52.3825928886714]
  We formulate the sequential advertising strategy optimization as a dynamic knapsack problem. We propose a theoretically guaranteed bilevel optimization framework, which significantly reduces the solution space of the original optimization space. To improve the exploration efficiency of reinforcement learning, we also devise an effective action space reduction approach.
  arXiv  Detail & Related papers  (2020-06-29T18:50:35Z)
• MoTiAC: Multi-Objective Actor-Critics for Real-Time Bidding [47.555870679348416]
  We propose a Multi-ecTive Actor-Critics algorithm named MoTiAC for the problem of bidding optimization with various goals. Unlike previous RL models, the proposed MoTiAC can simultaneously fulfill multi-objective tasks in complicated bidding environments.
  arXiv  Detail & Related papers  (2020-02-18T07:16:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.