Papers › FAT-DeepFFM: Field Attentive Deep Field-aware Factorization Machine

FAT-DeepFFM: Field Attentive Deep Field-aware Factorization Machine

15 May 2019arXiv:1905.06336archive 2025-07-28

Junlin Zhang, Tongwen Huang, Zhiqi Zhang

Click through rate (CTR) estimation is a fundamental task in personalized advertising and recommender systems. Recent years have witnessed the success of both the deep learning based model and attention mechanism in various tasks in computer vision (CV) and natural language processing (NLP). How to combine the attention mechanism with deep CTR model is a promising direction because it may ensemble the advantages of both sides. Although some CTR model such as Attentional Factorization Machine (AFM) has been proposed to model the weight of second order interaction features, we posit the evaluation of feature importance before explicit feature interaction procedure is also important for CTR prediction tasks because the model can learn to selectively highlight the informative features and suppress less useful ones if the task has many input features. In this paper, we propose a new neural CTR model named Field Attentive Deep Field-aware Factorization Machine (FAT-DeepFFM) by combining the Deep Field-aware Factorization Machine (DeepFFM) with Compose-Excitation network (CENet) field attention mechanism which is proposed by us as an enhanced version of Squeeze-Excitation network (SENet) to highlight the feature importance. We conduct extensive experiments on two real-world datasets and the experiment results show that FAT-DeepFFM achieves the best performance and obtains different improvements over the state-of-the-art methods. We also compare two kinds of attention mechanisms (attention before explicit feature interaction vs. attention after explicit feature interaction) and demonstrate that the former one outperforms the latter one significantly.

PaperPDFCode

Syntology This paper's arXiv id is not in Syntology's Atlas id list (549,449 ids, as this build read them; the read time is in the build record), so this page links to no Syntology page for it. The list is not the whole graph; Syntology's feed shows papers as they enter the graph.

Code

Andy1314Chen/FAT-DeepFFM-Paddle mentioned on GitHubpaddleSyntology: not harvested report
LinJayan/FAT_DeepFFM_Paddle mentioned on GitHubpaddleSyntology: not harvested report
Mind23-2/MindCode-45 mentioned on GitHubmindsporeSyntology: not harvested report
alililia/ascend_Fat-DeepFFM mentioned on GitHubmindsporeSyntology: not harvested report
p768lwy3/torecsys mentioned on GitHubpytorchSyntology: not harvested report
sea-wyq/Fat-deepFFM mentioned on GitHubmindsporeSyntology: not harvested report
2023-MindSpore-1/ms-code-220 mindsporeSyntology: not harvested report
PaddlePaddle/PaddleRec paddleSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to ESCM²: Entire Space Counterfactual Multi-Task Model for Post-Click Conversion Rate Estimation (arXiv:2204.05125; that paper's own run record: 6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
datawhalechina/torch-rechub pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to FiBiNET: Combining Feature Importance and Bilinear feature Interaction for... (arXiv:1905.09433; that paper's own run record: 12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 14 unverified); nothing checks that they implement this paper's method. report
luxinming/PaddleRec20220725 paddleSyntology: not harvested report
mindspore-ai/models mindsporeSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to AdaBin: Improving Binary Neural Networks with Adaptive Binary Sets (arXiv:2208.08084; that paper's own run record: 4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. 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.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

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

Tasks

Click-Through Rate PredictionFeature ImportanceRecommendation Systems

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Click-Through Rate Prediction Criteo DeepFFM AUC 0.8104 #20 of 39 Archive leaderboard report
Click-Through Rate Prediction Criteo DeepFFM Log Loss 0.4416 #20 of 39 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.

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