{"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/architectural-complexity-measures-of","title":"Architectural Complexity Measures of Recurrent Neural Networks","arxiv_id":"1602.08210","date":"2016-02-26","proceeding":"NeurIPS 2016 12","authors":["Saizheng Zhang","Yuhuai Wu","Tong Che","Zhouhan Lin","Roland Memisevic","Ruslan Salakhutdinov","Yoshua Bengio"],"abstract":"In this paper, we systematically analyze the connecting architectures of\nrecurrent neural networks (RNNs). Our main contribution is twofold: first, we\npresent a rigorous graph-theoretic framework describing the connecting\narchitectures of RNNs in general. Second, we propose three architecture\ncomplexity measures of RNNs: (a) the recurrent depth, which captures the RNN's\nover-time nonlinear complexity, (b) the feedforward depth, which captures the\nlocal input-output nonlinearity (similar to the \"depth\" in feedforward neural\nnetworks (FNNs)), and (c) the recurrent skip coefficient which captures how\nrapidly the information propagates over time. We rigorously prove each\nmeasure's existence and computability. Our experimental results show that RNNs\nmight benefit from larger recurrent depth and feedforward depth. We further\ndemonstrate that increasing recurrent skip coefficient offers performance\nboosts on long term dependency problems.","url_abs":"http://arxiv.org/abs/1602.08210v3","url_pdf":"http://arxiv.org/pdf/1602.08210v3.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":"language-modelling","task_name":"Language Modelling"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/language-modelling-on-text8","task":"Language Modelling","dataset":"Text8","model":"td-LSTM-large","rank_in_archive_order":23,"of":24,"metrics":{"Bit per Character (BPC)":"1.49"},"uses_additional_data":false},{"leaderboard":"/sota/language-modelling-on-text8","task":"Language Modelling","dataset":"Text8","model":"td-LSTM (Zhang et al., 2016)","rank_in_archive_order":24,"of":24,"metrics":{"Bit per Character (BPC)":"1.63"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1602.08210","atlas_url":"https://app.syntology.ai/?focus=1602.08210","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":"1602.08210"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1602.08210\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1602.08210"},"call":"get_concepts_for_paper(arxiv_id=\"1602.08210\")"}],"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":"639779da38ab8cafea6db4ef9a39d0dea2b9603e13ffa36f133ac227ed6717b4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}