{"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/divide-and-conquer-networks","title":"Divide and Conquer Networks","arxiv_id":"1611.02401","date":"2016-11-08","proceeding":"ICLR 2018 1","authors":["Alex Nowak-Vila","David Folqué","Joan Bruna"],"abstract":"We consider the learning of algorithmic tasks by mere observation of\ninput-output pairs. Rather than studying this as a black-box discrete\nregression problem with no assumption whatsoever on the input-output mapping,\nwe concentrate on tasks that are amenable to the principle of divide and\nconquer, and study what are its implications in terms of learning. This\nprinciple creates a powerful inductive bias that we leverage with neural\narchitectures that are defined recursively and dynamically, by learning two\nscale-invariant atomic operations: how to split a given input into smaller\nsets, and how to merge two partially solved tasks into a larger partial\nsolution. Our model can be trained in weakly supervised environments, namely by\njust observing input-output pairs, and in even weaker environments, using a\nnon-differentiable reward signal. Moreover, thanks to the dynamic aspect of our\narchitecture, we can incorporate the computational complexity as a\nregularization term that can be optimized by backpropagation. We demonstrate\nthe flexibility and efficiency of the Divide-and-Conquer Network on several\ncombinatorial and geometric tasks: convex hull, clustering, knapsack and\neuclidean TSP. Thanks to the dynamic programming nature of our model, we show\nsignificant improvements in terms of generalization error and computational\ncomplexity.","url_abs":"http://arxiv.org/abs/1611.02401v7","url_pdf":"http://arxiv.org/pdf/1611.02401v7.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":"divide-and-conquer-networks","repo_url":"https://github.com/alexnowakvila/DiCoNet","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"inductive-bias","task_name":"Inductive Bias"}],"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":"alexnowakvila/DiCoNet","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":"4192f9869c521a0f5b51ae68e0d50c54f24efe9ac0a6782f6380a590c67aeb0a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}