{"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/differentiation-of-blackbox-combinatorial-1","title":"Differentiation of Blackbox Combinatorial Solvers","arxiv_id":"1912.02175","date":"2019-12-04","proceeding":"ICLR 2020 1","authors":["Marin Vlastelica","Anselm Paulus","Vít Musil","Georg Martius","Michal Rolínek"],"abstract":"Achieving fusion of deep learning with combinatorial algorithms promises transformative changes to artificial intelligence. One possible approach is to introduce combinatorial building blocks into neural networks. Such end-to-end architectures have the potential to tackle combinatorial problems on raw input data such as ensuring global consistency in multi-object tracking or route planning on maps in robotics. In this work, we present a method that implements an efficient backward pass through blackbox implementations of combinatorial solvers with linear objective functions. We provide both theoretical and experimental backing. In particular, we incorporate the Gurobi MIP solver, Blossom V algorithm, and Dijkstra's algorithm into architectures that extract suitable features from raw inputs for the traveling salesman problem, the min-cost perfect matching problem and the shortest path problem. The code is available at https://github.com/martius-lab/blackbox-backprop.","url_abs":"https://arxiv.org/abs/1912.02175v2","url_pdf":"https://arxiv.org/pdf/1912.02175v2.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":"differentiation-of-blackbox-combinatorial-1","repo_url":"https://github.com/martius-lab/blackbox-backprop","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"differentiation-of-blackbox-combinatorial-1","repo_url":"https://github.com/LouisBouvier/WarcraftShortestPaths.jl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"differentiation-of-blackbox-combinatorial-1","repo_url":"https://github.com/alanlahoud/datasp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"differentiation-of-blackbox-combinatorial-1","repo_url":"https://github.com/archettialberto/neural_weighted_a_star","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"differentiation-of-blackbox-combinatorial-1","repo_url":"https://github.com/khalil-research/pyepo","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"differentiation-of-blackbox-combinatorial-1","repo_url":"https://github.com/martius-lab/blackbox-differentiation-combinatorial-solvers","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"differentiation-of-blackbox-combinatorial-1","repo_url":"https://github.com/omron-sinicx/neural-astar","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"traveling-salesman-problem","task_name":"Traveling Salesman Problem"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1912.02175","atlas_url":"https://app.syntology.ai/?focus=1912.02175","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":"1912.02175"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1912.02175\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1912.02175"},"call":"get_concepts_for_paper(arxiv_id=\"1912.02175\")"}],"by_repo":[{"repo":"martius-lab/blackbox-backprop","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2003.11657"],"harvested_for_calls":[{"arxiv_id":"2003.11657","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2003.11657"},"call":"get_harvested_code_for_paper(arxiv_id=\"2003.11657\")"}]},{"repo":"LouisBouvier/WarcraftShortestPaths.jl","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"alanlahoud/datasp","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2405.04923"],"harvested_for_calls":[{"arxiv_id":"2405.04923","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2405.04923"},"call":"get_harvested_code_for_paper(arxiv_id=\"2405.04923\")"}]},{"repo":"archettialberto/neural_weighted_a_star","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2105.01480"],"harvested_for_calls":[{"arxiv_id":"2105.01480","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.01480"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.01480\")"}]},{"repo":"khalil-research/pyepo","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2206.14234"],"harvested_for_calls":[{"arxiv_id":"2206.14234","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2206.14234"},"call":"get_harvested_code_for_paper(arxiv_id=\"2206.14234\")"}]},{"repo":"martius-lab/blackbox-differentiation-combinatorial-solvers","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"omron-sinicx/neural-astar","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":"8e8bbf1d3b1b7a00ac04bb8273ab817c0a8ed7b9e5009f2180636823b3dbb447","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}