Reducing Symbiosis Bias Through Better A/B Tests of Recommendation Algorithms
Not on the map. Why?
Abstract (arXiv)
It is increasingly common in digital environments to use A/B tests to compare the performance of recommendation algorithms. However, such experiments often violate the stable unit treatment value assumption (SUTVA), particularly SUTVA's "no hidden treatments" assumption, due to the shared data between algorithms being compared. This results in a novel form of bias, which we term "symbiosis bias," where the performance of each algorithm is influenced by the training data generated by its competitor. In this paper, we investigate three experimental designs--cluster-randomized, data-diverted, and user-corpus co-diverted experiments--aimed at mitigating symbiosis bias. We present a theoretical model of symbiosis bias and simulate the impact of each design in dynamic recommendation environments. Our results show that while each design reduces symbiosis bias to some extent, they also introduce new challenges, such as reduced training data in data-diverted experiments. We further validate the existence of symbiosis bias using data from a large-scale A/B test conducted on a global recommender system, demonstrating that symbiosis bias affects treatment effect estimates in the field. Our findings provide actionable insights for researchers and practitioners seeking to design experiments that accurately capture algorithmic performance without bias in treatment effect estimates introduced by shared data.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). First posted on arXiv 13 Sep 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 3; 2026: 4.
8 papers.
- 2025Double Machine Learning for Causal Inference under Shared-State Interferencecited by 4
- 2025Choosing the Better Bandit Algorithm under Data Sharing: When Do A/B Experiments Work?cited by 4
- 2023Tackling Interference Induced by Data Training Loops in A/B Tests: A Weighted Training Approachcited by 3
- 2025Bias Mitigation for AI-Feedback Loops in Recommender Systems: A Systematic Literature Review and Taxonomycited by 1
- 2026Design Experiments to Compare Multi-armed Bandit Algorithmscited by 1
- 2026Fast A/B/n Testing: Exact Multi-Policy Comparison via Tree-Coupled Feedback Sharingcited by 0
- 2026Content Exploration Beyond the Feed: Creator Supply and the Shared Corpuscited by 0
- 2026BAFF: Bid-Aware Filter Family for Mitigating Training Data Interference in RTB A/B Testscited by 0
- 2026BAFF: Bid-Aware Filter Family for Mitigating Training Data Interference in RTB A/B Tests8 Sep 2026
- 2026Content Exploration Beyond the Feed: Creator Supply and the Shared Corpus29 Aug 2026
- 2026Fast A/B/n Testing: Exact Multi-Policy Comparison via Tree-Coupled Feedback Sharing13 Aug 2026
- 2026Design Experiments to Compare Multi-armed Bandit Algorithms6 Mar 2026
- 2025Bias Mitigation for AI-Feedback Loops in Recommender Systems: A Systematic Literature Review and Taxonomy28 Aug 2025
- 2025Choosing the Better Bandit Algorithm under Data Sharing: When Do A/B Experiments Work?16 Jul 2025
- 2025Double Machine Learning for Causal Inference under Shared-State Interference10 Apr 2025
- 2023Tackling Interference Induced by Data Training Loops in A/B Tests: A Weighted Training Approach26 Oct 2023