{"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/expressive-power-of-recurrent-neural-networks","title":"Expressive power of recurrent neural networks","arxiv_id":"1711.00811","date":"2017-11-02","proceeding":"ICLR 2018 1","authors":["Valentin Khrulkov","Alexander Novikov","Ivan Oseledets"],"abstract":"Deep neural networks are surprisingly efficient at solving practical tasks,\nbut the theory behind this phenomenon is only starting to catch up with the\npractice. Numerous works show that depth is the key to this efficiency. A\ncertain class of deep convolutional networks -- namely those that correspond to\nthe Hierarchical Tucker (HT) tensor decomposition -- has been proven to have\nexponentially higher expressive power than shallow networks. I.e. a shallow\nnetwork of exponential width is required to realize the same score function as\ncomputed by the deep architecture. In this paper, we prove the expressive power\ntheorem (an exponential lower bound on the width of the equivalent shallow\nnetwork) for a class of recurrent neural networks -- ones that correspond to\nthe Tensor Train (TT) decomposition. This means that even processing an image\npatch by patch with an RNN can be exponentially more efficient than a (shallow)\nconvolutional network with one hidden layer. Using theoretical results on the\nrelation between the tensor decompositions we compare expressive powers of the\nHT- and TT-Networks. We also implement the recurrent TT-Networks and provide\nnumerical evidence of their expressivity.","url_abs":"http://arxiv.org/abs/1711.00811v2","url_pdf":"http://arxiv.org/pdf/1711.00811v2.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":"expressive-power-of-recurrent-neural-networks","repo_url":"https://github.com/rballester/tntorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"LGPL-3.0"}},{"paper_slug":"expressive-power-of-recurrent-neural-networks","repo_url":"https://github.com/vmml/tntorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"LGPL-3.0"}}],"tasks":[{"task_slug":"tensor-decomposition","task_name":"Tensor Decomposition"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1711.00811","atlas_url":"https://app.syntology.ai/?focus=1711.00811","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.00811"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1711.00811\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1711.00811"},"call":"get_concepts_for_paper(arxiv_id=\"1711.00811\")"}],"by_repo":[{"repo":"rballester/tntorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"vmml/tntorch","kind":"listed","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":"16099b7260312960127273b25a418fd41f6a8337745d30bf757947633adb2373","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}