Retrievable Domain-Sensitive Feature Memory for Multi-Domain Recommendation
Not on the map. Why?
Abstract (arXiv)
With the increase in the business scale and number of domains in online advertising, multi-domain ad recommendation has become a mainstream solution in the industry. The core of multi-domain recommendation is effectively modeling the commonalities and distinctions among domains. Existing works are dedicated to designing model architectures for implicit multi-domain modeling while overlooking an in-depth investigation from a more fundamental perspective of feature distributions. This paper focuses on features with significant differences across various domains in both distributions and effects on model predictions. We refer to these features as domain-sensitive features, which serve as carriers of domain distinctions and are crucial for multi-domain modeling. Experiments demonstrate that existing multi-domain modeling methods may neglect domain-sensitive features, indicating insufficient learning of domain distinctions. To avoid this neglect, we propose a domain-sensitive feature attribution method to identify features that best reflect domain distinctions from the feature set. Further, we design a memory architecture that extracts domain-specific information from domain-sensitive features for the model to retrieve and integrate, thereby enhancing the awareness of domain distinctions. Extensive offline and online experiments demonstrate the superiority of our method in capturing domain distinctions and improving multi-domain recommendation performance.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 28 of its 45 references that are in the map. First posted on arXiv 21 May 2024.
Builds on
28 of 45 references.
References · 28
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2017Axiomatic Attribution for Deep Networkscited by 3,350
- 2013Visualizing and Understanding Convolutional Networkscited by 2,278
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 1,979
- 2020Rethinking Attention with Performerscited by 1,584
- 2020Linformer: Self-Attention with Linear Complexitycited by 1,462
- 2017Learning Important Features Through Propagating Activation Differencescited by 1,454
- 2015Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)cited by 1,061
- 2018A Survey Of Methods For Explaining Black Box Modelscited by 970
16 more
- 2020Meta-Learning in Neural Networks: A Surveycited by 944
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
- 2018Efficient Attention: Attention with Linear Complexitiescited by 366
- 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 336
- 2020A Survey on Neural Network Interpretabilitycited by 291
- 2017Visualizing Deep Neural Network Decisions: Prediction Difference Analysiscited by 166
- 2021One Model to Serve All: Star Topology Adaptive Recommender for Multi-Domain CTR Predictioncited by 78
- 2023PEPNet: Parameter and Embedding Personalized Network for Infusing with Personalized Prior Informationcited by 60
- 2017Optimized Cost per Click in Taobao Display Advertisingcited by 57
- 2016Learning Hidden Unit Contributions for Unsupervised Acoustic Model Adaptationcited by 38
- 2016Deep CTR Prediction in Display Advertisingcited by 31
- 2022AutoField: Automating Feature Selection in Deep Recommender Systemscited by 30
- 2023HAMUR: Hyper Adapter for Multi-Domain Recommendationcited by 21
- 2022Leaving No One Behind: A Multi-Scenario Multi-Task Meta Learning Approach for Advertiser Modelingcited by 18
- 2023HiNet: Novel Multi-Scenario & Multi-Task Learning with Hierarchical Information Extractioncited by 11
- 2023Multi-Scenario Ranking with Adaptive Feature Learningcited by 7
Built on by
Citing papers per year: 2025: 3; 2026: 1.
4 papers.
- 2025Few-shot LLM Synthetic Data with Distribution Matchingcited by 9
- 2025SampleLLM: Optimizing Tabular Data Synthesis in Recommendationscited by 4
- 2025No One Left Behind: How to Exploit the Incomplete and Skewed Multi-Label Data for Conversion Rate Predictioncited by 0
- 2026Heterogeneous Ranking in Industrial-Scale Recommender Systems: A Case Studycited by 0
- 2026Heterogeneous Ranking in Industrial-Scale Recommender Systems: A Case Study30 Jul 2026
- 2025No One Left Behind: How to Exploit the Incomplete and Skewed Multi-Label Data for Conversion Rate Prediction15 Dec 2025
- 2025Few-shot LLM Synthetic Data with Distribution Matching9 Feb 2025
- 2025SampleLLM: Optimizing Tabular Data Synthesis in Recommendations27 Jan 2025