Online Learning for Non-Stationary A/B Tests
Andr\'es Mu\~noz Medina, Sergei Vassilvitskii, Dong Yin

TL;DR
This paper introduces FTBI, an online learning algorithm designed for non-stationary A/B testing environments, improving efficiency and accuracy over traditional methods by adapting to performance fluctuations.
Contribution
The paper presents a novel, practical algorithm for dynamic A/B testing that provides theoretical guarantees and outperforms existing methods in real-world and synthetic datasets.
Findings
FTBI outperforms current state-of-the-art methods in experiments.
The algorithm effectively adapts to non-stationary environments.
Rigorous theoretical guarantees support the approach.
Abstract
The rollout of new versions of a feature in modern applications is a manual multi-stage process, as the feature is released to ever larger groups of users, while its performance is carefully monitored. This kind of A/B testing is ubiquitous, but suboptimal, as the monitoring requires heavy human intervention, is not guaranteed to capture consistent, but short-term fluctuations in performance, and is inefficient, as better versions take a long time to reach the full population. In this work we formulate this question as that of expert learning, and give a new algorithm Follow-The-Best-Interval, FTBI, that works in dynamic, non-stationary environments. Our approach is practical, simple, and efficient, and has rigorous guarantees on its performance. Finally, we perform a thorough evaluation on synthetic and real world datasets and show that our approach outperforms current…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Data Stream Mining Techniques · Machine Learning and Data Classification
