{"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/product-based-neural-networks-for-user","title":"Product-based Neural Networks for User Response Prediction","arxiv_id":"1611.00144","date":"2016-11-01","proceeding":null,"authors":["Yanru Qu","Han Cai","Kan Ren","Wei-Nan Zhang","Yong Yu","Ying Wen","Jun Wang"],"abstract":"Predicting user responses, such as clicks and conversions, is of great\nimportance and has found its usage in many Web applications including\nrecommender systems, web search and online advertising. The data in those\napplications is mostly categorical and contains multiple fields; a typical\nrepresentation is to transform it into a high-dimensional sparse binary feature\nrepresentation via one-hot encoding. Facing with the extreme sparsity,\ntraditional models may limit their capacity of mining shallow patterns from the\ndata, i.e. low-order feature combinations. Deep models like deep neural\nnetworks, on the other hand, cannot be directly applied for the\nhigh-dimensional input because of the huge feature space. In this paper, we\npropose a Product-based Neural Networks (PNN) with an embedding layer to learn\na distributed representation of the categorical data, a product layer to\ncapture interactive patterns between inter-field categories, and further fully\nconnected layers to explore high-order feature interactions. Our experimental\nresults on two large-scale real-world ad click datasets demonstrate that PNNs\nconsistently outperform the state-of-the-art models on various metrics.","url_abs":"http://arxiv.org/abs/1611.00144v1","url_pdf":"http://arxiv.org/pdf/1611.00144v1.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":"product-based-neural-networks-for-user","repo_url":"https://github.com/Atomu2014/product-nets","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"product-based-neural-networks-for-user","repo_url":"https://github.com/Atomu2014/product-nets-distributed","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"product-based-neural-networks-for-user","repo_url":"https://github.com/JianzhouZhan/Awesome-RecSystem-Models","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"product-based-neural-networks-for-user","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":"product-based-neural-networks-for-user","repo_url":"https://github.com/jamesdvance/predicting_clicks","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"product-based-neural-networks-for-user","repo_url":"https://github.com/shenweichen/DeepCTR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"product-based-neural-networks-for-user","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"}},{"paper_slug":"product-based-neural-networks-for-user","repo_url":"https://github.com/tangxyw/RecAlgorithm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"BSD-2-Clause"}},{"paper_slug":"product-based-neural-networks-for-user","repo_url":"https://github.com/wangweitong/DL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"product-based-neural-networks-for-user","repo_url":"https://github.com/wangweitong/recommend_system","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"product-based-neural-networks-for-user","repo_url":"https://github.com/xue-pai/FuxiCTR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"click-through-rate-prediction","task_name":"Click-Through Rate Prediction"},{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/click-through-rate-prediction-on-amazon","task":"Click-Through Rate Prediction","dataset":"Amazon","model":"PNN","rank_in_archive_order":4,"of":5,"metrics":{"AUC":"0.8679"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-bing-news","task":"Click-Through Rate Prediction","dataset":"Bing News","model":"PNN","rank_in_archive_order":4,"of":7,"metrics":{"AUC":"0.8321","Log Loss":"0.2775"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-company","task":"Click-Through Rate Prediction","dataset":"Company*","model":"PNN*","rank_in_archive_order":4,"of":8,"metrics":{"AUC":"0.8672","Log Loss":"0.02636"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-company","task":"Click-Through Rate Prediction","dataset":"Company*","model":"IPNN","rank_in_archive_order":5,"of":8,"metrics":{"AUC":"0.8664","Log Loss":"0.02637"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-company","task":"Click-Through Rate Prediction","dataset":"Company*","model":"OPNN","rank_in_archive_order":7,"of":8,"metrics":{"AUC":"0.8658","Log Loss":"0.02641"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-criteo","task":"Click-Through Rate Prediction","dataset":"Criteo","model":"PNN*","rank_in_archive_order":35,"of":39,"metrics":{"AUC":"0.7987","Log Loss":"0.45214"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-criteo","task":"Click-Through Rate Prediction","dataset":"Criteo","model":"OPNN","rank_in_archive_order":36,"of":39,"metrics":{"AUC":"0.7982","Log Loss":"0.45256"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-criteo","task":"Click-Through Rate Prediction","dataset":"Criteo","model":"IPNN","rank_in_archive_order":38,"of":39,"metrics":{"AUC":"0.7972","Log Loss":"0.45323"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-dianping","task":"Click-Through Rate Prediction","dataset":"Dianping","model":"PNN","rank_in_archive_order":3,"of":5,"metrics":{"AUC":"0.8445","Log Loss":"0.3424"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-movielens","task":"Click-Through Rate Prediction","dataset":"MovieLens 20M","model":"PNN","rank_in_archive_order":5,"of":6,"metrics":{"AUC":"0.7321"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-ipinyou","task":"Click-Through Rate Prediction","dataset":"iPinYou","model":"OPNN","rank_in_archive_order":1,"of":7,"metrics":{"AUC":"0.8174"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-ipinyou","task":"Click-Through Rate Prediction","dataset":"iPinYou","model":"IPNN","rank_in_archive_order":2,"of":7,"metrics":{"AUC":"0.7914"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-ipinyou","task":"Click-Through Rate Prediction","dataset":"iPinYou","model":"PNN*","rank_in_archive_order":6,"of":7,"metrics":{"AUC":"0.7661"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1611.00144","atlas_url":"https://app.syntology.ai/?focus=1611.00144","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":"1611.00144"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1611.00144\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1611.00144"},"call":"get_concepts_for_paper(arxiv_id=\"1611.00144\")"}],"by_repo":[{"repo":"Atomu2014/product-nets","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Atomu2014/product-nets-distributed","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"JianzhouZhan/Awesome-RecSystem-Models","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":"UlionTse/mlgb","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"jamesdvance/predicting_clicks","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\")"}]},{"repo":"tangxyw/RecAlgorithm","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1905.09433"],"harvested_for_calls":[{"arxiv_id":"1905.09433","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1905.09433"},"call":"get_harvested_code_for_paper(arxiv_id=\"1905.09433\")"}]},{"repo":"wangweitong/DL","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1708.05123","1803.05170"],"harvested_for_calls":[{"arxiv_id":"1708.05123","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1708.05123"},"call":"get_harvested_code_for_paper(arxiv_id=\"1708.05123\")"},{"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":"wangweitong/recommend_system","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"xue-pai/FuxiCTR","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2203.16218"],"harvested_for_calls":[{"arxiv_id":"2203.16218","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2203.16218"},"call":"get_harvested_code_for_paper(arxiv_id=\"2203.16218\")"}]}],"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":"8d6c6137f5cedef10d82e9b4d419438de1ac28716fdec459d576b0b02b5d6bb6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}