MTMD: A Multi-Task Multi-Domain Framework for Unified Ad Lightweight Ranking at Pinterest
Not on the map. Why?
Abstract (arXiv)
The lightweight ad ranking layer, living after the retrieval stage and before the fine ranker, plays a critical role in the success of a cascaded ad recommendation system. Due to the fact that there are multiple optimization tasks depending on the ad domain, e.g., Click Through Rate (CTR) for click ads and Conversion Rate (CVR) for conversion ads, as well as multiple surfaces where an ad is served (home feed, search, or related item recommendation) with diverse ad products (shopping or standard ad); it is an essentially challenging problem in industry on how to do joint holistic optimization in the lightweight ranker, such that the overall platform's value, advertiser's value, and user's value are maximized. Deep Neural Network (DNN)-based multitask learning (MTL) can handle multiple goals naturally, with each prediction head mapping to a particular optimization goal. However, in practice, it is unclear how to unify data from different surfaces and ad products into a single model. It is critical to learn domain-specialized knowledge and explicitly transfer knowledge between domains to make MTL effective. We present a Multi-Task Multi-Domain (MTMD) architecture under the classic Two-Tower paradigm, with the following key contributions: 1) handle different prediction tasks, ad products, and ad serving surfaces in a unified framework; 2) propose a novel mixture-of-expert architecture to learn both specialized knowledge each domain and common knowledge shared between domains; 3) propose a domain adaption module to encourage knowledge transfer between experts; 4) constrain the modeling of different prediction tasks. MTMD improves the offline loss value by 12% to 36%, mapping to 2% online reduction in cost per click. We have deployed this single MTMD framework into production for Pinterest ad recommendation replacing 9 production models.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 11 of its 23 references that are in the map. First posted on arXiv 10 Oct 2025.
Builds on
11 of 23 references.
References · 11
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2016Layer Normalizationcited by 5,669
- 2015Empirical Evaluation of Rectified Activations in Convolutional Networkcited by 519
- 2020DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systemscited by 327
- 2018Ranking Distillation: Learning Compact Ranking Models With High Performance for Recommender Systemcited by 60
- 2020COLD: Towards the Next Generation of Pre-Ranking Systemcited by 31
- 2022Adaptive Domain Interest Network for Multi-domain Recommendationcited by 20
- 2022Exploring Dual Encoder Architectures for Question Answeringcited by 19
- 2023Beyond Two-Tower Matching: Learning Sparse Retrievable Cross-Interactions for Recommendationcited by 13
- 2023COPR: Consistency-Oriented Pre-Ranking for Online Advertisingcited by 10
- 2023Towards the Better Ranking Consistency: A Multi-task Learning Framework for Early Stage Ads Rankingcited by 7
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2025Deep Reinforcement Learning for Ranking Utility Tuning in the Ad Recommender System at Pinterest
- 2025Multi-task Offline Reinforcement Learning for Online Advertising in Recommender Systems
- 2023UFIN: Universal Feature Interaction Network for Multi-Domain Click-Through Rate Prediction
- 2026AdNanny: One Reasoning LLM for All Offline Ads Recommendation Tasks
- 2026LLM-HYPER: Generative CTR Modeling for Cold-Start Ad Personalization via LLM-Based Hypernetworks
- 2025HCMRM: A High-Consistency Multimodal Relevance Model for Search Ads
- 2022Cross-Task Knowledge Distillation in Multi-Task Recommendation
- 2025CTR-Driven Ad Text Generation via Online Feedback Preference Optimization