
TT
Tomoka Takei, Shunnosuke Ikeda, Yuichi Takano
· 1 min read
ResearcharXiv cs.LG
Optimal Multi-way Decision Trees for Stratified Sampling in Online Controlled Experiments
arXiv:2609.23308v1 Announce Type: new
Abstract: Online controlled experiments, or A/B tests, are widely used to estimate causal effects on digital platforms. A central challenge is to improve experimental sensitivity, or statistical power, without increasing the experimental sample size. Stratified sampling is a classical variance reduction technique; however, its effectiveness depends critically on how the strata are constructed. We thus propose an optimization-based stratification framework for stratified sampling using optimal multi-way decision trees. Our method, called Optimal Multi-way Stratification Trees (OMST), formulates stratification as a path-selection problem over a feature graph. The selected paths define interpretable stratification rules and are optimized using an exact variance-minimizing binary optimization formulation under continuous proportional allocation and a Neyman-type optimal allocation. We incorporate supervised optimal binning to generate outcome-relevant candidate splits for numerical features. Furthermore, we introduce reduction procedures for redundant candidate paths and assignment constraints, substantially reducing the optimization problem size. Experiments on both a real-world and a simulated dataset demonstrate that OMST achieves comparable or superior variance reduction to existing methods while maintaining shallow and interpretable stratification trees.
Original source
This story was published by arXiv cs.LG and written by Tomoka Takei, Shunnosuke Ikeda, Yuichi Takano. SyncAI.news shows a preview; the complete article is on the publisher's site.
Read the full story on arxiv.org


