{"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/attentional-factorization-machines-learning","title":"Attentional Factorization Machines: Learning the Weight of Feature Interactions via Attention Networks","arxiv_id":"1708.04617","date":"2017-08-15","proceeding":null,"authors":["Jun Xiao","Hao Ye","Xiangnan He","Hanwang Zhang","Fei Wu","Tat-Seng Chua"],"abstract":"Factorization Machines (FMs) are a supervised learning approach that enhances\nthe linear regression model by incorporating the second-order feature\ninteractions. Despite effectiveness, FM can be hindered by its modelling of all\nfeature interactions with the same weight, as not all feature interactions are\nequally useful and predictive. For example, the interactions with useless\nfeatures may even introduce noises and adversely degrade the performance. In\nthis work, we improve FM by discriminating the importance of different feature\ninteractions. We propose a novel model named Attentional Factorization Machine\n(AFM), which learns the importance of each feature interaction from data via a\nneural attention network. Extensive experiments on two real-world datasets\ndemonstrate the effectiveness of AFM. Empirically, it is shown on regression\ntask AFM betters FM with a $8.6\\%$ relative improvement, and consistently\noutperforms the state-of-the-art deep learning methods Wide&Deep and DeepCross\nwith a much simpler structure and fewer model parameters. Our implementation of\nAFM is publicly available at:\nhttps://github.com/hexiangnan/attentional_factorization_machine","url_abs":"http://arxiv.org/abs/1708.04617v1","url_pdf":"http://arxiv.org/pdf/1708.04617v1.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":"attentional-factorization-machines-learning","repo_url":"https://github.com/hexiangnan/attentional_factorization_machine","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"attentional-factorization-machines-learning","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":"attentional-factorization-machines-learning","repo_url":"https://github.com/hzn666/rlbid_ea","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"attentional-factorization-machines-learning","repo_url":"https://github.com/MindSpore-scientific-2/code-12/tree/main/factorized-attention","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"attentional-factorization-machines-learning","repo_url":"https://github.com/shenweichen/DeepCTR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null},{"paper_slug":"attentional-factorization-machines-learning","repo_url":"https://github.com/shenweichen/DeepCTR-Torch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"attentional-factorization-machines-learning","repo_url":"https://github.com/tangxyw/RecAlgorithm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"BSD-2-Clause"}},{"paper_slug":"attentional-factorization-machines-learning","repo_url":"https://github.com/xue-pai/FuxiCTR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"regression-1","task_name":"regression"}],"methods":[{"method_slug":"linear-regression","method_name":"Linear Regression"},{"method_slug":"wide-deep","method_name":"Wide&Deep"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1708.04617","atlas_url":"https://app.syntology.ai/?focus=1708.04617","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":"1708.04617"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1708.04617\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1708.04617"},"call":"get_concepts_for_paper(arxiv_id=\"1708.04617\")"}],"by_repo":[{"repo":"hexiangnan/attentional_factorization_machine","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"UlionTse/mlgb","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"hzn666/rlbid_ea","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MindSpore-scientific-2/code-12","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2506.05982"],"harvested_for_calls":[{"arxiv_id":"2506.05982","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2506.05982"},"call":"get_harvested_code_for_paper(arxiv_id=\"2506.05982\")"}]},{"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":"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":"ecb963203b4f4d72ea7f1ad33a7a4322fd8e74cc1379ebaa4f740f649680ad6d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}