mlsanityData to 14 Oct 2026

Model-Free Approximate Bayesian Learning for Large-Scale Conversion Funnel Optimization

arXiv 2401.06710 ↗First posted 12 Jan 2024cs.LG cs.IRcited by 0

Not on the map. Why?

Abstract (arXiv)

The flexibility of choosing the ad action as a function of the consumer state is critical for modern-day marketing campaigns. We study the problem of identifying the optimal sequential personalized interventions that maximize the adoption probability for a new product. We model consumer behavior by a conversion funnel that captures the state of each consumer (e.g., interaction history with the firm) and allows the consumer behavior to vary as a function of both her state and firm's sequential interventions. We show our model captures consumer behavior with very high accuracy (out-of-sample AUC of over 0.95) in a real-world email marketing dataset. However, it results in a very large-scale learning problem, where the firm must learn the state-specific effects of various interventions from consumer interactions. We propose a novel attribution-based decision-making algorithm for this problem that we call model-free approximate Bayesian learning. Our algorithm inherits the interpretability and scalability of Thompson sampling for bandits and maintains an approximate belief over the value of each state-specific intervention. The belief is updated as the algorithm interacts with the consumers. Despite being an approximation to the Bayes update, we prove the asymptotic optimality of our algorithm and analyze its convergence rate. We show that our algorithm significantly outperforms traditional approaches on extensive simulations calibrated to a real-world email marketing dataset.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 53 references that are in the map. First posted on arXiv 12 Jan 2024.

Builds on

7 of 53 references.

References · 7

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  2. 2018Is Q-learning Provably Efficient?cited by 487
  3. 2013(More) Efficient Reinforcement Learning via Posterior Samplingcited by 233
  4. 2015Contextual Markov Decision Processescited by 220
  5. 2020Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reductioncited by 95
  6. 2019Stochastic approximation with cone-contractive operators: Sharp ℓ_∞-bounds for Q-learningcited by 77
  7. 2017Learning Unknown Markov Decision Processes: A Thompson Sampling Approachcited by 65

Built on by

Not cited yet.