{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/wide-deep","slug":"wide-deep","name":"Wide&Deep","full_name":"Wide&Deep","full_name_withheld":false,"description_markdown":"**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).","description_state":"present","introduced_year":null,"introduced_by":{"title":"Wide & Deep Learning for Recommender Systems","paper":"/paper/wide-deep-learning-for-recommender-systems","first_author":"Heng-Tze Cheng","n_authors":16,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/wide-deep-learning-for-recommender-systems"},"source":{"url":"http://arxiv.org/abs/1606.07792v1","title":"Wide & Deep Learning for Recommender Systems","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Deep Tabular Learning","url":"/methods/category/deep-tabular-learning","pwc_aliases":[]}],"n_papers_tagged":7,"archive_num_papers":7,"papers_newest_first":[{"paper":null,"slug":"knowledge-graph-driven-recommendation-model","title":"Knowledge Graph Driven Recommendation System Algorithm","date":"2023-12-01","arxiv_id":"2401.10244","n_code_links":0,"syntology":null},{"paper":"/paper/tfnet-multi-semantic-feature-interaction-for","slug":"tfnet-multi-semantic-feature-interaction-for","title":"TFNet: Multi-Semantic Feature Interaction for CTR Prediction","date":"2020-06-29","arxiv_id":"2006.15939","n_code_links":0,"syntology":null},{"paper":"/paper/click-through-rate-prediction-with-the-user","slug":"click-through-rate-prediction-with-the-user","title":"Click-Through Rate Prediction with the User Memory Network","date":"2019-07-09","arxiv_id":"1907.04667","n_code_links":1,"syntology":null},{"paper":"/paper/structured-semantic-model-supported-deep","slug":"structured-semantic-model-supported-deep","title":"Structured Semantic Model supported Deep Neural Network for Click-Through Rate Prediction","date":"2018-12-04","arxiv_id":"1812.01353","n_code_links":2,"syntology":null},{"paper":"/paper/neural-factorization-machines-for-sparse","slug":"neural-factorization-machines-for-sparse","title":"Neural Factorization Machines for Sparse Predictive Analytics","date":"2017-08-16","arxiv_id":"1708.05027","n_code_links":6,"syntology":null},{"paper":"/paper/attentional-factorization-machines-learning","slug":"attentional-factorization-machines-learning","title":"Attentional Factorization Machines: Learning the Weight of Feature Interactions via Attention Networks","date":"2017-08-15","arxiv_id":"1708.04617","n_code_links":8,"syntology":null},{"paper":"/paper/wide-deep-learning-for-recommender-systems","slug":"wide-deep-learning-for-recommender-systems","title":"Wide & Deep Learning for Recommender Systems","date":"2016-06-24","arxiv_id":"1606.07792","n_code_links":39,"syntology":{"ran":3,"of":5,"n_ran_checked":3,"n_instrument":0,"unverified":2,"pointer_only":5,"phrase":"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","official":null}}],"papers_shown":7,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":7,"with_a_code_link":5,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":7,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/method/wide-deep/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/wide-deep/papers/ran/1","json":"/method/wide-deep/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/click-through-rate-prediction","name":"Click-Through Rate Prediction","papers":4},{"task":"/task/recommendation-systems","name":"Recommendation Systems","papers":3},{"task":"/task/prediction","name":"Prediction","papers":2},{"task":"/task/deep-learning","name":"Deep Learning","papers":1},{"task":"/task/feature-engineering","name":"Feature Engineering","papers":1},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":1},{"task":"/task/link-prediction","name":"Link Prediction","papers":1},{"task":"/task/memorization","name":"Memorization","papers":1},{"task":"/task/news-recommendation","name":"News Recommendation","papers":1},{"task":"/task/regression-1","name":"regression","papers":1}],"tasks_shown":10,"n_tasks":10,"usage_by_year":[{"year":"2016","papers":1},{"year":"2017","papers":2},{"year":"2018","papers":1},{"year":"2019","papers":1},{"year":"2020","papers":1},{"year":"2023","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/wide-deep"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Wide%26Deep","read_at":"2026-10-05T01:03:56+00:00","query":"Wide&Deep","kind":"method","have":"no_code","tier":"paper_only","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"WIDE","origin_arxiv_id":"2607.28418"},"resolution":"token_match","resolved_name_differs":true,"absence_asserted":"for_this_exact_name_only","absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"different_paper","archive_paper_arxiv_id":"1606.07792","repositories":{"listed":null,"in_graph":0,"list_truncated":null,"strongest_link":null},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2607.28418","citations":1},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'Wide&Deep'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2607.28418","page":null,"syntology_url":"https://syntology.ai/paper/2607.28418","in_graph_layer":false,"samples":0},"line":"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.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"5e1ee5d033e9ccc28fb4edcf1e2ab3d31a6e79366f7c5b643506c0e95f80228f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}