mlsanityData to 7 Oct 2026

Ranking Policy Learning via Marketplace Expected Value Estimation From Observational Data

arXiv 2410.04568 ↗First posted 6 Oct 2024cs.IR cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We develop a decision making framework to cast the problem of learning a ranking policy for search or recommendation engines in a two-sided e-commerce marketplace as an expected reward optimization problem using observational data. As a value allocation mechanism, the ranking policy allocates retrieved items to the designated slots so as to maximize the user utility from the slotted items, at any given stage of the shopping journey. The objective of this allocation can in turn be defined with respect to the underlying probabilistic user browsing model as the expected number of interaction events on presented items matching the user intent, given the ranking context. Through recognizing the effect of ranking as an intervention action to inform users' interactions with slotted items and the corresponding economic value of the interaction events for the marketplace, we formulate the expected reward of the marketplace as the collective value from all presented ranking actions. The key element in this formulation is a notion of context value distribution, which signifies not only the attribution of value to ranking interventions within a session but also the distribution of marketplace reward across user sessions. We build empirical estimates for the expected reward of the marketplace from observational data that account for the heterogeneity of economic value across session contexts as well as the distribution shifts in learning from observational user activity data. The ranking policy can then be trained by optimizing the empirical expected reward estimates via standard Bayesian inference techniques. We report empirical results for a product search ranking task in a major e-commerce platform demonstrating the fundamental trade-offs governed by ranking polices trained on empirical reward estimates with respect to extreme choices of the context value distribution.

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

Builds on

10 of 36 references.

References · 10

  1. 2016Recommendations as Treatments: Debiasing Learning and Evaluationcited by 246
  2. 2018Top-K Off-Policy Correction for a REINFORCE Recommender Systemcited by 181
  3. 2018Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Ratecited by 172
  4. 2016Unbiased Learning-to-Rank with Biased Feedbackcited by 155
  5. 2022ESCM2: Entire Space Counterfactual Multi-Task Model for Post-Click Conversion Rate Estimationcited by 47
  6. 2018Reinforcement Learning to Rank in E-Commerce Search Engine: Formalization, Analysis, and Applicationcited by 33
  7. 2014Sequential Click Prediction for Sponsored Search with Recurrent Neural Networkscited by 21
  8. 2018The Deconfounded Recommender: A Causal Inference Approach to Recommendationcited by 19
  9. 2022Doubly-Robust Estimation for Correcting Position-Bias in Click Feedback for Unbiased Learning to Rankcited by 17
  10. 2021An Analysis Of Entire Space Multi-Task Models For Post-Click Conversion Predictioncited by 5

Built on by

Not cited yet.