{"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/primal-dual-algorithms-for-non-negative","title":"Primal-Dual Algorithms for Non-negative Matrix Factorization with the Kullback-Leibler Divergence","arxiv_id":"1412.1788","date":"2014-12-04","proceeding":null,"authors":["Felipe Yanez","Francis Bach"],"abstract":"Non-negative matrix factorization (NMF) approximates a given matrix as a\nproduct of two non-negative matrices. Multiplicative algorithms deliver\nreliable results, but they show slow convergence for high-dimensional data and\nmay be stuck away from local minima. Gradient descent methods have better\nbehavior, but only apply to smooth losses such as the least-squares loss. In\nthis article, we propose a first-order primal-dual algorithm for non-negative\ndecomposition problems (where one factor is fixed) with the KL divergence,\nbased on the Chambolle-Pock algorithm. All required computations may be\nobtained in closed form and we provide an efficient heuristic way to select\nstep-sizes. By using alternating optimization, our algorithm readily extends to\nNMF and, on synthetic examples, face recognition or music source separation\ndatasets, it is either faster than existing algorithms, or leads to improved\nlocal optima, or both.","url_abs":"http://arxiv.org/abs/1412.1788v1","url_pdf":"http://arxiv.org/pdf/1412.1788v1.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":"primal-dual-algorithms-for-non-negative","repo_url":"https://github.com/felipeyanez/nmf","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"primal-dual-algorithms-for-non-negative","repo_url":"https://github.com/fnyanez/nmf","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"face-recognition","task_name":"Face Recognition"},{"task_slug":"music-source-separation","task_name":"Music Source Separation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"felipeyanez/nmf","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"fnyanez/nmf","kind":"listed","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":"b73b4a215ecf36f2b0decb3c63b7108fd36c1a11f59e5d7a57bdb82302288b72","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}