Skip to content
Book Open access

Precision at Scale: An End-to-End Graph-based Framework for Mitigating Network Interference in TikTok A/B Tests

Jul 2026 · Annual International ACM SIGIR Conference on Research and Development in Information Retrieval · pp. 4727-4731 · 0 citations · 26 references
Computer Science

TL;DR

This paper presents a production-ready framework deployed at TikTok, which integrates three core contributions to address the challenges of large-scale A/B tests on social platforms, and reduces interference rates by 68.8%, correcting a biased treatment effect estimate and enables previously undetectable cross-ecosystem measurements.

Abstract

Large-scale A/B tests on social platforms suffer from inherent network interference, violating the Stable Unit Treatment Value Assumption (SUTVA) and distorting measured results. Industrial practices for mitigating network interference face a foundational trade-off. For scalability, they often rely on clustering static graphs, which serve as imperfect proxies for true interference pathways. Conversely, theoretically sound methods remain computationally intractable at production scale. This paper presents a production-ready framework deployed at TikTok, which integrates three core contributions to address these challenges: 1) Learned Interference Graph (LIG): Estimates interference probabilities using dynamic interaction patterns for more context-aware modeling. 2) Scalable Community Partitioning (SCP): A Spark-optimized ParLeiden implementation that performs billion-node graph clustering daily and generalizes effectively across diverse interaction types, achieving a purity score of 0.898 for group chat interactions. 3) Sensitivity-Enhanced Estimation (SEE): A multivariate system leveraging Controlled-experiment Using Pre-Experiment Data (CUPED) to mitigate variance inflation from cluster-based randomization. In live production tests, our framework reduces interference rates by 68.8%, correcting a biased treatment effect estimate from +1.44% to a statistically significant +2.08%. It also enables previously undetectable cross-ecosystem measurements, revealing a +0.2% lift in creator upload volumes driven by user-side treatments.

Read PDF

Similar papers

Open access Sep 2026

SAC-Net: Structure-Aware Collaborative Network for Graph Similarity Computation

This study introduces an Edge-Aware Fusion mechanism that leverages edge features as a bridge to adaptively integrate global and local structural information, thereby effectively addressing the alignment and integration of multi-granularity semantics.

Ling-Han Zeng, Yan-Ling Li, Ming-Xia Bi et al. · 0 citations
Preprint Sep 2026

WCCS: Efficient Wedge Conductance Community Search over Large Temporal Bipartite Graphs (Full Paper)

An online priority-driven filter-and-expand framework with several effective pruning techniques and a powerful geometric slope optimization for rapid temporal wedge conductance calculation is developed and a novel temporal wedge conductance metric is proposed that explicitly balances internal density and external spars...

Long-Long Lin, Wei Chen, Ping-Peng Yuan et al. · 0 citations
Jul 2026

System-Wide Termination in Distributed Betweenness Centrality Computation

A lightweight, system-wide global termination detection algorithm that enables vertices to decide locally when the overall system has converged, and emphasises the need for coordinated halting in distributed centrality computation.

Siamak Abdi, Lucia Cavallaro, G. Di Fatta · 0 citations
#artificial intelligence Preprint Aug 2026

NICE: Scale-Stable Perturbations for Graph Neural Network Explanations via Noise Corruption

Noise Corruption is introduced, a Noise Corruption-based explanation framework, which perturbs each message through matched-norm random-direction corruption while preserving the expected squared message norm, and NICE, a Noise Corruption-based explanation framework, which learns a Stochastic Restoration Boundary under...

Ziluowen Luo, Jun Yin, Ruo-Chen Liu et al. · 0 citations
Conference Aug 2026

Operationalization Matters: When Graph-Aware Learning Adds Value for IC-Based Influence Approximation

Approximating Monte Carlo Independent Cascade (MC-IC) influence rankings with a learned surrogate is only meaningful if the target itself is clearly defined. We study this dependency on the Twitch Gamers graph under two IC operationalizations, keeping the graph, labeled-node sample, split, Monte Carlo budget, and evalu...

Dinh-Duy Tran, Q. Pham, Q. Tran et al. · 0 citations
Book Open access Aug 2026

When to Trust Whom: A Context-Aware Graph Routing Mechanism for Information Diffusion Prediction

CARD, a context-aware routing framework that replaces static fusion with step-wise evidence arbitration, is proposed, a context-aware routing framework that achieves state-of-the-art accuracy and stronger robustness.

Zi-Han Feng, Yajun Yang, Rui Wu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.