{"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/genetic-cnn","title":"Genetic CNN","arxiv_id":"1703.01513","date":"2017-03-04","proceeding":"ICCV 2017 10","authors":["Lingxi Xie","Alan Yuille"],"abstract":"The deep Convolutional Neural Network (CNN) is the state-of-the-art solution\nfor large-scale visual recognition. Following basic principles such as\nincreasing the depth and constructing highway connections, researchers have\nmanually designed a lot of fixed network structures and verified their\neffectiveness.\n  In this paper, we discuss the possibility of learning deep network structures\nautomatically. Note that the number of possible network structures increases\nexponentially with the number of layers in the network, which inspires us to\nadopt the genetic algorithm to efficiently traverse this large search space. We\nfirst propose an encoding method to represent each network structure in a\nfixed-length binary string, and initialize the genetic algorithm by generating\na set of randomized individuals. In each generation, we define standard genetic\noperations, e.g., selection, mutation and crossover, to eliminate weak\nindividuals and then generate more competitive ones. The competitiveness of\neach individual is defined as its recognition accuracy, which is obtained via\ntraining the network from scratch and evaluating it on a validation set. We run\nthe genetic process on two small datasets, i.e., MNIST and CIFAR10,\ndemonstrating its ability to evolve and find high-quality structures which are\nlittle studied before. These structures are also transferrable to the\nlarge-scale ILSVRC2012 dataset.","url_abs":"http://arxiv.org/abs/1703.01513v1","url_pdf":"http://arxiv.org/pdf/1703.01513v1.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":"genetic-cnn","repo_url":"https://github.com/gmontamat/gentun","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"object-recognition","task_name":"Object Recognition"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1703.01513","atlas_url":"https://app.syntology.ai/?focus=1703.01513","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":"1703.01513"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1703.01513\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1703.01513"},"call":"get_concepts_for_paper(arxiv_id=\"1703.01513\")"}],"by_repo":[{"repo":"gmontamat/gentun","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":"43e50400e62e9344e15c8409044c9f533d811d399655c9ba78f7e0d517134a34","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}