非线性反事实聚合优化
Non-Linear Counterfactual Aggregate Optimization
AI总结:
针对结果为多微小贡献总和的非线性函数直接优化难题,利用和的集中性质提出可扩展下降算法,可用于提升A/B测试达标概率等场景。
摘要:
我们研究直接优化某一结果的非线性函数的问题,该结果本身是大量微小贡献的总和。函数的非线性特性意味着该问题不等同于最大化个体贡献的期望。通过利用个体结果之和的集中性质,我们推导出一种可扩展的下降算法,可直接优化我们提出的目标。例如,这使得最大化A/B测试成功的概率成为可能,对此而言,瞄准成功标准(比如超过给定的提升量)比追求最高的期望收益更为明智。
英文摘要:
We consider the problem of directly optimizing a non-linear function of an outcome, where this outcome itself is the sum of many small contributions. The non-linearity of the function means that the problem is not equivalent to the maximization of the expectation of the individual contribution. By leveraging the concentration properties of the sum of individual outcomes, we derive a scalable descent algorithm that directly optimizes for our stated objective. This allows for instance to maximize the probability of successful A/B test, for which it can be wiser to target a success criterion, such as exceeding a given uplift, rather than chasing the highest expected payoff.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。