Lightweight Boosting Models for User Response Prediction Using Adversarial Validation
Not on the map. Why?
Abstract (arXiv)
The ACM RecSys Challenge 2023, organized by ShareChat, aims to predict the probability of the app being installed. This paper describes the lightweight solution to this challenge. We formulate the task as a user response prediction task. For rapid prototyping for the task, we propose a lightweight solution including the following steps: 1) using adversarial validation, we effectively eliminate uninformative features from a dataset; 2) to address noisy continuous features and categorical features with a large number of unique values, we employ feature engineering techniques.; 3) we leverage Gradient Boosted Decision Trees (GBDT) for their exceptional performance and scalability. The experiments show that a single LightGBM model, without additional ensembling, performs quite well. Our team achieved ninth place in the challenge with the final leaderboard score of 6.059065. Code for our approach can be found here: https://github.com/choco9966/recsys-challenge-2023.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 18 references that are in the map. First posted on arXiv 5 Oct 2023.
Builds on
7 of 18 references.
References · 7
- 2017Attention Is All You Needcited by 60,361
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2019TabNet: Attentive Interpretable Tabular Learningcited by 648
- 2017Deep Interest Network for Click-Through Rate Predictioncited by 544
- 2017Deep & Cross Network for Ad Click Predictionscited by 393
- 2023When Do Neural Nets Outperform Boosted Trees on Tabular Data?cited by 223
- 2018CatBoost: gradient boosting with categorical features supportcited by 208
Built on by
Not cited yet.