{"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/on-orthogonality-and-learning-recurrent","title":"On orthogonality and learning recurrent networks with long term dependencies","arxiv_id":"1702.00071","date":"2017-01-31","proceeding":null,"authors":["Eugene Vorontsov","Chiheb Trabelsi","Samuel Kadoury","Chris Pal"],"abstract":"It is well known that it is challenging to train deep neural networks and\nrecurrent neural networks for tasks that exhibit long term dependencies. The\nvanishing or exploding gradient problem is a well known issue associated with\nthese challenges. One approach to addressing vanishing and exploding gradients\nis to use either soft or hard constraints on weight matrices so as to encourage\nor enforce orthogonality. Orthogonal matrices preserve gradient norm during\nbackpropagation and may therefore be a desirable property. This paper explores\nissues with optimization convergence, speed and gradient stability when\nencouraging or enforcing orthogonality. To perform this analysis, we propose a\nweight matrix factorization and parameterization strategy through which we can\nbound matrix norms and therein control the degree of expansivity induced during\nbackpropagation. We find that hard constraints on orthogonality can negatively\naffect the speed of convergence and model performance.","url_abs":"http://arxiv.org/abs/1702.00071v4","url_pdf":"http://arxiv.org/pdf/1702.00071v4.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":"on-orthogonality-and-learning-recurrent","repo_url":"https://github.com/veugene/spectre_release","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1702.00071","atlas_url":"https://app.syntology.ai/?focus=1702.00071","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":"1702.00071"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1702.00071\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1702.00071"},"call":"get_concepts_for_paper(arxiv_id=\"1702.00071\")"}],"by_repo":[{"repo":"veugene/spectre_release","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":"2d6ceb1fe702fa9debef183ee65c72db576f5a8b3105c0e74456a13a46586282","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}