{"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/visualisation-and-diagnostic-classifiers","title":"Visualisation and 'diagnostic classifiers' reveal how recurrent and recursive neural networks process hierarchical structure","arxiv_id":"1711.10203","date":"2017-11-28","proceeding":null,"authors":["Dieuwke Hupkes","Sara Veldhoen","Willem Zuidema"],"abstract":"We investigate how neural networks can learn and process languages with\nhierarchical, compositional semantics. To this end, we define the artificial\ntask of processing nested arithmetic expressions, and study whether different\ntypes of neural networks can learn to compute their meaning. We find that\nrecursive neural networks can find a generalising solution to this problem, and\nwe visualise this solution by breaking it up in three steps: project, sum and\nsquash. As a next step, we investigate recurrent neural networks, and show that\na gated recurrent unit, that processes its input incrementally, also performs\nvery well on this task. To develop an understanding of what the recurrent\nnetwork encodes, visualisation techniques alone do not suffice. Therefore, we\ndevelop an approach where we formulate and test multiple hypotheses on the\ninformation encoded and processed by the network. For each hypothesis, we\nderive predictions about features of the hidden state representations at each\ntime step, and train 'diagnostic classifiers' to test those predictions. Our\nresults indicate that the networks follow a strategy similar to our\nhypothesised 'cumulative strategy', which explains the high accuracy of the\nnetwork on novel expressions, the generalisation to longer expressions than\nseen in training, and the mild deterioration with increasing length. This is\nturn shows that diagnostic classifiers can be a useful technique for opening up\nthe black box of neural networks. We argue that diagnostic classification,\nunlike most visualisation techniques, does scale up from small networks in a\ntoy domain, to larger and deeper recurrent networks dealing with real-life\ndata, and may therefore contribute to a better understanding of the internal\ndynamics of current state-of-the-art models in natural language processing.","url_abs":"http://arxiv.org/abs/1711.10203v2","url_pdf":"http://arxiv.org/pdf/1711.10203v2.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":"visualisation-and-diagnostic-classifiers","repo_url":"https://github.com/dieuwkehupkes/processing_arithmetics","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"diagnostic","task_name":"Diagnostic"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1711.10203","atlas_url":"https://app.syntology.ai/?focus=1711.10203","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":"1711.10203"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1711.10203\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1711.10203"},"call":"get_concepts_for_paper(arxiv_id=\"1711.10203\")"}],"by_repo":[{"repo":"dieuwkehupkes/processing_arithmetics","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":"a9bbf95bb34cf8833001aa12d32324a7021ec9649781a0110154e2dc995f21ef","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}