{"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/a-study-of-lagrangean-decompositions-and-dual","title":"A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching","arxiv_id":"1612.05476","date":"2016-12-16","proceeding":"CVPR 2017 7","authors":["Paul Swoboda","Carsten Rother","Hassan Abu Alhaija","Dagmar Kainmueller","Bogdan Savchynskyy"],"abstract":"We study the quadratic assignment problem, in computer vision also known as\ngraph matching. Two leading solvers for this problem optimize the Lagrange\ndecomposition duals with sub-gradient and dual ascent (also known as message\npassing) updates. We explore s direction further and propose several additional\nLagrangean relaxations of the graph matching problem along with corresponding\nalgorithms, which are all based on a common dual ascent framework. Our\nextensive empirical evaluation gives several theoretical insights and suggests\na new state-of-the-art any-time solver for the considered problem. Our\nimprovement over state-of-the-art is particularly visible on a new dataset with\nlarge-scale sparse problem instances containing more than 500 graph nodes each.","url_abs":"http://arxiv.org/abs/1612.05476v2","url_pdf":"http://arxiv.org/pdf/1612.05476v2.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":"a-study-of-lagrangean-decompositions-and-dual","repo_url":"https://github.com/pawelswoboda/LP_MP","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"graph-matching","task_name":"Graph Matching"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1612.05476","atlas_url":"https://app.syntology.ai/?focus=1612.05476","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":"1612.05476"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1612.05476\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1612.05476"},"call":"get_concepts_for_paper(arxiv_id=\"1612.05476\")"}],"by_repo":[{"repo":"pawelswoboda/LP_MP","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":"abef04155b98c04f039de8f3b30354e26f75fbc098238efbd26b094fca24b468","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}