mlsanityData to 14 Oct 2026

Entire-Space Variational Information Exploitation for Post-Click Conversion Rate Prediction

arXiv 2502.15687 ↗First posted 17 Dec 2024cs.IR cs.LGcited by 3

On the map: Knowledge distillation → Distillation for recommender systems

Abstract (arXiv)

In recommender systems, post-click conversion rate (CVR) estimation is an essential task to model user preferences for items and estimate the value of recommendations. Sample selection bias (SSB) and data sparsity (DS) are two persistent challenges for post-click conversion rate (CVR) estimation. Currently, entire-space approaches that exploit unclicked samples through knowledge distillation are promising to mitigate SSB and DS simultaneously. Existing methods use non-conversion, conversion, or adaptive conversion predictors to generate pseudo labels for unclicked samples. However, they fail to consider the unbiasedness and information limitations of these pseudo labels. Motivated by such analysis, we propose an entire-space variational information exploitation framework (EVI) for CVR prediction. First, EVI uses a conditional entire-space CVR teacher to generate unbiased pseudo labels. Then, it applies variational information exploitation and logit distillation to transfer non-click space information to the target CVR estimator. We conduct extensive offline experiments on six large-scale datasets. EVI demonstrated a 2.25% average improvement compared to the state-of-the-art baselines.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Placed in Distillation for recommender systems, one of 12 directions in Knowledge distillation. Builds on 14 of its 30 references that are in the map. First posted on arXiv 17 Dec 2024.

Builds on

14 of 30 references.

References · 14

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2016Recommendations as Treatments: Debiasing Learning and Evaluationcited by 248
  3. 2018Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Ratecited by 173
  4. 2019Unbiased Recommender Learning from Missing-Not-At-Random Implicit Feedbackcited by 79
  5. 2022ESCM2: Entire Space Counterfactual Multi-Task Model for Post-Click Conversion Rate Estimationcited by 47
  6. 2019Large-scale Causal Approaches to Debiasing Post-click Conversion Rate Estimation with Multi-task Learningcited by 39
  7. 2021Modeling the Sequential Dependence among Audience Multi-step Conversions with Multi-task Learning in Targeted Display Advertisingcited by 39
  8. 2021Enhanced Doubly Robust Learning for Debiasing Post-click Conversion Rate Estimationcited by 28
  9. 2023A Survey on Causal Inference for Recommendationcited by 22
  10. 2021Hierarchically Modeling Micro and Macro Behaviors via Multi-Task Learning for Conversion Rate Predictioncited by 21
  11. 2022A Generalized Doubly Robust Learning Framework for Debiasing Post-Click Conversion Rate Predictioncited by 18
  12. 2023Balancing Unobserved Confounding with a Few Unbiased Ratings in Debiased Recommendationscited by 18
2 more
  1. 2022UKD: Debiasing Conversion Rate Estimation via Uncertainty-regularized Knowledge Distillationcited by 14
  2. 2023DCMT: A Direct Entire-Space Causal Multi-Task Framework for Post-Click Conversion Estimationcited by 12

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 2.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2022Rethinking Position Bias Modeling with Knowledge Distillation for CTR Prediction
  2. 2024RAT: Retrieval-Augmented Transformer for Click-Through Rate Prediction
  3. 2025DGenCTR: Towards a Universal Generative Paradigm for Click-Through Rate Prediction via Discrete Diffusion
  4. 2025Addressing Cold-start Problem in Click-Through Rate Prediction via Supervised Diffusion Modeling
  5. 2023MAP: A Model-agnostic Pretraining Framework for Click-through Rate Prediction
  6. 2024Retrieval-Oriented Knowledge for Click-Through Rate Prediction
  7. 2025Generating Negative Samples for Multi-Modal Recommendation
  8. 2026Unifying Search and Recommendation in LLMs via Gradient Multi-Subspace Tuning ↗