Towards Unifying Feature Interaction Models for Click-Through Rate Prediction
Yu Kang, Junwei Pan, Jipeng Jin, Shudong Huang, Xiaofeng Gao, Lei, Xiao

TL;DR
This paper introduces a unifying framework called IPA for feature interaction models in CTR prediction, enabling systematic comparison and improvement, leading to a new competitive model deployed in Tencent's advertising platform.
Contribution
The paper proposes a general framework unifying existing feature interaction models, and introduces a new model leveraging this framework that achieves competitive results and is deployed in production.
Findings
The framework categorizes most existing models.
The new model achieves state-of-the-art performance.
The deployed model significantly improves GMV in online tests.
Abstract
Modeling feature interactions plays a crucial role in accurately predicting click-through rates (CTR) in advertising systems. To capture the intricate patterns of interaction, many existing models employ matrix-factorization techniques to represent features as lower-dimensional embedding vectors, enabling the modeling of interactions as products between these embeddings. In this paper, we propose a general framework called IPA to systematically unify these models. Our framework comprises three key components: the Interaction Function, which facilitates feature interaction; the Layer Pooling, which constructs higher-level interaction layers; and the Layer Aggregator, which combines the outputs of all layers to serve as input for the subsequent classifier. We demonstrate that most existing models can be categorized within our framework by making specific choices for these three…
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
TopicsImage and Video Quality Assessment · Advanced Computing and Algorithms
