Publicação
Local search, semantics, and genetic programming
| dc.contributor.author | Anselmi, Fabio | |
| dc.contributor.author | Castelli, Mauro | |
| dc.contributor.author | d'Onofrio, Alberto | |
| dc.contributor.author | Manzoni, Luca | |
| dc.contributor.author | Mariot, Luca | |
| dc.contributor.author | Saletta, Martina | |
| dc.contributor.institution | Information Management Research Center (MagIC) - NOVA Information Management School | |
| dc.contributor.institution | NOVA Information Management School (NOVA IMS) | |
| dc.contributor.pbl | Springer Science Business Media | |
| dc.date.accessioned | 2026-02-02T15:43:01Z | |
| dc.date.available | 2026-02-02T15:43:01Z | |
| dc.date.issued | 2026-03 | |
| dc.description | Anselmi, F., Castelli, M., d'Onofrio, A., Manzoni, L., Mariot, L., & Saletta, M. (2026). Local search, semantics, and genetic programming: a global analysis. Soft Computing, 30, 1541-1559. https://doi.org/10.1007/s00500-025-11051-7 | |
| dc.description.abstract | Geometric Semantic Genetic Programming (GSGP) is a powerful variant of Genetic Programming (GP) that defines genetic operators inducing unimodal fitness landscapes. In recent years, a new mutation operator, Geometric Semantic Mutation with Local Search (GSM-LS), has been proposed to include a local search step in the mutation process. The core idea of GSM-LS is to incorporate a linear regression step during mutation, thereby accelerating convergence toward high-quality solutions. While GSM-LS helps the convergence of the evolutionary search, it is prone to overfitting. Thus, it was suggested to apply GSM-LS only for a limited number of generations and then revert to standard geometric semantic mutation. A more recently defined variant of GSGP (called GSGP-reg) also includes a local search step, but shares similar strengths and weaknesses with GSM-LS. Here, we investigate several strategies to mitigate overfitting in GSM-LS and GSGP-reg, ranging from simple regularized regression techniques to adaptive methods that estimate overfitting risk at each mutation. The latter approaches partition the training set into two subsets: one used to perform the mutation, and the other to evaluate the risk of overfitting based on the mutation's impact on held-out data. Experimental evaluations across seven real-world regression benchmarks show that, while plain GSGP underperforms on all datasets, methods incorporating local search often achieve significantly better test performance. For example, on the Airfoil dataset, the GSM-LS variant achieves a median RMSE below 10 compared to 30 with standard GSGP. On the LD50 and Bioavailability datasets, the proposed gen and ridge-regularized variants effectively mitigate overfitting, reducing test RMSE by up to 40% relative to baseline GSGP. We conclude that local search, when used with regularization strategies, enhances GSGP's performance and generalization capability across a diverse range of tasks. | en |
| dc.description.version | publishersversion | |
| dc.description.version | published | |
| dc.format.extent | 19 | |
| dc.format.extent | 2961617 | |
| dc.identifier.doi | 10.1007/s00500-025-11051-7 | |
| dc.identifier.issn | 1432-7643 | |
| dc.identifier.other | PURE: 147784310 | |
| dc.identifier.other | PURE UUID: dd22ef98-8159-42ee-8d6b-a12b9f833f08 | |
| dc.identifier.other | Scopus: 105028178860 | |
| dc.identifier.other | ORCID: /0000-0002-8793-1451/work/204497633 | |
| dc.identifier.uri | http://hdl.handle.net/10362/199931 | |
| dc.identifier.url | https://www.scopus.com/pages/publications/105028178860 | |
| dc.language.iso | eng | |
| dc.peerreviewed | yes | |
| dc.relation | https://doi.org/10.54499/UID/04152/2025 | |
| dc.relation | https://doi.org/10.54499/UID/PRR/04152/2025 | |
| dc.subject | Genetic Programming | |
| dc.subject | Semantics | |
| dc.subject | Local Search | |
| dc.subject | Evolutionary Computation | |
| dc.subject | Theoretical Computer Science | |
| dc.subject | Software | |
| dc.subject | Geometry and Topology | |
| dc.title | Local search, semantics, and genetic programming | en |
| dc.title.subtitle | a global analysis | en |
| dc.type | journal article | |
| degois.publication.firstPage | 1541 | |
| degois.publication.lastPage | 1559 | |
| degois.publication.title | Soft Computing | |
| degois.publication.volume | 30 | |
| dspace.entity.type | Publication | |
| rcaap.rights | openAccess |
Ficheiros
Principais
1 - 1 de 1
A carregar...
- Nome:
- Local_search_semantics_and_genetic_programming.pdf
- Tamanho:
- 2.82 MB
- Formato:
- Adobe Portable Document Format
