mlsanityData to 14 Oct 2026

BanditLP: Large-Scale Stochastic Optimization for Personalized Recommendations

arXiv 2601.15552 ↗First posted 22 Jan 2026cs.LG cs.AI stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

We present BanditLP, a scalable multi-stakeholder contextual bandit framework that unifies neural Thompson Sampling for learning objective-specific outcomes with a large-scale linear program for constrained action selection at serving time. The methodology is application-agnostic, compatible with arbitrary neural architectures, and deployable at web scale, with an LP solver capable of handling billions of variables. Experiments on public benchmarks and synthetic data show consistent gains over strong baselines. We apply this approach in LinkedIn's email marketing system and demonstrate business win, illustrating the value of integrated exploration and constrained optimization in production.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 21 of its 45 references that are in the map. First posted on arXiv 22 Jan 2026.

Builds on

21 of 45 references.

References · 21

  1. 2021Laplace Redux -- Effortless Bayesian Deep Learningcited by 365
  2. 2015Scalable Bayesian Optimization Using Deep Neural Networkscited by 284
  3. 2013Bandits with Knapsackscited by 164
  4. 2019Fairness-Aware Ranking in Search & Recommendation Systems with Application to LinkedIn Talent Searchcited by 138
  5. 2020Neural Thompson Samplingcited by 128
  6. 2019Linear Stochastic Bandits Under Safety Constraintscited by 90
  7. 2019'In-Between' Uncertainty in Bayesian Neural Networkscited by 80
  8. 2020Open Bandit Dataset and Pipeline: Towards Realistic and Reproducible Off-Policy Evaluationcited by 77
  9. 2019Combinatorial Sleeping Bandits with Fairness Constraintscited by 68
  10. 2021EE-Net: Exploitation-Exploration Neural Networks in Contextual Banditscited by 44
  11. 2017Multi-objective Bandits: Optimizing the Generalized Gini Indexcited by 28
  12. 2019Safe Linear Stochastic Banditscited by 27
9 more
  1. 2014A Neural Networks Committee for the Contextual Bandit Problemcited by 23
  2. 2017Multi-objective Contextual Multi-armed Bandit with a Dominant Objectivecited by 15
  3. 2023Long-Term Value of Exploration: Measurements, Findings and Algorithmscited by 13
  4. 2019Thompson Sampling for Contextual Bandit Problems with Auxiliary Safety Constraintscited by 10
  5. 2020Thompson Sampling for Linearly Constrained Banditscited by 3
  6. 2023Optimizing Scalable Targeted Marketing Policies with Constraintscited by 3
  7. 2021Efficient Vertex-Oriented Polytopic Projection for Web-scale Applicationscited by 2
  8. 2024Measuring Fairness in Large-Scale Recommendation Systems with Missing Labelscited by 1
  9. 2025Beyond Basic A/B testing: Improving Statistical Efficiency for Business Growthcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.