{"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/solving-the-exponential-growth-of-symbolic","title":"Solving the Exponential Growth of Symbolic Regression Trees in Geometric Semantic Genetic Programming","arxiv_id":"1804.06808","date":"2018-04-18","proceeding":null,"authors":["Joao Francisco B. S. Martins","Luiz Otavio V. B. Oliveira","Luis F. Miranda","Felipe Casadei","Gisele L. Pappa"],"abstract":"Advances in Geometric Semantic Genetic Programming (GSGP) have shown that\nthis variant of Genetic Programming (GP) reaches better results than its\npredecessor for supervised machine learning problems, particularly in the task\nof symbolic regression. However, by construction, the geometric semantic\ncrossover operator generates individuals that grow exponentially with the\nnumber of generations, resulting in solutions with limited use. This paper\npresents a new method for individual simplification named GSGP with Reduced\ntrees (GSGP-Red). GSGP-Red works by expanding the functions generated by the\ngeometric semantic operators. The resulting expanded function is guaranteed to\nbe a linear combination that, in a second step, has its repeated structures and\nrespective coefficients aggregated. Experiments in 12 real-world datasets show\nthat it is not only possible to create smaller and completely equivalent\nindividuals in competitive computational time, but also to reduce the number of\nnodes composing them by 58 orders of magnitude, on average.","url_abs":"http://arxiv.org/abs/1804.06808v1","url_pdf":"http://arxiv.org/pdf/1804.06808v1.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":"solving-the-exponential-growth-of-symbolic","repo_url":"https://github.com/laic-ufmg/GSGP-Red","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"symbolic-regression","task_name":"Symbolic Regression"},{"task_slug":"regression-1","task_name":"regression"}],"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":"laic-ufmg/GSGP-Red","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":"d7bbdd459a1a4d8f5faca6cec486a8f25217913d2c193e4d0ee883f3ec4933f1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}