{"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":"/paper/deep-learning-over-multi-field-categorical","title":"Deep Learning over Multi-field Categorical Data: A Case Study on User Response Prediction","arxiv_id":"1601.02376","date":"2016-01-11","proceeding":null,"authors":["Wei-Nan Zhang","Tianming Du","Jun Wang"],"abstract":"Predicting user responses, such as click-through rate and conversion rate,\nare critical in many web applications including web search, personalised\nrecommendation, and online advertising. Different from continuous raw features\nthat we usually found in the image and audio domains, the input features in web\nspace are always of multi-field and are mostly discrete and categorical while\ntheir dependencies are little known. Major user response prediction models have\nto either limit themselves to linear models or require manually building up\nhigh-order combination features. The former loses the ability of exploring\nfeature interactions, while the latter results in a heavy computation in the\nlarge feature space. To tackle the issue, we propose two novel models using\ndeep neural networks (DNNs) to automatically learn effective patterns from\ncategorical feature interactions and make predictions of users' ad clicks. To\nget our DNNs efficiently work, we propose to leverage three feature\ntransformation methods, i.e., factorisation machines (FMs), restricted\nBoltzmann machines (RBMs) and denoising auto-encoders (DAEs). This paper\npresents the structure of our models and their efficient training algorithms.\nThe large-scale experiments with real-world data demonstrate that our methods\nwork better than major state-of-the-art models.","url_abs":"http://arxiv.org/abs/1601.02376v1","url_pdf":"http://arxiv.org/pdf/1601.02376v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"deep-learning-over-multi-field-categorical","repo_url":"https://github.com/wnzhang/deep-ctr","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"deep-learning-over-multi-field-categorical","repo_url":"https://github.com/UlionTse/mlgb","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"deep-learning-over-multi-field-categorical","repo_url":"https://github.com/ddatta-DAC/Learning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"deep-learning-over-multi-field-categorical","repo_url":"https://github.com/shenweichen/DeepCTR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"deep-learning-over-multi-field-categorical","repo_url":"https://github.com/shenweichen/DeepCTR-Torch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"click-through-rate-prediction","task_name":"Click-Through Rate Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/click-through-rate-prediction-on-company","task":"Click-Through Rate Prediction","dataset":"Company*","model":"FNN","rank_in_archive_order":2,"of":8,"metrics":{"AUC":"0.8683","Log Loss":"0.02629"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-criteo","task":"Click-Through Rate Prediction","dataset":"Criteo","model":"FNN","rank_in_archive_order":39,"of":39,"metrics":{"AUC":"0.7963","Log Loss":"0.45738"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-ipinyou","task":"Click-Through Rate Prediction","dataset":"iPinYou","model":"FNN","rank_in_archive_order":7,"of":7,"metrics":{"AUC":"0.7619"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1601.02376","atlas_url":"https://app.syntology.ai/?focus=1601.02376","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1601.02376"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1601.02376\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1601.02376"},"call":"get_concepts_for_paper(arxiv_id=\"1601.02376\")"}],"by_repo":[{"repo":"wnzhang/deep-ctr","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"UlionTse/mlgb","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ddatta-DAC/Learning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"shenweichen/DeepCTR","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1803.05170"],"harvested_for_calls":[{"arxiv_id":"1803.05170","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1803.05170"},"call":"get_harvested_code_for_paper(arxiv_id=\"1803.05170\")"}]},{"repo":"shenweichen/DeepCTR-Torch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2008.13535"],"harvested_for_calls":[{"arxiv_id":"2008.13535","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2008.13535"},"call":"get_harvested_code_for_paper(arxiv_id=\"2008.13535\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"a779a458087b94b08997000f1c7e2aaf19eee539f32e222dbda78fc0d0815df5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}