{"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/complex-unitary-recurrent-neural-networks","title":"Complex Unitary Recurrent Neural Networks using Scaled Cayley Transform","arxiv_id":"1811.04142","date":"2018-11-09","proceeding":null,"authors":["Kehelwala D. G. Maduranga","Kyle E. Helfrich","Qiang Ye"],"abstract":"Recurrent neural networks (RNNs) have been successfully used on a wide range\nof sequential data problems. A well known difficulty in using RNNs is the\n\\textit{vanishing or exploding gradient} problem. Recently, there have been\nseveral different RNN architectures that try to mitigate this issue by\nmaintaining an orthogonal or unitary recurrent weight matrix. One such\narchitecture is the scaled Cayley orthogonal recurrent neural network (scoRNN)\nwhich parameterizes the orthogonal recurrent weight matrix through a scaled\nCayley transform. This parametrization contains a diagonal scaling matrix\nconsisting of positive or negative one entries that can not be optimized by\ngradient descent. Thus the scaling matrix is fixed before training and a\nhyperparameter is introduced to tune the matrix for each particular task. In\nthis paper, we develop a unitary RNN architecture based on a complex scaled\nCayley transform. Unlike the real orthogonal case, the transformation uses a\ndiagonal scaling matrix consisting of entries on the complex unit circle which\ncan be optimized using gradient descent and no longer requires the tuning of a\nhyperparameter. We also provide an analysis of a potential issue of the modReLU\nactiviation function which is used in our work and several other unitary RNNs.\nIn the experiments conducted, the scaled Cayley unitary recurrent neural\nnetwork (scuRNN) achieves comparable or better results than scoRNN and other\nunitary RNNs without fixing the scaling matrix.","url_abs":"http://arxiv.org/abs/1811.04142v2","url_pdf":"http://arxiv.org/pdf/1811.04142v2.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":"complex-unitary-recurrent-neural-networks","repo_url":"https://github.com/Gayan225/scuRNN","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[],"methods":[{"method_slug":"unitary-rnn","method_name":"Unitary RNN"},{"method_slug":"modrelu","method_name":"modReLU"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1811.04142","atlas_url":"https://app.syntology.ai/?focus=1811.04142","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.04142"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1811.04142\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1811.04142"},"call":"get_concepts_for_paper(arxiv_id=\"1811.04142\")"}],"by_repo":[{"repo":"Gayan225/scuRNN","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":"fdbd06e17aee81ec26900a18d1be68bd76acb967944709c8fd555573ff301448","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}