Disentangled Interest Network for Out-of-Distribution CTR Prediction
Not on the map. Why?
Abstract (arXiv)
Click-through rate (CTR) prediction, which estimates the probability of a user clicking on a given item, is a critical task for online information services. Existing approaches often make strong assumptions that training and test data come from the same distribution. However, the data distribution varies since user interests are constantly evolving, resulting in the out-of-distribution (OOD) issue. In addition, users tend to have multiple interests, some of which evolve faster than others. Towards this end, we propose Disentangled Click-Through Rate prediction (DiseCTR), which introduces a causal perspective of recommendation and disentangles multiple aspects of user interests to alleviate the OOD issue in recommendation. We conduct a causal factorization of CTR prediction involving user interest, exposure model, and click model, based on which we develop a deep learning implementation for these three causal mechanisms. Specifically, we first design an interest encoder with sparse attention which maps raw features to user interests, and then introduce a weakly supervised interest disentangler to learn independent interest embeddings, which are further integrated by an attentive interest aggregator for prediction. Experimental results on three real-world datasets show that DiseCTR achieves the best accuracy and robustness in OOD recommendation against state-of-the-art approaches, significantly improving AUC and GAUC by over 0.02 and reducing logloss by over 13.7%. Further analyses demonstrate that DiseCTR successfully disentangles user interests, which is the key to OOD generalization for CTR prediction. We have released the code and data at https://github.com/DavyMorgan/DiseCTR/.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 49 of its 79 references that are in the map. First posted on arXiv 14 Nov 2025.
Builds on
49 of 79 references.
References · 49
- 2017Attention Is All You Needcited by 59,932
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecastingcited by 2,141
- 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,906
- 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,842
- 2019Invariant Risk Minimizationcited by 1,832
- 2015Effective Approaches to Attention-based Neural Machine Translationcited by 1,024
- 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 929
- 2016Wide & Deep Learning for Recommender Systemscited by 745
- 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 673
- 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
- 2021Towards Out-Of-Distribution Generalization: A Surveycited by 431
37 more
- 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 336
- 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 319
- 2018xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systemscited by 277
- 2019Causality for Machine Learningcited by 242
- 2020Weakly-Supervised Disentanglement Without Compromisescited by 237
- 2017Neural Factorization Machines for Sparse Predictive Analyticscited by 183
- 2019A Meta-Transfer Objective for Learning to Disentangle Causal Mechanismscited by 158
- 2021Deep Stable Learning for Out-Of-Distribution Generalizationcited by 153
- 2017Attentional Factorization Machines: Learning the Weight of Feature Interactions via Attention Networkscited by 126
- 2019Practice on Long Sequential User Behavior Modeling for Click-Through Rate Predictioncited by 118
- 2020Disentangled Graph Collaborative Filteringcited by 118
- 2021Causal Intervention for Leveraging Popularity Bias in Recommendationcited by 116
- 2019Learning Disentangled Representations for Recommendationcited by 110
- 2014Collaborative Deep Learning for Recommender Systemscited by 95
- 2021Learning Intents behind Interactions with Knowledge Graph for Recommendationcited by 94
- 2021Towards a Theoretical Framework of Out-of-Distribution Generalizationcited by 94
- 2021Sequential Recommendation with Graph Neural Networkscited by 89
- 2021AutoDebias: Learning to Debias for Recommendationcited by 68
- 2019Disentangling Factors of Variation Using Few Labelscited by 57
- 2020AutoFIS: Automatic Feature Interaction Selection in Factorization Models for Click-Through Rate Predictioncited by 52
- 2020In-N-Out: Pre-Training and Self-Training using Auxiliary Information for Out-of-Distribution Robustnesscited by 49
- 2019Adaptive Factorization Network: Learning Adaptive-Order Feature Interactionscited by 48
- 2020User Behavior Retrieval for Click-Through Rate Predictioncited by 44
- 2022Causal Inference in Recommender Systems: A Survey and Future Directionscited by 44
- 2021Nonlinear Invariant Risk Minimization: A Causal Approachcited by 42
- 2022CIRS: Bursting Filter Bubbles by Counterfactual Interactive Recommender Systemcited by 38
- 2020Seamlessly Unifying Attributes and Items: Conversational Recommendation for Cold-Start Userscited by 33
- 2021DGCN: Diversified Recommendation with Graph Convolutional Networkscited by 29
- 2022Disentangling Long and Short-Term Interests for Recommendationcited by 22
- 2022CausPref: Causal Preference Learning for Out-of-Distribution Recommendationcited by 17
- 2020A Commentary on the Unsupervised Learning of Disentangled Representationscited by 13
- 2020Spending Money Wisely: Online Electronic Coupon Allocation based on Real-Time User Intent Detectioncited by 13
- 2022Cascading Residual Graph Convolutional Network for Multi-Behavior Recommendationcited by 12
- 2016Collaborative Recurrent Autoencoder: Recommend while Learning to Fill in the Blankscited by 10
- 2019Learning Feature Interactions with Lorentzian Factorization Machinecited by 8
- 2022Coarse-to-Fine Knowledge-Enhanced Multi-Interest Learning Framework for Multi-Behavior Recommendationcited by 6
- 2021Disentangled Self-Attentive Neural Networks for Click-Through Rate Predictioncited by 5
Built on by
Not cited yet.