Dimensionality reduction for click-through rate prediction: Dense versus sparse representation
In online advertising, display ads are increasingly being placed based on real-time auctions where the advertiser who wins gets to serve the ad. This is called real-time bidding (RTB). In RTB, auctions have very tight time constraints on the order of 100ms. Therefore mechanisms for bidding intelligently such as clickthrough rate prediction need to be sufficiently fast. In this work, we propose to use dimensionality reduction of the user-website interaction graph in order to produce simplified features of users and websites that can be used as predictors of clickthrough rate. We demonstrate that the Infinite Relational Model (IRM) as a dimensionality reduction offers comparable predictive performance to conventional dimensionality reduction schemes, while achieving the most economical usage of features and fastest computations at run-time. For applications such as real-time bidding, where fast database I/O and few computations are key to success, we thus recommend using IRM based features as predictors to exploit the recommender effects from bipartite graphs.
Code (0)
등록된 구현이 없습니다.
Tasks
Click-Through Rate PredictionDimensionality ReductionSimilar Papers 제목 키워드 기반
Disentangled Self-Attentive Neural Networks for Click-Through Rate Prediction
Click-Through Rate (CTR) prediction, whose aim is to predict the probability of whether a user will click on an item, is an essential task for many online applications. Due to the nature of data sparsity and high dimensi…
Click-Through Rate PredictionComputational EfficiencyFeature ImportancePredictionExtreme Learning Machines for Fast Training of Click-Through Rate Prediction Models
Extreme Learning Machines (ELM) provide a fast alternative to traditional gradient-based learning in neural networks, offering rapid training and robust generalization capabilities. Its theoretical basis shows its univer…
Click-Through Rate PredictionBayesian Inference on Matrix Manifolds for Linear Dimensionality Reduction
We reframe linear dimensionality reduction as a problem of Bayesian inference on matrix manifolds. This natural paradigm extends the Bayesian framework to dimensionality reduction tasks in higher dimensions with simpler …
Bayesian InferenceDimensionality ReductionBERT4CTR: An Efficient Framework to Combine Pre-trained Language Model with Non-textual Features for CTR Prediction
Although deep pre-trained language models have shown promising benefit in a large set of industrial scenarios, including Click-Through-Rate (CTR) prediction, how to integrate pre-trained language models that handle only …
Click-Through Rate PredictionDimensionality ReductionLanguage ModelingLanguage ModellingA Bag of Tricks for Scaling CPU-based Deep FFMs to more than 300m Predictions per Second
Field-aware Factorization Machines (FFMs) have emerged as a powerful model for click-through rate prediction, particularly excelling in capturing complex feature interactions. In this work, we present an in-depth analysi…
Click-Through Rate PredictionCPUQuantization