Exploiting Feature-invariant Scaling Laws for Efficient A/B Experimentation in Recommendation Systems
Researchers and engineers improve recommendation systems by performing A/B experiments with new model architectures, optimization methods, and data features. However, running full-scale experiments (e.g., full-model training with online data) for every feature change is prohibitively computationally intensive, while the result from a single small-scale experiment is often misleading. To address this challenge, we show that modern recommendation models exhibit feature-invariant scaling: the change of a model's performance follows a predictable scaling-law even when different feature changes are applied to the baseline model. We introduce an efficient method that exploits scaling-laws and uses statistical inference to predict (with confidence intervals) the full-scale effect of an A/B experiment in recommendation systems. This enables practitioners to efficiently filter out neutral or regressive feature changes with only small-scale experimentation. We validate our method on three distinct recommendation model families---Wukong, HSTU, and LLM-based recommendation models---across more than 40 architectural, optimization, and data changes. Our method accurately distinguishes…
Feature-invariant scaling laws for A/B testing in recommendation systems
- arXiv
- 2611.13539
- Authors
- Zhiliang Chen, Sammy Nammari, Jiahao Su, Xiaoqiang Luo
- Categories
- cs.IR · cs.LG