mlsanityData to 7 Oct 2026

PASTO: Strategic Parameter Optimization in Recommendation Systems -- Probabilistic is Better than Deterministic

arXiv 2108.09076 ↗First posted 20 Aug 2021cs.LG cs.IRcited by 0

Not on the map. Why?

Abstract (arXiv)

Real-world recommendation systems often consist of two phases. In the first phase, multiple predictive models produce the probability of different immediate user actions. In the second phase, these predictions are aggregated according to a set of 'strategic parameters' to meet a diverse set of business goals, such as longer user engagement, higher revenue potential, or more community/network interactions. In addition to building accurate predictive models, it is also crucial to optimize this set of 'strategic parameters' so that primary goals are optimized while secondary guardrails are not hurt. In this setting with multiple and constrained goals, this paper discovers that a probabilistic strategic parameter regime can achieve better value compared to the standard regime of finding a single deterministic parameter. The new probabilistic regime is to learn the best distribution over strategic parameter choices and sample one strategic parameter from the distribution when each user visits the platform. To pursue the optimal probabilistic solution, we formulate the problem into a stochastic compositional optimization problem, in which the unbiased stochastic gradient is unavailable. Our approach is applied in a popular social network platform with hundreds of millions of daily users and achieves +0.22% lift of user engagement in a recommendation task and +1.7% lift in revenue in an advertising optimization scenario comparing to using the best deterministic parameter strategy.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 13 of its 36 references that are in the map. First posted on arXiv 20 Aug 2021.

Builds on

13 of 36 references.

References · 13

  1. 2018Variational Autoencoders for Collaborative Filteringcited by 308
  2. 2020Differentiable Expected Hypervolume Improvement for Parallel Multi-Objective Bayesian Optimizationcited by 176
  3. 2018Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Ratecited by 172
  4. 2017Deep Learning based Recommender System: A Survey and New Perspectivescited by 136
  5. 2017Constrained Bayesian Optimization with Noisy Experimentscited by 103
  6. 2014Stochastic Compositional Gradient Descent: Algorithms for Minimizing Compositions of Expected-Value Functionscited by 93
  7. 2020Max-value Entropy Search for Multi-Objective Bayesian Optimization with Constraintscited by 81
  8. 2019Multi-objective Bayesian Optimization using Pareto-frontier Entropycited by 57
  9. 2016Accelerating Stochastic Composition Optimizationcited by 46
  10. 2018An Efficient Bandit Algorithm for Realtime Multivariate Optimizationcited by 34
  11. 2019Multi-Gradient Descent for Multi-Objective Recommender Systemscited by 20
  12. 2020Contextual User Browsing Bandits for Large-Scale Online Mobile Recommendationcited by 8
1 more
  1. 2019Value-aware Recommendation based on Reinforced Profit Maximization in E-commerce Systemscited by 7

Built on by

Not cited yet.