{"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/factorization-machines","title":"Factorization Machines","arxiv_id":null,"date":"2011-01-20","proceeding":"2010/01/01 2010 1","authors":["Steffen Rendle"],"abstract":"In this paper, we introduce Factorization Machines\r\n(FM) which are a new model class that combines the advantages\r\nof Support Vector Machines (SVM) with factorization models.\r\nLike SVMs, FMs are a general predictor working with any\r\nreal valued feature vector. In contrast to SVMs, FMs model all\r\ninteractions between variables using factorized parameters. Thus\r\nthey are able to estimate interactions even in problems with huge\r\nsparsity (like recommender systems) where SVMs fail. We show\r\nthat the model equation of FMs can be calculated in linear time\r\nand thus FMs can be optimized directly. So unlike nonlinear\r\nSVMs, a transformation in the dual form is not necessary and\r\nthe model parameters can be estimated directly without the need\r\nof any support vector in the solution. We show the relationship\r\nto SVMs and the advantages of FMs for parameter estimation\r\nin sparse settings.\r\nOn the other hand there are many different factorization models like matrix factorization, parallel factor analysis or specialized\r\nmodels like SVD++, PITF or FPMC. The drawback of these\r\nmodels is that they are not applicable for general prediction tasks\r\nbut work only with special input data. Furthermore their model\r\nequations and optimization algorithms are derived individually\r\nfor each task. We show that FMs can mimic these models just\r\nby specifying the input data (i.e. the feature vectors). This makes\r\nFMs easily applicable even for users without expert knowledge\r\nin factorization models.\r\nIndex Terms—factorization machine; sparse data; tensor factorization; support vector machine","url_abs":"https://ieeexplore.ieee.org/document/5694074","url_pdf":"https://www.csie.ntu.edu.tw/~b97053/paper/Rendle2010FM.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":"factorization-machines","repo_url":"https://github.com/PaddlePaddle/PaddleRec/tree/release/2.1.0/models/rank/fm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"paddle","reach":null},{"paper_slug":"factorization-machines","repo_url":"https://github.com/UlionTse/mlgb","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"},{"task_slug":"parameter-estimation","task_name":"parameter estimation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"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":"UlionTse/mlgb","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"0bd63108fdf3938df030f2559101ff9f1556e9b9f3b1337503f2e577c6927ac1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}