A Simple and Robust Ensemble For Click-Through Rate Prediction
Open Access
- 19 September 2023
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 14-17
Abstract
This paper presents the strategy employed by the TOT team, which secured 3rd place in the ACM RecSys Challenge 2023 among academic teams. The challenge, orchestrated by ShareChat, focuses on online advertising and user privacy. The objective is to predict the probability of an application install for each anonymized entry. Our approach, though simple, proves efficient and comprises two primary components: initially, we explore state-of-the-art single-task and multi-task models, and subsequently, we integrate these via a simple yet robust ensemble.Keywords
This publication has 17 references indexed in Scilit:
- FiBiNET2019
- DeepIM: Deep Iterative Matching for 6D Pose Estimation2018
- Modeling Task Relationships in Multi-task Learning with Multi-gate Mixture-of-Experts2018
- xDeepFM2018
- Squeeze-and-Excitation Networks2018
- Field-weighted Factorization Machines for Click-Through Rate Prediction in Display Advertising2018
- Neural Factorization Machines for Sparse Predictive Analytics2017
- Product-Based Neural Networks for User Response Prediction2016
- Deep Crossing2016
- An Analysis of TransformationsJournal of the Royal Statistical Society Series B: Statistical Methodology, 1964