Methods › General › Deep Tabular Learning › Wide&Deep
Wide&Deep
Introduced by Heng-Tze Cheng et al. in Wide & Deep Learning for Recommender Systems
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Wide&Deep jointly trains wide linear models and deep neural networks to combine the benefits of memorization and generalization for real-world recommender systems. In summary, the wide component is a generalized linear model. The deep component is a feed-forward neural network. The deep and wide components are combined using a weighted sum of their output log odds as the prediction. This is then fed to a logistic loss function for joint training, which is done by back-propagating the gradients from the output to both the wide and deep part of the model simultaneously using mini-batch stochastic optimization. The AdaGrad optimizer is used for the wider part. The combined model is illustrated in the figure (center).
In Syntology code not checked for this name. The lookup matched a different name in Syntology's graph, 'WIDE' (resolution: token_match), and its answer is about that name only, so it does not say whether this method has code. About another paper: this answer is about arXiv:2607.28418, while the archive credits arXiv:1606.07792.
Origin paper of this answer, arXiv:2607.28418 (its page on Syntology).
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 7 · with a code link: 5 · where Syntology ran a sample: 1 (1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (1 of 7 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 7 of 7, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Knowledge Graph Driven Recommendation System Algorithm 1 Dec 2023 · 0 repositories · arXiv:2401.10244
-
TFNet: Multi-Semantic Feature Interaction for CTR Prediction 29 Jun 2020 · 0 repositories · arXiv:2006.15939
-
Click-Through Rate Prediction with the User Memory Network 9 Jul 2019 · 1 repository · arXiv:1907.04667
-
Structured Semantic Model supported Deep Neural Network for Click-Through Rate Prediction 4 Dec 2018 · 2 repositories · arXiv:1812.01353
-
Neural Factorization Machines for Sparse Predictive Analytics 16 Aug 2017 · 6 repositories · arXiv:1708.05027
-
Attentional Factorization Machines: Learning the Weight of Feature Interactions via Attention Networks 15 Aug 2017 · 8 repositories · arXiv:1708.04617
-
Wide & Deep Learning for Recommender Systems 24 Jun 2016 · 39 repositories · arXiv:1606.07792Syntology 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified (of 5 harvested samples) · 5 pointer-only (licence)
Tasks archive 2025-07-28
10 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| Click-Through Rate Prediction | 4 |
| Recommendation Systems | 3 |
| Prediction | 2 |
| Deep Learning | 1 |
| Feature Engineering | 1 |
| Graph Neural Network | 1 |
| Link Prediction | 1 |
| Memorization | 1 |
| News Recommendation | 1 |
| regression | 1 |
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
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