TasksSotADatasetsPapersMethodsSubmitAbout
Papers With Code 2

A community resource for machine learning research: papers, code, benchmarks, and state-of-the-art results.

Explore

Notable BenchmarksAll SotADatasetsPapersMethods

Community

Submit ResultsAbout

Data sourced from the PWC Archive (CC-BY-SA 4.0). Built by the community, for the community.

Papers/MMBAttn: Max-Mean and Bit-wise Attention for CTR Prediction

MMBAttn: Max-Mean and Bit-wise Attention for CTR Prediction

Hasan Saribas, Cagri Yesil, Serdarcan Dilbaz, Halit Orenbas

2023-08-25Click-Through Rate PredictionRecommendation SystemsFeature Importance
PaperPDF

Abstract

With the increasing complexity and scale of click-through rate (CTR) prediction tasks in online advertising and recommendation systems, accurately estimating the importance of features has become a critical aspect of developing effective models. In this paper, we propose an attention-based approach that leverages max and mean pooling operations, along with a bit-wise attention mechanism, to enhance feature importance estimation in CTR prediction. Traditionally, pooling operations such as max and mean pooling have been widely used to extract relevant information from features. However, these operations can lead to information loss and hinder the accurate determination of feature importance. To address this challenge, we propose a novel attention architecture that utilizes a bit-based attention structure that emphasizes the relationships between all bits in features, together with maximum and mean pooling. By considering the fine-grained interactions at the bit level, our method aims to capture intricate patterns and dependencies that might be overlooked by traditional pooling operations. To examine the effectiveness of the proposed method, experiments have been conducted on three public datasets. The experiments demonstrated that the proposed method significantly improves the performance of the base models to achieve state-of-the-art results.

Results

TaskDatasetMetricValueModel
Click-Through Rate PredictionAvazuAUC0.7666FinalMLP + MMBAttn
Click-Through Rate PredictionAvazuAUC0.765DNN + MMBAttn
Click-Through Rate PredictionFrappeAUC0.9861FinalMLP + MMBAttn
Click-Through Rate PredictionFrappeAUC0.985DNN + MMBAttn
Click-Through Rate PredictionCriteoAUC0.81497FinalMLP + MMBAttn
Click-Through Rate PredictionCriteoAUC0.8143DNN + MMBAttn

Related Papers

IP2: Entity-Guided Interest Probing for Personalized News Recommendation2025-07-18A Reproducibility Study of Product-side Fairness in Bundle Recommendation2025-07-18SGCL: Unifying Self-Supervised and Supervised Learning for Graph Recommendation2025-07-17MUPAX: Multidimensional Problem Agnostic eXplainable AI2025-07-17Similarity-Guided Diffusion for Contrastive Sequential Recommendation2025-07-16Looking for Fairness in Recommender Systems2025-07-16Neural Network-Guided Symbolic Regression for Interpretable Descriptor Discovery in Perovskite Catalysts2025-07-16Generative Click-through Rate Prediction with Applications to Search Advertising2025-07-15