{"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/neural-factorization-machines-for-sparse","title":"Neural Factorization Machines for Sparse Predictive Analytics","arxiv_id":"1708.05027","date":"2017-08-16","proceeding":null,"authors":["Xiangnan He","Tat-Seng Chua"],"abstract":"Many predictive tasks of web applications need to model categorical\nvariables, such as user IDs and demographics like genders and occupations. To\napply standard machine learning techniques, these categorical predictors are\nalways converted to a set of binary features via one-hot encoding, making the\nresultant feature vector highly sparse. To learn from such sparse data\neffectively, it is crucial to account for the interactions between features.\n  Factorization Machines (FMs) are a popular solution for efficiently using the\nsecond-order feature interactions. However, FM models feature interactions in a\nlinear way, which can be insufficient for capturing the non-linear and complex\ninherent structure of real-world data. While deep neural networks have recently\nbeen applied to learn non-linear feature interactions in industry, such as the\nWide&Deep by Google and DeepCross by Microsoft, the deep structure meanwhile\nmakes them difficult to train.\n  In this paper, we propose a novel model Neural Factorization Machine (NFM)\nfor prediction under sparse settings. NFM seamlessly combines the linearity of\nFM in modelling second-order feature interactions and the non-linearity of\nneural network in modelling higher-order feature interactions. Conceptually,\nNFM is more expressive than FM since FM can be seen as a special case of NFM\nwithout hidden layers. Empirical results on two regression tasks show that with\none hidden layer only, NFM significantly outperforms FM with a 7.3% relative\nimprovement. Compared to the recent deep learning methods Wide&Deep and\nDeepCross, our NFM uses a shallower structure but offers better performance,\nbeing much easier to train and tune in practice.","url_abs":"http://arxiv.org/abs/1708.05027v1","url_pdf":"http://arxiv.org/pdf/1708.05027v1.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":"neural-factorization-machines-for-sparse","repo_url":"https://github.com/hexiangnan/neural_factorization_machine","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"neural-factorization-machines-for-sparse","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":"neural-factorization-machines-for-sparse","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":"neural-factorization-machines-for-sparse","repo_url":"https://github.com/shenweichen/DeepCTR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"neural-factorization-machines-for-sparse","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":"neural-factorization-machines-for-sparse","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":"link-prediction","task_name":"Link Prediction"}],"methods":[{"method_slug":"wide-deep","method_name":"Wide&Deep"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/link-prediction-on-movielens-25m","task":"Link Prediction","dataset":"MovieLens 25M","model":"NFM","rank_in_archive_order":2,"of":7,"metrics":{"Hits@10":"0.8132","nDCG@10":"0.5347"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-yelp","task":"Link Prediction","dataset":"Yelp","model":"NFM","rank_in_archive_order":4,"of":9,"metrics":{"HR@10":"0.8595","nDCG@10":"0.6062"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1708.05027","atlas_url":"https://app.syntology.ai/?focus=1708.05027","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.05027"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1708.05027\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1708.05027"},"call":"get_concepts_for_paper(arxiv_id=\"1708.05027\")"}],"by_repo":[{"repo":"hexiangnan/neural_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":"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":"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":"c16d3174dfe3cbca186b405fae5e777fb782f9a15d8cba2402638e5a763e5c6a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}