Pith. sign in

REVIEW 3 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2007.03519 v1 pith:DBM4D2ID submitted 2020-07-06 cs.LG

classification cs.LG
keywords manyembeddinggatehiddenfeaturegatingmodelsneural
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Adaptive Domain Scaling for Personalized Sequential Modeling in Recommenders

    cs.IR 2025-02 conditional novelty 6.0 of 10

    Domain-conditioned generation of per-user sequence item and candidate query representations improves multi-domain target-aware attention in recommenders.

  2. Mini-Game Lifetime Value Prediction in WeChat

    cs.LG 2025-05 conditional novelty 4.0 of 10

    GRePO-LTV, a graph-representation and Pareto-optimized model, predicts multi-horizon mini-game lifetime value and raises online GMV by 8.4% in a WeChat A/B test.

  3. IU4Rec: Interest Unit-Based Product Organization and Recommendation for E-Commerce Platform

    cs.IR 2025-02 conditional novelty 4.0 of 10

    Recommending groups of similar products (interest units) instead of single items improves CTR and transactions on a C2C platform where individual items have limited stock.

Pith tools