{"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-interest-network-for-click-through-rate","title":"Deep Interest Network for Click-Through Rate Prediction","arxiv_id":"1706.06978","date":"2017-06-21","proceeding":null,"authors":["Guorui Zhou","Chengru Song","Xiaoqiang Zhu","Ying Fan","Han Zhu","Xiao Ma","Yanghui Yan","Junqi Jin","Han Li","Kun Gai"],"abstract":"Click-through rate prediction is an essential task in industrial\napplications, such as online advertising. Recently deep learning based models\nhave been proposed, which follow a similar Embedding\\&MLP paradigm. In these\nmethods large scale sparse input features are first mapped into low dimensional\nembedding vectors, and then transformed into fixed-length vectors in a\ngroup-wise manner, finally concatenated together to fed into a multilayer\nperceptron (MLP) to learn the nonlinear relations among features. In this way,\nuser features are compressed into a fixed-length representation vector, in\nregardless of what candidate ads are. The use of fixed-length vector will be a\nbottleneck, which brings difficulty for Embedding\\&MLP methods to capture\nuser's diverse interests effectively from rich historical behaviors. In this\npaper, we propose a novel model: Deep Interest Network (DIN) which tackles this\nchallenge by designing a local activation unit to adaptively learn the\nrepresentation of user interests from historical behaviors with respect to a\ncertain ad. This representation vector varies over different ads, improving the\nexpressive ability of model greatly. Besides, we develop two techniques:\nmini-batch aware regularization and data adaptive activation function which can\nhelp training industrial deep networks with hundreds of millions of parameters.\nExperiments on two public datasets as well as an Alibaba real production\ndataset with over 2 billion samples demonstrate the effectiveness of proposed\napproaches, which achieve superior performance compared with state-of-the-art\nmethods. DIN now has been successfully deployed in the online display\nadvertising system in Alibaba, serving the main traffic.","url_abs":"http://arxiv.org/abs/1706.06978v4","url_pdf":"http://arxiv.org/pdf/1706.06978v4.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-interest-network-for-click-through-rate","repo_url":"https://github.com/zhougr1993/DeepInterestNetwork","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"deep-interest-network-for-click-through-rate","repo_url":"https://github.com/GitHub-HongweiZhang/prediction-flow","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"deep-interest-network-for-click-through-rate","repo_url":"https://github.com/StephenBo-China/DIEN-DIN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"deep-interest-network-for-click-through-rate","repo_url":"https://github.com/StephenBo-China/recommendation_system_sort_model","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"deep-interest-network-for-click-through-rate","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-interest-network-for-click-through-rate","repo_url":"https://github.com/YafeiWu/DIEN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"deep-interest-network-for-click-through-rate","repo_url":"https://github.com/YunjiaXi/Multi-Level-Interaction-Reranking","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"deep-interest-network-for-click-through-rate","repo_url":"https://github.com/imvishvaraj/ctr_nlp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"deep-interest-network-for-click-through-rate","repo_url":"https://github.com/johnlevi/recsys","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"deep-interest-network-for-click-through-rate","repo_url":"https://github.com/massquantity/LibRecommender","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"deep-interest-network-for-click-through-rate","repo_url":"https://github.com/mikudehuane/Configurable-Tensorflow-DIN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"deep-interest-network-for-click-through-rate","repo_url":"https://github.com/searchlink/din","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"deep-interest-network-for-click-through-rate","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-interest-network-for-click-through-rate","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":"deep-interest-network-for-click-through-rate","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":"deep-interest-network-for-click-through-rate","repo_url":"https://github.com/PaddlePaddle/PaddleRec/tree/master/models/rank/din","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"paddle","reach":null},{"paper_slug":"deep-interest-network-for-click-through-rate","repo_url":"https://github.com/alibaba/TorchEasyRec","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"deep-interest-network-for-click-through-rate","repo_url":"https://github.com/reczoo/FuxiCTR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"click-through-rate-prediction","task_name":"Click-Through Rate Prediction"},{"task_slug":"prediction","task_name":"Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/click-through-rate-prediction-on-amazon","task":"Click-Through Rate Prediction","dataset":"Amazon","model":"DIN + Dice Activation","rank_in_archive_order":1,"of":5,"metrics":{"AUC":"0.8871"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-amazon","task":"Click-Through Rate Prediction","dataset":"Amazon","model":"DIN","rank_in_archive_order":2,"of":5,"metrics":{"AUC":"0.8818"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-movielens","task":"Click-Through Rate Prediction","dataset":"MovieLens 20M","model":"DIN + Dice Activation","rank_in_archive_order":2,"of":6,"metrics":{"AUC":"0.7348"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-movielens","task":"Click-Through Rate Prediction","dataset":"MovieLens 20M","model":"DIN","rank_in_archive_order":3,"of":6,"metrics":{"AUC":"0.7337"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1706.06978","atlas_url":"https://app.syntology.ai/?focus=1706.06978","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":"1706.06978"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1706.06978\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1706.06978"},"call":"get_concepts_for_paper(arxiv_id=\"1706.06978\")"}],"by_repo":[{"repo":"zhougr1993/DeepInterestNetwork","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"GitHub-HongweiZhang/prediction-flow","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1809.03672"],"harvested_for_calls":[{"arxiv_id":"1809.03672","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1809.03672"},"call":"get_harvested_code_for_paper(arxiv_id=\"1809.03672\")"}]},{"repo":"StephenBo-China/DIEN-DIN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"StephenBo-China/recommendation_system_sort_model","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"UlionTse/mlgb","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"YafeiWu/DIEN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"YunjiaXi/Multi-Level-Interaction-Reranking","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2204.09370"],"harvested_for_calls":[{"arxiv_id":"2204.09370","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2204.09370"},"call":"get_harvested_code_for_paper(arxiv_id=\"2204.09370\")"}]},{"repo":"imvishvaraj/ctr_nlp","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"johnlevi/recsys","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"massquantity/LibRecommender","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2007.12865"],"harvested_for_calls":[{"arxiv_id":"2007.12865","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.12865"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.12865\")"}]},{"repo":"mikudehuane/Configurable-Tensorflow-DIN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"searchlink/din","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":"PaddlePaddle/PaddleRec","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2204.05125"],"harvested_for_calls":[{"arxiv_id":"2204.05125","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2204.05125"},"call":"get_harvested_code_for_paper(arxiv_id=\"2204.05125\")"}]},{"repo":"alibaba/TorchEasyRec","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2402.17152"],"harvested_for_calls":[{"arxiv_id":"2402.17152","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2402.17152"},"call":"get_harvested_code_for_paper(arxiv_id=\"2402.17152\")"}]},{"repo":"reczoo/FuxiCTR","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2304.00902"],"harvested_for_calls":[{"arxiv_id":"2304.00902","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2304.00902"},"call":"get_harvested_code_for_paper(arxiv_id=\"2304.00902\")"}]}],"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":"84faab79684bbffdb149806772932689c0158a806e75125e2baba2890bd01586","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}