Learning Multi-Branch Cooperation for Enhanced Click-Through Rate Prediction at Taobao
Not on the map. Why?
Abstract (arXiv)
Existing click-through rate (CTR) prediction works have studied the role of feature interaction through a variety of techniques. Each interaction technique exhibits its own strength, and solely using one type usually constrains the model's capability to capture the complex feature relationships, especially for industrial data with enormous input feature fields. Recent research shows that effective CTR models often combine an MLP network with a dedicated feature interaction network in a two-parallel structure. However, the interplay and cooperative dynamics between different streams or branches remain under-researched. In this work, we introduce a novel Multi-Branch Cooperation Network (MBCnet) which enables multiple branch networks to collaborate with each other for better complex feature interaction modeling. Specifically, MBCnet consists of three branches: the Extensible Feature Grouping and Crossing (EFGC) branch that promotes the model's memorization ability of specific feature fields, the low rank Cross Net branch and Deep branch to enhance explicit and implicit feature crossing for improved generalization. Among these branches, a novel cooperation scheme is proposed based on two principles: Branch co-teaching and moderate differentiation. Branch co-teaching encourages well-learned branches to support poorly-learned ones on specific training samples. Moderate differentiation advocates branches to maintain a reasonable level of difference in their feature representations on the same inputs. This cooperation strategy improves learning through mutual knowledge sharing and boosts the discovery of diverse feature interactions across branches. Experiments on large-scale industrial datasets and online A/B test at Taobao app demonstrate MBCnet's superior performance, delivering a 0.09 point increase in CTR, 1.49% growth in deals, and 1.62% rise in GMV. Core codes are available online.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 21 of its 37 references that are in the map. First posted on arXiv 20 Nov 2024.
Builds on
21 of 37 references.
References · 21
- 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,059
- 2016Wide & Deep Learning for Recommender Systemscited by 747
- 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 676
- 2017Deep & Cross Network for Ad Click Predictionscited by 393
- 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 338
- 2020DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systemscited by 327
- 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 320
- 2018xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systemscited by 278
- 2019DDTCDR: Deep Dual Transfer Cross Domain Recommendationcited by 72
- 2016Deep Learning over Multi-field Categorical Data: A Case Study on User Response Predictioncited by 67
- 2021A Survey on Ensemble Learning under the Era of Deep Learningcited by 47
- 2023FinalMLP: An Enhanced Two-Stream MLP Model for CTR Predictioncited by 37
9 more
- 2022Click-Through Rate Prediction in Online Advertising: A Literature Reviewcited by 31
- 2020MiNet: Mixed Interest Network for Cross-Domain Click-Through Rate Predictioncited by 30
- 2023ClickPrompt: CTR Models are Strong Prompt Generators for Adapting Language Models to CTR Predictioncited by 27
- 2024Breaking the Length Barrier: LLM-Enhanced CTR Prediction in Long Textual User Behaviorscited by 23
- 2019Deep Spatio-Temporal Neural Networks for Click-Through Rate Predictioncited by 17
- 2023CTRL: Connect Collaborative and Language Model for CTR Predictioncited by 14
- 2023Enhancing Cross-domain Click-Through Rate Prediction via Explicit Feature Augmentationcited by 11
- 2020Towards Equivalent Transformation of User Preferences in Cross Domain Recommendationcited by 8
- 2020Collaborative Adversarial Learning for RelationalLearning on Multiple Bipartite Graphscited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.