{"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/spectral-ergodicity-in-deep-learning","title":"Spectral Ergodicity in Deep Learning Architectures via Surrogate Random Matrices","arxiv_id":"1704.08303","date":"2017-04-25","proceeding":null,"authors":["Mehmet Süzen","Cornelius Weber","Joan J. Cerdà"],"abstract":"In this work a novel method to quantify spectral ergodicity for random\nmatrices is presented. The new methodology combines approaches rooted in the\nmetrics of Thirumalai-Mountain (TM) and Kullbach-Leibler (KL) divergence. The\nmethod is applied to a general study of deep and recurrent neural networks via\nthe analysis of random matrix ensembles mimicking typical weight matrices of\nthose systems. In particular, we examine circular random matrix ensembles:\ncircular unitary ensemble (CUE), circular orthogonal ensemble (COE), and\ncircular symplectic ensemble (CSE). Eigenvalue spectra and spectral ergodicity\nare computed for those ensembles as a function of network size. It is observed\nthat as the matrix size increases the level of spectral ergodicity of the\nensemble rises, i.e., the eigenvalue spectra obtained for a single realisation\nat random from the ensemble is closer to the spectra obtained averaging over\nthe whole ensemble. Based on previous results we conjecture that success of\ndeep learning architectures is strongly bound to the concept of spectral\nergodicity. The method to compute spectral ergodicity proposed in this work\ncould be used to optimise the size and architecture of deep as well as\nrecurrent neural networks.","url_abs":"http://arxiv.org/abs/1704.08303v3","url_pdf":"http://arxiv.org/pdf/1704.08303v3.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":"spectral-ergodicity-in-deep-learning","repo_url":"https://github.com/msuzen/bristol","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"deep-learning","task_name":"Deep Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"msuzen/bristol","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":"b58edc88bc0bb57d882f60ed221aaaaf2b9aac1ab690592258dde2d6389cc5a9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}