论文标题
揭开广告活动竞标推荐建议:约束目标CPA目标优化
Demystifying Advertising Campaign Bid Recommendation: A Constraint target CPA Goal Optimization
论文作者
论文摘要
在单击成本(CPC)或按下费用(CPM)广告活动中,广告商总是冒着花费预算的风险,而无需进行足够的转换。此外,竞标广告清单与倾向的联系很少,可以达到目标成本(TCPA)目标。为了解决这个问题,本文提出了出价优化方案,以实现广告客户的所需TCPA目标。特别是,我们通过解决严格形式化的约束优化问题来构建优化引擎以做出决定,该问题利用了使用非参数学习从丰富的历史拍卖数据中学到的投标景观模型。提出的模型自然可以通过推断广告商的历史拍卖行为来符合广告商期望的投标,从本质上讲,该行为基本上涉及竞标景观建模所面临的数据挑战:拍卖中的不完整日志,以及由于广告投标行为的差异和波动而导致的不确定性。 BID优化模型的表现优于现实世界广告系列的基线方法,并已应用于各种方案,以改善绩效和收入。
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.