# Action-Centered Causal Bandits for Budget-Constrained Promotion Targeting

DevFeed: [Action-Centered Causal Bandits for Budget-Constrained Promotion Targeting](<https://devfeed.tech/articles/action-centered-causal-bandits-for-budget-constrained-promotion-targeting-123336.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.08990>)

Author: Yifan Lin, Kaixu Yang, Di Mo

Published: 2026-11-09T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [causality](<https://devfeed.tech/topics/causality.md>), [thompson sampling](<https://devfeed.tech/topics/thompson-sampling.md>)

Tags: [bandits](<https://devfeed.tech/tags/bandits.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [bias](<https://devfeed.tech/tags/bias.md>), [budget](<https://devfeed.tech/tags/budget.md>), [contextual-bandits](<https://devfeed.tech/tags/contextual-bandits.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [effect](<https://devfeed.tech/tags/effect.md>), [offline](<https://devfeed.tech/tags/offline.md>), [online](<https://devfeed.tech/tags/online.md>), [promotion](<https://devfeed.tech/tags/promotion.md>)

## AI overview

DR-CATE-CBwK targets incremental outcomes under a global intervention budget by learning treatment contrasts directly, avoiding the added statistical complexity of modeling a nonlinear action-independent outcome baseline. It warm-starts with an offline doubly robust learner, updates contrasts online with an estimator that remains unbiased under any predictable baseline estimate without inverse-propensity weighting, and uses a primal-dual controller with an affordable-action rule to enforce the effective-cost budget pathwise. For linear CATEs in a stationary i.i.d. setting, the paper proves high-probability regret of Õ(Kd√T). On a semi-synthetic job-marketplace benchmark, its Thompson-restricted variant had the lowest regret among evaluated budget-feasible methods in the operating regime, reducing regret by about 20% versus the strongest reward-based baseline without exceeding the effective-cost budget. The abstract also reports that a specified separate-arm reward regression can have asymptotic contrast bias under action-dependent logging and shared-baseline misspecification.

## Source excerpt

arXiv:2611.08990v1 Announce Type: new Abstract: Web platforms select among costly interventions for each user to maximize incremental outcomes under a global budget. We formulate this problem as a budget-constrained contextual bandit with heterogeneous treatment effects. Although an action-independent outcome baseline cancels from treatment comparisons, modeling a nonlinear baseline can increase statistical complexity. We propose DR-CATE-CBwK, an action-centered causal bandit that directly learns treatment contrasts. Its online update remains valid under baseline-model misspecification without inverse-propensity weighting. It combines an offline doubly robust learner to warm-start treatment-effect estimates, an online action-centered estimator for sequential contrast learning, and a primal-dual controller with an affordable-action rule to enforce the effective-cost budget pathwise. For linear conditional average treatment effects (CATEs) in a stationary i.i.d. setting, we prove a high-probability (\widetilde{O}(Kd\sqrt{T})) regret bound, where K is the number of priced actions, d the context dimension, and T the horizon. We benchmark against the fluid linear program (LP) under the coverage-guaranteed action rule. We further show that the action-centered estimating moment remains unbiased under any predictable baseline estimate, whereas a specified separate-arm reward regression can exhibit asymptotic contrast bias under action-dependent logging and shared-baseline misspecification. On a semi-synthetic job-marketplace benchmark with real logged features and simulated outcomes, our practical Thompson-restricted variant achieves the lowest regret among evaluated budget-feasible methods in the operating regime. It reduces regret by approximately 20% versus the strongest reward-based baseline, outperforming raw-reward contextual bandits, BwK baselines, and a static offline policy, while never exceeding the effective-cost budget.