{"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/discrete-factorization-machines-for-fast","title":"Discrete Factorization Machines for Fast Feature-based Recommendation","arxiv_id":"1805.02232","date":"2018-05-06","proceeding":null,"authors":["Han Liu","Xiangnan He","Fuli Feng","Liqiang Nie","Rui Liu","Hanwang Zhang"],"abstract":"User and item features of side information are crucial for accurate\nrecommendation. However, the large number of feature dimensions, e.g., usually\nlarger than 10^7, results in expensive storage and computational cost. This\nprohibits fast recommendation especially on mobile applications where the\ncomputational resource is very limited. In this paper, we develop a generic\nfeature-based recommendation model, called Discrete Factorization Machine\n(DFM), for fast and accurate recommendation. DFM binarizes the real-valued\nmodel parameters (e.g., float32) of every feature embedding into binary codes\n(e.g., boolean), and thus supports efficient storage and fast user-item score\ncomputation. To avoid the severe quantization loss of the binarization, we\npropose a convergent updating rule that resolves the challenging discrete\noptimization of DFM. Through extensive experiments on two real-world datasets,\nwe show that 1) DFM consistently outperforms state-of-the-art binarized\nrecommendation models, and 2) DFM shows very competitive performance compared\nto its real-valued version (FM), demonstrating the minimized quantization loss.\nThis work is accepted by IJCAI 2018.","url_abs":"http://arxiv.org/abs/1805.02232v3","url_pdf":"http://arxiv.org/pdf/1805.02232v3.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":"discrete-factorization-machines-for-fast","repo_url":"https://github.com/hanliu95/DFM","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"binarization","task_name":"Binarization"},{"task_slug":"quantization","task_name":"Quantization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1805.02232","atlas_url":"https://app.syntology.ai/?focus=1805.02232","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":"1805.02232"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1805.02232\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1805.02232"},"call":"get_concepts_for_paper(arxiv_id=\"1805.02232\")"}],"by_repo":[{"repo":"hanliu95/DFM","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"4100b112882e151e8b07618e89ed6270cf88570cf720524b8f2fc1e9650d19e6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}