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.01036v2

Help | Advanced Search

Statistics > Methodology

arXiv:2407.01036v2 (stat)
[Submitted on 1 Jul 2024 (v1) , revised 2 Dec 2024 (this version, v2) , latest version 20 Aug 2025 (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 testers that conduct large-scale tests often prioritize lifts as the main outcome metric and want to be able to control costs resulting from false rejections of the null. This work develops a decision-theoretic framework for maximizing profits subject to false discovery rate (FDR) control. We build an empirical Bayes solution for the problem via a greedy knapsack approach. We derive an oracle rule based on ranking the ratio of expected lifts and the cost of wrong rejections using the local false discovery rate (lfdr) statistic. Our oracle decision rule is valid and optimal for large-scale tests. Further, we establish asymptotic validity for the data-driven procedure and demonstrate finite-sample validity in experimental studies. We also demonstrate the merit of the proposed method over other FDR control methods. Finally, we discuss an application to data collected by experiments on the Optimizely platform.
Abstract: 从事大规模测试的A/B测试人员通常会优先考虑提升作为主要的结果指标,并希望能够控制因错误拒绝零假设而导致的成本。 本文开发了一种基于决策论的框架,用于在控制虚假发现率(FDR)的同时最大化利润。 我们通过贪婪背包方法为该问题构建了一个经验贝叶斯解决方案。 我们基于局部虚假发现率(lfdr)统计量,推导出一个基于预期提升与错误拒绝成本比率排序的最优规则。 我们的最优决策规则在大规模测试中是有效的且是最优的。 此外,我们证明了数据驱动过程的渐近有效性,并在实验研究中展示了有限样本的有效性。 我们还展示了所提出的方法相对于其他FDR控制方法的优势。 最后,我们讨论了该方法在Optimizely平台实验收集的数据中的应用。
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.01036v2 [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号