paper-with-me

홈 › Papers

FCN: Fusing Exponential and Linear Cross Network for Click-Through Rate Prediction

2024-07-18 · Honghao Li, Yiwen Zhang, Yi Zhang, Hanwei Li, Lei Sang, Jieming Zhu

As an important modeling paradigm in click-through rate (CTR) prediction, the Deep & Cross Network (DCN) and its derivative models have gained widespread recognition primarily due to their success in a trade-off between computational cost and performance. This paradigm employs a cross network to explicitly model feature interactions with linear growth, while leveraging deep neural networks (DNN) to implicitly capture higher-order feature interactions. However, these models still face several key limitations: (1) The performance of existing explicit feature interaction methods lags behind that of implicit DNN, resulting in overall model performance being dominated by the DNN; (2) While these models claim to capture high-order feature interactions, they often overlook potential noise within these interactions; (3) The learning process for different interaction network branches lacks appropriate supervision signals; and (4) The high-order feature interactions captured by these models are often implicit and non-interpretable due to their reliance on DNN. To address the identified limitations, this paper proposes a novel model, called Fusing Cross Network (FCN), along with two sub-networks: Linear Cross Network (LCN) and Exponential Cross Network (ECN). FCN explicitly captures feature interactions with both linear and exponential growth, eliminating the need to rely on implicit DNN. Moreover, we introduce the Self-Mask operation to filter noise layer by layer and reduce the number of parameters in the cross network by half. To effectively train these two cross networks, we propose a simple yet effective loss function called Tri-BCE, which provides tailored supervision signals for each network. We evaluate the effectiveness, efficiency, and interpretability of FCN on six benchmark datasets. Furthermore, by integrating LCN and ECN, FCN achieves a new state-of-the-art performance.

📄 PDF Abstract BibTeX arXiv:2407.13349

Code (2)

reczoo/FuxiCTR 공식 구현 pytorch
salmon1802/DCNv3 공식 구현 pytorch

Tasks

Click-Through Rate Prediction

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Max Pooling Max Pooling is a pooling operation that calculates the maximum value for patches of a feature map, and uses it to create a downsampled (pooled) feature map. It is usually…
FCN Fully Convolutional Networks, or FCNs, are an architecture used mainly for semantic segmentation. They employ solely locally connected layers, such as…

Similar Papers 제목 키워드 기반

NegROI: Click-Centric Uncertainty-Guided Refinement with Scene-Conditioned Negative Prompts for Robust Interactive 3D Segmentation

2026-07-07 · Shuheng Zhang, Feng Wu arxiv

Interactive 3D segmentation aims to extract object masks in point clouds with minimal user clicks. Despite recent progress, most existing approaches still struggle with (i) coarse voxel resolution that blurs fine boundar…

Point Clouds

Hierarchically Fusing Long and Short-Term User Interests for Click-Through Rate Prediction in Product Search

2023-04-04 · Qijie Shen, Hong Wen, Jing Zhang, Qi Rao

Estimating Click-Through Rate (CTR) is a vital yet challenging task in personalized product search. However, existing CTR methods still struggle in the product search settings due to the following three challenges includ…

Click-Through Rate PredictionDisentanglement

Understanding and Counteracting Feature-Level Bias in Click-Through Rate Prediction

2024-02-06 · Jinqiu Jin, Sihao Ding, Wenjie Wang, Fuli Feng

Common click-through rate (CTR) prediction recommender models tend to exhibit feature-level bias, which leads to unfair recommendations among item groups and inaccurate recommendations for users. While existing methods a…

BlockingClick-Through Rate Prediction

Offline Evaluation of Ranking Policies with Click Models

2018-04-27 · Shuai Li, Yasin Abbasi-Yadkori, Branislav Kveton, S. Muthukrishnan 외

Many web systems rank and present a list of items to users, from recommender systems to search and advertising. An important problem in practice is to evaluate new ranking policies offline and optimize them before they a…

Recommendation Systems

Online Learning in Contextual Second-Price Pay-Per-Click Auctions

2023-10-08 · Mengxiao Zhang, Haipeng Luo

We study online learning in contextual pay-per-click auctions where at each of the $T$ rounds, the learner receives some context along with a set of ads and needs to make an estimate on their click-through rate (CTR) in …