paper-with-me

Papers

Variance Reduction in Bipartite Experiments through Correlation Clustering

2019-12-01 · NeurIPS 2019 12 · Jean Pouget-Abadie, Kevin Aydin, Warren Schudy, Kay Brodersen, Vahab Mirrokni

Causal inference in randomized experiments typically assumes that the units of randomization and the units of analysis are one and the same. In some applications, however, these two roles are played by distinct entities linked by a bipartite graph. The key challenge in such bipartite settings is how to avoid interference bias, which would typically arise if we simply randomized the treatment at the level of analysis units. One effective way of minimizing interference bias in standard experiments is through cluster randomization, but this design has not been studied in the bipartite setting where conventional clustering schemes can lead to poorly powered experiments. This paper introduces a novel clustering objective and a corresponding algorithm that partitions a bipartite graph so as to maximize the statistical power of a bipartite experiment on that graph. Whereas previous work relied on balanced partitioning, our formulation suggests the use of a correlation clustering objective. We use a publicly-available graph of Amazon user-item reviews to validate our solution and illustrate how it substantially increases the statistical power in bipartite experiments.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Causal InferenceClustering

Similar Papers 제목 키워드 기반

Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs

2020-02-21 · Nate Veldt, Anthony Wirth, David F. Gleich

Motivated by applications in community detection and dense subgraph discovery, we consider new clustering objectives in hypergraphs and bipartite graphs. These objectives are parameterized by one or more resolution param…

ClusteringCommunity DetectionGraph Clustering

Online Variance Reduction for Domain Adaptation on Streaming Data

2026-07-22 · Andrea Napoli arxiv

This paper studies the problem of stochastic variance reduction (SVR) for the maximum mean discrepancy (MMD) and correlation alignment (CORAL) loss functions. Although various offline SVR algorithms for these losses have…

Incremental LearningDomain Adaptation

Learning the generating functional for variance reduction in lattice QCD

2026-06-14 · Ryan Abbott, Yang Fu, Daniel C. Hackett, Gurtej Kanwar 외 arxiv

The generating functional in quantum field theory provides the natural framework for constructing correlation functions as derivatives with respect to source operators. We present a methodology that leverages machine-lea…

Variance reduction combining pre-experiment and in-experiment data

2024-10-11 · Zhexiao Lin, Pablo Crespo

Online controlled experiments (A/B testing) are essential in data-driven decision-making for many companies. Increasing the sensitivity of these experiments, particularly with a fixed sample size, relies on reducing the …

Decision MakingSensitivity

STATE: A Robust ATE Estimator of Heavy-Tailed Metrics for Variance Reduction in Online Controlled Experiments

2024-07-23 · Hao Zhou, Kun Sun, Shaoming Li, Yangfeng Fan 외

Online controlled experiments play a crucial role in enabling data-driven decisions across a wide range of companies. Variance reduction is an effective technique to improve the sensitivity of experiments, achieving high…