Abstract:Treatment allocation under budget constraints is a central challenge in digital advertising: advertisers must decide which users to show ads to while spending a limited budget wisely. The standard approach follows a two-stage offline pipeline - first collect historical data to estimate heterogeneous treatment effects (HTE), then solve a constrained optimization to allocate the budget. This works well with abundant data, but fails in cold-start settings such as new campaigns, new markets, or new customer segments where little historical data exists. We propose Budget-Constrained Causal Bandits (BCCB), an online framework that learns which users respond to ads while simultaneously spending the budget, making treatment decisions one user at a time. BCCB unifies three components into a single sequential process: learning individual-level ad effectiveness, exploring users whose response is uncertain, and pacing the budget over time. We evaluated on the Criteo Uplift dataset, a large-scale advertising dataset from a real randomized controlled trial. Our key finding is a data-efficiency crossover: offline methods require approximately 10,000 historical observations to produce reliable results, while BCCB operates effectively from the very first user. Furthermore, BCCB exhibits 3-5x lower performance variance between runs, making it more practical for real campaign planning. Among purely online methods, BCCB consistently outperforms standard Thompson Sampling, budgeted Thompson Sampling, and greedy HTE estimation across all budget levels tested.
| Comments: | 12 pages, 2 figures, preprint |
| Subjects: | Machine Learning (cs.LG); Econometrics (econ.EM); Machine Learning (stat.ML) |
| Cite as: | arXiv:2604.26169 [cs.LG] |
| (or arXiv:2604.26169v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2604.26169 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Abhirami Pillai [view email]
[v1]
Tue, 28 Apr 2026 23:24:26 UTC (487 KB)