{"title":"Dissecting copy/delete/replace/swap mutations: insights from a GIN case study","authors":"Sherlock A. Licorish, Markus Wagner","doi":"10.1145/3520304.3533970","DOIUrl":"https://doi.org/10.1145/3520304.3533970","url":null,"abstract":"Research studies are increasingly critical of publicly available code due to evidence of faults. This has led researchers to explore ways to improve such code, with static analysis and genetic code improvement previously singled out. Previous work has evaluated the feasibility of these techniques, using PMD (a static analysis tool) and GIN (a program repair tool) for enhancing Stack Overflow Java code snippets. Results reported in this regard pointed to the potential of these techniques, especially in terms of GIN's removal of PMD's performance faults from 58 programs. We use a contextual lens to explore these mutations in this study, to evaluate the promise of these techniques. The outcomes show that while the programs were syntactically correct after GIN's mutations (i.e., they compiled), many of GIN's mutations changed the semantics of the code, rendering its purpose questionable. However, certain code mutations tend to retain code semantics more than others. In addition, GIN's mutations at times affected PMD's parsing ability, potentially increasing false negatives. Overall, while these approaches may prove useful, full utility may not be claimed at this time. For enhancing the outcomes of these approaches, we outline ways to improve the utility of these techniques and multiple future research directions.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130625211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the interaction between lexicase selection, modularity and data subsets","authors":"Benjamin Portman, M. Heywood","doi":"10.1145/3520304.3528765","DOIUrl":"https://doi.org/10.1145/3520304.3528765","url":null,"abstract":"Lexicase selection represents a framework for maintaining population diversity, and has therefore demonstrated a capacity for discovering solutions to a wide range of tasks. We note, however, that the benchmarking studies used to demonstrate these properties also tend assume some form of modularity in the representation. With that in mind, an empirical study using five classification datasets is performed in which we compare: 1) Lexicase and a canonical 'breeder' model of selection, and 2) modularity is explicitly enabled and disabled. A clear preference is demonstrated for including modularity with both forms of selection. However, the effect is most pronounced under Lexicase selection with significantly simpler solutions also resulting when modularity is enabled.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130394807","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. M. Freitas, H. Bernardino, L. B. Gonçalves, S. Soares
{"title":"Human activity recognition using grammar-based genetic programming","authors":"J. M. Freitas, H. Bernardino, L. B. Gonçalves, S. Soares","doi":"10.1145/3520304.3529076","DOIUrl":"https://doi.org/10.1145/3520304.3529076","url":null,"abstract":"Smart devices provide a way of acquiring useful data for human activity recognition (HAR). The identification of activities is a task applicable to a wide range of situations, such as automatically providing aid to someone in need. Machine learning techniques can solve this problem, but their capacity in providing understanding regarding the classification is usually limited. Here, we propose a Grammar-based Genetic Programming (GGP) to generate interpretable models for HAR. A Context-free Grammar defines a language that the models belong to, providing a way to read and extract knowledge. The results show that the proposed GGP generates results better than another Genetic Programming method and machine learning approaches. Also, the models created provided an understanding of the features associated with the activities.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131195824","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hongya Wang, Diederick Vermetten, Furong Ye, Carola Doerr, Thomas Bäck
{"title":"IOHanalyzer: Detailed performance analyses for iterative optimization heuristics: hot-off-the-press track @ GECCO 2022","authors":"Hongya Wang, Diederick Vermetten, Furong Ye, Carola Doerr, Thomas Bäck","doi":"10.1145/3520304.3534071","DOIUrl":"https://doi.org/10.1145/3520304.3534071","url":null,"abstract":"This paper summarizes our work \"IOHanalyzer: Detailed Performance Analyses for Iterative Optimization Heuristics\", to appear in ACM Transactions on Evolutionary Learning and Optimization. IOHanalyzer is a new user-friendly tool for analyzing, comparing, and visualizing performance data of iterative optimization heuristics (IOHs). Key advantages of IOHanalyzer over other performance analysis packages are its highly interactive graphical user interface, which allows users to specify the performance measures, the ranges, and granularity of the displayed data that are most useful for their experiments, and the possibility to analyze not only performance traces, but also the evolution of dynamic parameters of IOHs. IOHanalyzer can directly process performance data from the main benchmarking platforms, including the COCO platform, Nevergrad, the SOS platform, and IOHexperimenter. An R programming interface is provided for users preferring to have a finer control over the implemented functionalities. Implemented in R and C, IOHanalyzer is fully open source and available on CRAN and GitHub. Our paper has two reproducibility badges, the one for \"Artifacts Available\" and the one for \"Artifacts Evaluated - Functional v1.1\".","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128250362","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Nielis Brouwer, Danny Dijkzeul, Levi Koppenhol, I. Pijning, D. V. D. Berg
{"title":"Survivor selection in a crossoverless evolutionary algorithm","authors":"Nielis Brouwer, Danny Dijkzeul, Levi Koppenhol, I. Pijning, D. V. D. Berg","doi":"10.1145/3520304.3533950","DOIUrl":"https://doi.org/10.1145/3520304.3533950","url":null,"abstract":"The plant propagation algorithm is a crossoverless population based evolutionary algorithm, defaultly deploying the plus-selection method for survivor selection - combining parents and offspring population and then selecting the best popSize individuals. In this study, we explore eight different survivor selection methods (plus and comma selection, tournament selection with and without replacement, elitist tournament selection, linear ranking selection and (elitist) roulette wheel selection) on 59 continuous benchmark test function instances and compare the results. In the results, the tournament selection methods outperform PPA's default selection method on 83% to 88% of the 59 benchmark functions. Results show that the performance of all selection methods diminish as dimensions of benchmark function instances increase. Analysis indicates that the tournament selection methods employ more exploitation by decreasing population diversity. Future research should establish if this also benefits performance on other benchmark functions and industrial problems.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124873439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Cosijopii Garcia-Garcia, H. Escalante, A. Morales-Reyes
{"title":"CGP-NAS: real-based solutions encoding for multi-objective evolutionary neural architecture search","authors":"Cosijopii Garcia-Garcia, H. Escalante, A. Morales-Reyes","doi":"10.1145/3520304.3528963","DOIUrl":"https://doi.org/10.1145/3520304.3528963","url":null,"abstract":"Convolutional Neural Networks (CNNs) have had a remarkable performance in difficult computer vision tasks. In previous years, human experts have developed a number of specialized CNN architectures to deal with complex image datasets. However, the automatic design of CNN through Neural Architecture Search (NAS) has gained importance to reduce and possibly avoid human expert intervention. One of the main challenges in NAS is to design less complex and yet highly precise CNNs when both objectives conflict. This study extends Cartesian Genetic Programming (CGP) for CNNs representation in NAS through multi-objective evolutionary optimization for image classification tasks. The proposed CGP-NAS algorithm is built on CGP by combining real-based solutions representation and the well-established Non-dominated Sorting Genetic Algorithm II (NSGA-II). A detailed empirical assessment shows CGP-NAS achieved competitive performance when compared to other state-of-the-art proposals while significantly reduced the evolved CNNs architecture's complexity as well as GPU-days.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125280579","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Clément Legrand, D. Cattaruzza, Laetitia Vermeulen-Jourdan, Marie-Éléonore Kessaci
{"title":"Enhancing MOEA/D with learning: application to routing problems with time windows","authors":"Clément Legrand, D. Cattaruzza, Laetitia Vermeulen-Jourdan, Marie-Éléonore Kessaci","doi":"10.1145/3520304.3528909","DOIUrl":"https://doi.org/10.1145/3520304.3528909","url":null,"abstract":"Integrating machine learning (ML) techniques into metaheuristics is an efficient approach in single-objective optimization. Indeed, high-quality solutions often contain relevant knowledge, that can be used to guide the heuristic towards promising areas. In multi-objective optimization, the quality of solutions is evaluated according to multiple criteria that are generally conflicting. Therefore, the ML techniques designed for single-objective optimization can not be directly adapted for multi-objective optimization. In this paper, we propose to enhance the Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) with a clustering-based learning mechanism. To be more precise, solutions are grouped regarding a metric based on their quality on each criterion, and the knowledge from the solutions of the same group is merged. Experiments are conducted on the multi-objective vehicle routing problem with time windows. The results show that MOEA/D with learning outperforms the original version.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128370935","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Genetic heterogeneity analysis using genetic algorithm and network science","authors":"Zhendong Sha, Y. Chen, Ting Hu","doi":"10.1145/3520304.3529027","DOIUrl":"https://doi.org/10.1145/3520304.3529027","url":null,"abstract":"Genome-wide association studies (GWAS) have linked thousands of genetic variants to the susceptibility of many common human diseases. However, the genetic explanations of diseases are often heterogeneous, imposing a substantial challenge for GWAS. We propose a feature construction method using genetic algorithm (GA) to recognize the heterogeneous risk effects of different genetic variable groups. Multiple GA-based feature selection runs are used to collect an ensemble of the high-performing feature subsets. We generate a feature co-selection network from the ensemble, where nodes represent genetic variables and edges represent their co-selection frequencies. A new synthetic feature, namely community risk score (CRS), is created for each network community. CRS quantifies the risk of a community of variables and allows for more effective heterogeneity analysis. We applied our method to two colorectal cancer GWAS datasets, one for training and the other for validation. We ran the GA-based feature selection on the training dataset and constructed the co-selection network. CRS was then created for each community in the network. We identified three colorectal cancer subtypes using the CRSs and clustering algorithms on the validation dataset. The function enrichment analysis in our results further highlighted gastric cancer related genes, tumor suppressors and DNA methylation genes.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122978055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Carola Doerr, Hongya Wang, Diederick Vermetten, Thomas Bäck, Jacob De Nobel, Furong Ye
{"title":"Benchmarking and analyzing iterative optimization heuristics with IOH profiler","authors":"Carola Doerr, Hongya Wang, Diederick Vermetten, Thomas Bäck, Jacob De Nobel, Furong Ye","doi":"10.1145/3520304.3533665","DOIUrl":"https://doi.org/10.1145/3520304.3533665","url":null,"abstract":"","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125895760","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
C. Audet, Sébastien Le Digabel, L. Salomon, C. Tribes
{"title":"Constrained blackbox optimization with the NOMAD solver on the COCO constrained test suite","authors":"C. Audet, Sébastien Le Digabel, L. Salomon, C. Tribes","doi":"10.1145/3520304.3534019","DOIUrl":"https://doi.org/10.1145/3520304.3534019","url":null,"abstract":"The context of this work is constrained blackbox optimization. It describes the mesh adaptive direct search (MADS) derivative-free optimization algorithm using the progressive barrier strategy to handle quantifiable and relaxable constraints. Through its implementation in the NOMAD solver, MADS is tested on the new bbob-constrained suite of analytical constrained problems from the COCO platform, and compared with the CMA-ES heuristic. Computational tests are illustrated with the postprocessing graphs from the COCO platform, as well as with data profiles, an established tool in the derivative-free optimization community, adapted here for the constrained case. The results illustrate that researchers must be very careful with the use of these tools, which are complementary and should ideally be used together. Their many variations may show different outcomes, and hence many graphs are necessary in order to provide the best overall view.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127417909","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}