Learning Multi-Branch Cooperation for Enhanced Click-Through Rate Prediction at Taobao
Xu Chen, Zida Cheng, Yuangang Pan, Shuai Xiao, Xiaoming Liu, Jinsong Lan, Xiaoyong Zhu, Bo Zheng, Ivor W. Tsang

TL;DR
This paper introduces MBCnet, a multi-branch cooperation network for CTR prediction that models complex feature interactions more effectively by enabling branches to collaborate, leading to significant improvements in industrial-scale online advertising metrics.
Contribution
The paper proposes a novel multi-branch cooperation scheme with co-teaching and moderate differentiation principles, enhancing feature interaction modeling in CTR prediction.
Findings
MBCnet achieves a 0.09 point increase in CTR.
1.49% growth in deals.
1.62% rise in GMV.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Computing and Algorithms
