Online ad platforms offer budget management tools for advertisers that aim to maximize the number of conversions given a budget constraint. As the volume of impressions, conversion rates and prices vary over time, these budget management systems learn a spend plan (to find the optimal distribution of budget over time) and run a pacing algorithm which follows the spend plan. This paper considers two models for impressions and competition that varies with time: a) an episodic model which exhibits stationarity in each episode, but each episode can be arbitrarily different from the next, and b) a model where the distributions of prices and values change slowly over time. We present the first learning theoretic guarantees on both the accuracy of spend plans and the resulting end-to-end budget management system. We present four main results: 1) for the episodic setting we give sample complexity bounds for the spend rate prediction problem: given $n$ samples from each episode, with high probability we have $|\widehat{\rho}_e - \rho_e| \leq \tilde{O}(\frac{1}{n^{1/3}})$ where $\rho_e$ is the optimal spend rate for the episode, $\widehat{\rho}_e$ is the estimate from our algorithm, 2) we extend the algorithm of Balseiro and Gur (2017) to operate on varying, approximate spend rates and show that the resulting combined system of optimal spend rate estimation and online pacing algorithm for episodic settings has regret that vanishes in number of historic samples $n$ and the number of rounds $T$, 3) for non-episodic but slowly-changing distributions we show that the same approach approximates the optimal bidding strategy up to a factor dependent on the rate-of-change of the distributions and 4) we provide experiments showing that our algorithm outperforms both static spend plans and non-pacing across a wide variety of settings.
翻译:在线广告平台为广告商提供预算管理工具, 目的是在预算限制下最大限度地增加转换数量。 由于印象、 换算率和价格随时间变化而变化, 这些预算管理系统会学习一个支出计划( 寻找长期预算的最佳分配方法), 并遵循支出计划进行一个节奏算法。 本文考虑了两种印象和竞争模式, 并随时间而变化: a) 一个在每集中表现出静态, 但每一集都可能与下集任意不同, b) 一个价格和价值分配缓慢变化的模式。 我们第一次学习关于支出计划的准确性以及由此产生的端到端预算管理系统。 我们提出四个主要结果: 1) 用于确定支出率预测问题的样本复杂性: 给每集一集的美元样本, 高概率是, 我们的全局成本 - rcredicle discoal, 并且 成本- lequal disal disqual disal discoal dies a lable lax, lax drode the lax proal deal deal disal dal dal dal disal dal dal dal dal dal dal dal pal dal 和我们整个成本 美元 ex 和美元 ex 和美元的汇率 ex ex ex lax lax 美元, ex ex the ex the ex the ex ex ex ex ex lauts a lauts lauts lauts lad lad we lad lad 美元, 美元, 美元, lad laut the 美元, 我们 美元, 美元, 我们 美元 美元 lax lax lax la la 和美元 和美元 和美元 和美元, ex sal disl ex sal labal exal disal d lad 和美元 labal lad sal lad lad ladal d ladal dal dal dal dal dal dald lad ladaldaldaldal 美元, ladal 美元, las la 美元, lad