Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > stat > arXiv:2407.01036v3

Help | Advanced Search

Statistics > Methodology

arXiv:2407.01036v3 (stat)
[Submitted on 1 Jul 2024 (v1) , last revised 20 Aug 2025 (this version, v3)]

Title: Ranking by Lifts: A Cost-Benefit Approach to Large-Scale A/B Tests

Title: 按提升排名:大规模A/B测试的成本效益方法

Authors:Pallavi Basu, Ron Berman
Abstract: A/B testing is a core tool for decision-making in business experimentation, particularly in digital platforms and marketplaces. Practitioners often prioritize lift in performance metrics while seeking to control the costs of false discoveries. This paper develops a decision-theoretic framework for maximizing expected profit subject to a constraint on the cost-weighted false discovery rate (FDR). We propose an empirical Bayes approach that uses a greedy knapsack algorithm to rank experiments based on the ratio of expected lift to cost, incorporating the local false discovery rate (lfdr) as a key statistic. The resulting oracle rule is valid and rank-optimal. In large-scale settings, we establish the asymptotic validity of a data-driven implementation and demonstrate superior finite-sample performance over existing FDR-controlling methods. An application to A/B tests run on the Optimizely platform highlights the business value of the approach.
Abstract: A/B测试是商业实验中用于决策的核心工具,特别是在数字平台和市场中。 从业者在寻求控制假发现成本的同时,通常优先考虑性能指标的提升。 本文开发了一个决策理论框架,在成本加权假发现率(FDR)约束下最大化预期利润。 我们提出了一种经验贝叶斯方法,使用贪心背包算法根据预期提升与成本的比率对实验进行排序,并将局部假发现率(lfdr)作为关键统计量。 所得的Oracle规则是有效且排名最优的。 在大规模情况下,我们建立了数据驱动实现的渐近有效性,并展示了在现有FDR控制方法中的优越有限样本表现。 在Optimizely平台上运行的A/B测试应用突显了该方法的商业价值。
Comments: Updated
Subjects: Methodology (stat.ME) ; Machine Learning (cs.LG); Applications (stat.AP); Machine Learning (stat.ML)
Cite as: arXiv:2407.01036 [stat.ME]
  (or arXiv:2407.01036v3 [stat.ME] for this version)
  https://doi.org/10.48550/arXiv.2407.01036
arXiv-issued DOI via DataCite

Submission history

From: Pallavi Basu [view email]
[v1] Mon, 1 Jul 2024 07:40:08 UTC (506 KB)
[v2] Mon, 2 Dec 2024 15:31:12 UTC (2,194 KB)
[v3] Wed, 20 Aug 2025 11:28:11 UTC (2,091 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
stat.ME
< prev   |   next >
new | recent | 2024-07
Change to browse by:
cs
cs.LG
stat
stat.AP
stat.ML

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号