{"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/compressing-recurrent-neural-networks-with","title":"Compressing Recurrent Neural Networks with Tensor Ring for Action Recognition","arxiv_id":"1811.07503","date":"2018-11-19","proceeding":"NIPS Workshop CDNNRIA 2018","authors":["Yu Pan","Jing Xu","Maolin Wang","Jinmian Ye","Fei Wang","Kun Bai","Zenglin Xu"],"abstract":"Recurrent Neural Networks (RNNs) and their variants, such as Long-Short Term\nMemory (LSTM) networks, and Gated Recurrent Unit (GRU) networks, have achieved\npromising performance in sequential data modeling. The hidden layers in RNNs\ncan be regarded as the memory units, which are helpful in storing information\nin sequential contexts. However, when dealing with high dimensional input data,\nsuch as video and text, the input-to-hidden linear transformation in RNNs\nbrings high memory usage and huge computational cost. This makes the training\nof RNNs unscalable and difficult. To address this challenge, we propose a novel\ncompact LSTM model, named as TR-LSTM, by utilizing the low-rank tensor ring\ndecomposition (TRD) to reformulate the input-to-hidden transformation. Compared\nwith other tensor decomposition methods, TR-LSTM is more stable. In addition,\nTR-LSTM can complete an end-to-end training and also provide a fundamental\nbuilding block for RNNs in handling large input data. Experiments on real-world\naction recognition datasets have demonstrated the promising performance of the\nproposed TR-LSTM compared with the tensor train LSTM and other state-of-the-art\ncompetitors.","url_abs":"http://arxiv.org/abs/1811.07503v1","url_pdf":"http://arxiv.org/pdf/1811.07503v1.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":"compressing-recurrent-neural-networks-with","repo_url":"https://github.com/tnbar/tednet","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"action-recognition-in-videos","task_name":"Action Recognition"},{"task_slug":"action-recognition","task_name":"Temporal Action Localization"},{"task_slug":"tensor-decomposition","task_name":"Tensor Decomposition"}],"methods":[{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1811.07503","atlas_url":"https://app.syntology.ai/?focus=1811.07503","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":"1811.07503"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1811.07503\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1811.07503"},"call":"get_concepts_for_paper(arxiv_id=\"1811.07503\")"}],"by_repo":[{"repo":"tnbar/tednet","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2205.15307"],"harvested_for_calls":[{"arxiv_id":"2205.15307","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2205.15307"},"call":"get_harvested_code_for_paper(arxiv_id=\"2205.15307\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"96402c4f35b09ab85cfe3f1e43c39be16d8b1db51876abf8443e1a21f833b3cf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}