Methods › General › Deep Tabular Learning › Wide&Deep

Wide&Deep

7 papers tagged archive 2025-07-28

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).

PaperSource

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.

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.

TaskPapers
Click-Through Rate Prediction4
Recommendation Systems3
Prediction2
Deep Learning1
Feature Engineering1
Graph Neural Network1
Link Prediction1
Memorization1
News Recommendation1
regression1

Usage over time archive 2025-07-28

Papers per year tagged with Wide&Deep: 2016 to 2023, peak 2 2 0 2016: 1 paper 2016 2017: 2 papers 2017 2018: 1 paper 2018 2019: 1 paper 2019 2020: 1 paper 2020 2021: 0 papers 2021 2022: 0 papers 2022 2023: 1 paper 2023
Papers per year the archive tags with this method, by the paper's archive date (7 dated). Bars are counts, not a trend claim.

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

Deep Tabular Learning

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