{"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/optimizing-deep-neural-networks-with-multiple","title":"Optimizing Deep Neural Networks with Multiple Search Neuroevolution","arxiv_id":"1901.05988","date":"2019-01-17","proceeding":null,"authors":["Ahmed Aly","David Weikersdorfer","Claire Delaunay"],"abstract":"This paper presents an evolutionary metaheuristic called Multiple Search\nNeuroevolution (MSN) to optimize deep neural networks. The algorithm attempts\nto search multiple promising regions in the search space simultaneously,\nmaintaining sufficient distance between them. It is tested by training neural\nnetworks for two tasks, and compared with other optimization algorithms. The\nfirst task is to solve Global Optimization functions with challenging\ntopographies. We found to MSN to outperform classic optimization algorithms\nsuch as Evolution Strategies, reducing the number of optimization steps\nperformed by at least 2X.\n  The second task is to train a convolutional neural network (CNN) on the\npopular MNIST dataset. Using 3.33% of the training set, MSN reaches a\nvalidation accuracy of 90%. Stochastic Gradient Descent (SGD) was able to match\nthe same accuracy figure, while taking 7X less optimization steps. Despite\nlagging, the fact that the MSN metaheurisitc trains a 4.7M-parameter CNN\nsuggests promise for future development. This is by far the largest network\never evolved using a pool of only 50 samples.","url_abs":"http://arxiv.org/abs/1901.05988v1","url_pdf":"http://arxiv.org/pdf/1901.05988v1.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":"optimizing-deep-neural-networks-with-multiple","repo_url":"https://github.com/AroMorin/DNNOP","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"global-optimization","task_name":"global-optimization"}],"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":"AroMorin/DNNOP","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":"eb76959fd19a12c2823e26ef12d81307d13e851d1c2e8d80b4d401d092f24b56","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}