{"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/ddrprog-a-clevr-differentiable-dynamic","title":"DDRprog: A CLEVR Differentiable Dynamic Reasoning Programmer","arxiv_id":"1803.11361","date":"2018-03-30","proceeding":"ICLR 2018 1","authors":["Joseph Suarez","Justin Johnson","Fei-Fei Li"],"abstract":"We present a novel Dynamic Differentiable Reasoning (DDR) framework for\njointly learning branching programs and the functions composing them; this\nresolves a significant nondifferentiability inhibiting recent dynamic\narchitectures. We apply our framework to two settings in two highly compact and\ndata efficient architectures: DDRprog for CLEVR Visual Question Answering and\nDDRstack for reverse Polish notation expression evaluation. DDRprog uses a\nrecurrent controller to jointly predict and execute modular neural programs\nthat directly correspond to the underlying question logic; it explicitly forks\nsubprocesses to handle logical branching. By effectively leveraging additional\nstructural supervision, we achieve a large improvement over previous approaches\nin subtask consistency and a small improvement in overall accuracy. We further\ndemonstrate the benefits of structural supervision in the RPN setting: the\ninclusion of a stack assumption in DDRstack allows our approach to generalize\nto long expressions where an LSTM fails the task.","url_abs":"http://arxiv.org/abs/1803.11361v1","url_pdf":"http://arxiv.org/pdf/1803.11361v1.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":[],"tasks":[{"task_slug":"question-answering","task_name":"Question Answering"},{"task_slug":"visual-question-answering-1","task_name":"Visual Question Answering"},{"task_slug":"visual-question-answering","task_name":"Visual Question Answering (VQA)"}],"methods":[{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"rpn","method_name":"RPN"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/visual-question-answering-on-clevr","task":"Visual Question Answering (VQA)","dataset":"CLEVR","model":"DDRprog*","rank_in_archive_order":9,"of":15,"metrics":{"Accuracy":"98.3"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1803.11361","atlas_url":"https://app.syntology.ai/?focus=1803.11361","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":"1803.11361"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1803.11361\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1803.11361"},"call":"get_concepts_for_paper(arxiv_id=\"1803.11361\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"0c168e7acff428b6f71ae14e21f549cfd5dfffe5c8a4587286b039d800b72a7c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}