On Predicting Post-Click Conversion Rate via Counterfactual Inference
Not on the map. Why?
Abstract (arXiv)
Accurately predicting conversion rate (CVR) is essential in various recommendation domains such as online advertising systems and e-commerce. These systems utilize user interaction logs, which consist of exposures, clicks, and conversions. CVR prediction models are typically trained solely based on clicked samples, as conversions can only be determined following clicks. However, the sparsity of clicked instances necessitates the collection of a substantial amount of logs for effective model training. Recent works address this issue by devising frameworks that leverage non-clicked samples. While these frameworks aim to reduce biases caused by the discrepancy between clicked and non-clicked samples, they often rely on heuristics. Against this background, we propose a method to counterfactually generate conversion labels for non-clicked samples by using causality as a guiding principle, attempting to answer the question, "Would the user have converted if he or she had clicked the recommended item?" Our approach is named the Entire Space Counterfactual Inference Multi-task Model (ESCIM). We initially train a structural causal model (SCM) of user sequential behaviors and conduct a hypothetical intervention (i.e., click) on non-clicked items to infer counterfactual CVRs. We then introduce several approaches to transform predicted counterfactual CVRs into binary counterfactual conversion labels for the non-clicked samples. Finally, the generated samples are incorporated into the training process. Extensive experiments on public datasets illustrate the superiority of the proposed algorithm. Online A/B testing further empirically validates the effectiveness of our proposed algorithm in real-world scenarios. In addition, we demonstrate the improved performance of the proposed method on latent conversion data, showcasing its robustness and superior generalization capabilities.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 17 of its 34 references that are in the map. First posted on arXiv 6 Oct 2025.
Builds on
17 of 34 references.
References · 17
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Variational Inference: A Review for Statisticianscited by 1,466
- 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 673
- 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 336
- 2020DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systemscited by 326
- 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 319
- 2018Variational Autoencoders for Collaborative Filteringcited by 308
- 2016Recommendations as Treatments: Debiasing Learning and Evaluationcited by 246
- 2018Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Ratecited by 172
- 2021Causal Intervention for Leveraging Popularity Bias in Recommendationcited by 116
- 2018Field-weighted Factorization Machines for Click-Through Rate Prediction in Display Advertisingcited by 59
- 2021Deconfounded Recommendation for Alleviating Bias Amplificationcited by 51
5 more
- 2022ESCM2: Entire Space Counterfactual Multi-Task Model for Post-Click Conversion Rate Estimationcited by 47
- 2019Large-scale Causal Approaches to Debiasing Post-click Conversion Rate Estimation with Multi-task Learningcited by 39
- 2021Nested Counterfactual Identification from Arbitrary Surrogate Experimentscited by 38
- 2021Top-N Recommendation with Counterfactual User Preference Simulationcited by 21
- 2023DCMT: A Direct Entire-Space Causal Multi-Task Framework for Post-Click Conversion Estimationcited by 12
Built on by
Not cited yet.