Papers › GateNet: Gating-Enhanced Deep Network for Click-Through Rate Prediction

GateNet: Gating-Enhanced Deep Network for Click-Through Rate Prediction

6 Jul 2020arXiv:2007.03519archive 2025-07-28

Tongwen Huang, Qingyun She, Zhiqiang Wang, Junlin Zhang

Advertising and feed ranking are essential to many Internet companies such as Facebook. Among many real-world advertising and feed ranking systems, click through rate (CTR) prediction plays a central role. In recent years, many neural network based CTR models have been proposed and achieved success such as Factorization-Machine Supported Neural Networks, DeepFM and xDeepFM. Many of them contain two commonly used components: embedding layer and MLP hidden layers. On the other side, gating mechanism is also widely applied in many research fields such as computer vision(CV) and natural language processing(NLP). Some research has proved that gating mechanism improves the trainability of non-convex deep neural networks. Inspired by these observations, we propose a novel model named GateNet which introduces either the feature embedding gate or the hidden gate to the embedding layer or hidden layers of DNN CTR models, respectively. The feature embedding gate provides a learnable feature gating module to select salient latent information from the feature-level. The hidden gate helps the model to implicitly capture the high-order interaction more effectively. Extensive experiments conducted on three real-world datasets demonstrate its effectiveness to boost the performance of various state-of-the-art models such as FM, DeepFM and xDeepFM on all datasets.

PaperPDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

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

For agents, on Syntology's MCP service (how to connect):

Code

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
beiluo-horizon/PytorchCTR pytorchSyntology: not harvested report
chenxingqiang/RecSys-CTR-Model-2020 Syntology: not harvested report
codectr/RefineCTR 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

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 PredictionRecommendation Systems

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Click-Through Rate Prediction Criteo GateNet AUC 0.8100 #23 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