{"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/limited-evaluation-evolutionary-optimization","title":"Limited Evaluation Evolutionary Optimization of Large Neural Networks","arxiv_id":"1806.09819","date":"2018-06-26","proceeding":null,"authors":["Jonas Prellberg","Oliver Kramer"],"abstract":"Stochastic gradient descent is the most prevalent algorithm to train neural\nnetworks. However, other approaches such as evolutionary algorithms are also\napplicable to this task. Evolutionary algorithms bring unique trade-offs that\nare worth exploring, but computational demands have so far restricted\nexploration to small networks with few parameters. We implement an evolutionary\nalgorithm that executes entirely on the GPU, which allows to efficiently\nbatch-evaluate a whole population of networks. Within this framework, we\nexplore the limited evaluation evolutionary algorithm for neural network\ntraining and find that its batch evaluation idea comes with a large accuracy\ntrade-off. In further experiments, we explore crossover operators and find that\nunprincipled random uniform crossover performs extremely well. Finally, we\ntrain a network with 92k parameters on MNIST using an EA and achieve 97.6 %\ntest accuracy compared to 98 % test accuracy on the same network trained with\nAdam. Code is available at https://github.com/jprellberg/gpuea.","url_abs":"http://arxiv.org/abs/1806.09819v1","url_pdf":"http://arxiv.org/pdf/1806.09819v1.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":"limited-evaluation-evolutionary-optimization","repo_url":"https://github.com/jprellberg/gpuea","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"evolutionary-algorithms","task_name":"Evolutionary Algorithms"},{"task_slug":null,"task_name":"GPU"}],"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":"jprellberg/gpuea","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":"54ec19bfa3eb5ee9d930f36d4ff18d5678a75b077e6ccb99198e700973213d50","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}