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

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

18 Jul 2024arXiv:2407.13349archive 2025-07-28

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.

PaperPDFCode

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

Code

salmon1802/DCNv3 officialmentioned in papermentioned on GitHubpytorch report
reczoo/FuxiCTR officialmentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Click-Through Rate Prediction

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Click-Through Rate Prediction Avazu FCN AUC 0.7970 #4 of 15 Archive leaderboard report
Click-Through Rate Prediction Avazu FCN LogLoss 0.3695 #4 of 15 Archive leaderboard report
Click-Through Rate Prediction Criteo FCN AUC 0.8162 #2 of 39 Archive leaderboard report
Click-Through Rate Prediction Criteo FCN Log Loss 0.4358 #2 of 39 Archive leaderboard report
Click-Through Rate Prediction KDD12 FCN AUC 0.8098 #1 of 5 Archive leaderboard report
Click-Through Rate Prediction KDD12 FCN Log Loss 0.1494 #1 of 5 Archive leaderboard report
Click-Through Rate Prediction KKBox FCN AUC 0.8557 #1 of 6 Archive leaderboard report
Click-Through Rate Prediction MovieLens 1M DCNv3 AUC 0.9074 #5 of 6 Archive leaderboard report
Click-Through Rate Prediction MovieLens 1M DCNv3 Log Loss 0.3001 #5 of 6 Archive leaderboard report
Click-Through Rate Prediction iPinYou FCN AUC 0.7856 #3 of 7 Archive leaderboard report
Click-Through Rate Prediction iPinYou FCN LogLoss 0.005535 #3 of 7 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

ConvolutionFCNMax Pooling

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections