Proceedings of the Genetic and Evolutionary Computation Conference Companion最新文献

筛选
英文 中文
CMA-ES and advanced adaptation mechanisms CMA-ES和先进的适应机制
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3533648
Youhei Akimoto, N. Hansen
{"title":"CMA-ES and advanced adaptation mechanisms","authors":"Youhei Akimoto, N. Hansen","doi":"10.1145/3520304.3533648","DOIUrl":"https://doi.org/10.1145/3520304.3533648","url":null,"abstract":"Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"104 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":"128028737","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}
引用次数: 2
Learning classifier systems: cognitive inspired machine learning for eXplainable AI 学习分类器系统:可解释AI的认知启发机器学习
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3533664
Abubakar Siddique, Will N. Browne
{"title":"Learning classifier systems: cognitive inspired machine learning for eXplainable AI","authors":"Abubakar Siddique, Will N. Browne","doi":"10.1145/3520304.3533664","DOIUrl":"https://doi.org/10.1145/3520304.3533664","url":null,"abstract":"","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"58 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":"132797108","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}
引用次数: 2
Amaru: a framework for combining genetic improvement with pattern mining Amaru:一个将遗传改进与模式挖掘相结合的框架
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3534016
Oliver Krauss
{"title":"Amaru: a framework for combining genetic improvement with pattern mining","authors":"Oliver Krauss","doi":"10.1145/3520304.3534016","DOIUrl":"https://doi.org/10.1145/3520304.3534016","url":null,"abstract":"We present Amaru, a framework for Genetic Improvement utilizing Abstract Syntax Trees directly at the interpreter and compiler level. Amaru also enables the mining of frequent, discriminative patterns from Genetic Improvement populations. These patterns in turn can be used to improve the crossover and mutation operators to increase population diversity, reduce the number of individuals failing at run-time and increasing the amount of successful individuals in the population.","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":"134502451","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}
引用次数: 2
Precise runtime analysis for plateau functions: (hot-off-the-press track at GECCO 2022) 平台函数的精确运行时分析:(GECCO 2022热印轨道)
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3534062
Denis Antipov, Benjamin Doerr
{"title":"Precise runtime analysis for plateau functions: (hot-off-the-press track at GECCO 2022)","authors":"Denis Antipov, Benjamin Doerr","doi":"10.1145/3520304.3534062","DOIUrl":"https://doi.org/10.1145/3520304.3534062","url":null,"abstract":"To gain a better theoretical understanding of how evolutionary algorithms (EAs) cope with plateaus of constant fitness, we propose the n-dimensional Plateauk function as benchmark and analyze how different variants of the (1 + 1) EA optimize it. The Plateauk function has a plateau of second-best fitness in a ball of radius k around the optimum. As EA, we regard the (1 + 1) EA using an arbitrary unbiased mutation operator. Denoting by α the random number of bits flipped in an application of this operator and assuming that Pr[α = 1] has at least some small sub-constant value, we show that for all constant k ≥ 2, the runtime T follows a distribution close to the geometric one with success probability equal to the probability to flip between 1 and k bits divided by the size of the plateau. Consequently, the expected runtime is the inverse of this number, and thus only depends on the probability to flip between 1 and k bits, but not on other characteristics of the mutation operator. Our result also implies that the optimal mutation rate for standard bit mutation here is approximately k/(en). Our main analysis tool is a combined analysis of the Markov chains on the search point space and on the Hamming level space, an approach that promises to be useful also for other plateau problems.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"34 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":"134503483","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}
引用次数: 0
Towards evolutionary self-optimization of large multi-agent systems 大型多智能体系统的进化自优化研究
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3529042
F. Seredyński, T. Kulpa, R. Hoffmann
{"title":"Towards evolutionary self-optimization of large multi-agent systems","authors":"F. Seredyński, T. Kulpa, R. Hoffmann","doi":"10.1145/3520304.3529042","DOIUrl":"https://doi.org/10.1145/3520304.3529042","url":null,"abstract":"The development of IoT technologies raises the question of their self-optimization. For this purpose we propose an approach based on a multi-agent interpretation, modeling discrete space and time by Cellular Automata (CA), and applying a game-theoretical model known as spatial Prisoner's Dilemma (SPD). A 2D space is occupied by agents which belong to species with certain strategies. Each agent participates in games with neighbors and its goal is to maximize its cumulated payoff. Species competing for space apply locally a mechanism of evolutionary selection, where the cumulated payoff is considered as fitness. As a result of the competition, more profitable species replace less profitable ones. While agents act locally to maximize their incomes we study conditions of emerging collective behavior measured by the global average total payoff of which the players are not aware. We show that collective behavior based on achieving in a fully distributed way a Nash equilibrium (NE) can emerge if some conditions of the game are fulfilled, in particular when an \"income sharing mechanism\" is introduced.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"48 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":"131722208","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}
引用次数: 0
Desirable properties of performance indicators for assessing interactive evolutionary multiobjective optimization methods 评价交互式进化多目标优化方法的性能指标的理想性质
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3533955
Pouya Aghaei Pour, Sunith Bandaru, B. Afsar, K. Miettinen
{"title":"Desirable properties of performance indicators for assessing interactive evolutionary multiobjective optimization methods","authors":"Pouya Aghaei Pour, Sunith Bandaru, B. Afsar, K. Miettinen","doi":"10.1145/3520304.3533955","DOIUrl":"https://doi.org/10.1145/3520304.3533955","url":null,"abstract":"Interactive methods support decision makers in finding the most preferred solution in multiobjective optimization problems. They iteratively incorporate the decision maker's preference information to find the best balance among conflicting objectives. Several interactive methods have been developed in the literature. However, choosing the most suitable interactive method for a given problem can prove challenging and appropriate indicators are needed to compare interactive methods. Some indicators exist for a priori methods, where preferences are provided at the beginning of the solution process. We present some numerical experiments that illustrate why these indicators are not suitable for interactive methods. As the main contribution of this paper, we propose a set of desirable properties of indicators for assessing interactive methods as the first step of filling a gap in the literature. We discuss each property in detail and provide simple examples to illustrate their behavior.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"111 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":"132373782","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}
引用次数: 1
Phenotypic duplication and inversion in cartesian genetic programming applied to boolean function learning 笛卡儿遗传规划中的表型复制和反转应用于布尔函数学习
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3529065
Roman Kalkreuth
{"title":"Phenotypic duplication and inversion in cartesian genetic programming applied to boolean function learning","authors":"Roman Kalkreuth","doi":"10.1145/3520304.3529065","DOIUrl":"https://doi.org/10.1145/3520304.3529065","url":null,"abstract":"The search performance of Cartesian Genetic Programming (CGP) relies to a large extent on the sole use of genotypic point mutation in combination with extremely large redundant genotypes. Over the last years, steps have been taken to extend CGP's variation mechanisms by the introduction of advanced methods for recombination and mutation. One branch of these contributions addresses phenotypic variation in CGP. However, recent studies have demonstrated the limitations of phenotypic recombination in Boolean function learning and highlighted the effectiveness of the mutation-only approach. Therefore, in this work, we further explore phenotypic mutation in CGP by the introduction and evaluation of two phenotypic mutation operators that are inspired by chromosomal rearrangement. Our initial findings show that the proposed methods can significantly improve the search performance of CGP on various single- and multiple-output Boolean function benchmarks.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"36 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":"134561305","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}
引用次数: 3
Optimization challenges at the european space agency 欧洲航天局的优化挑战
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3533666
Dario Izzo, Manuel López-Ibáñez
{"title":"Optimization challenges at the european space agency","authors":"Dario Izzo, Manuel López-Ibáñez","doi":"10.1145/3520304.3533666","DOIUrl":"https://doi.org/10.1145/3520304.3533666","url":null,"abstract":"Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"60 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":"134187024","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}
引用次数: 0
Leveraging fuzzy system to reduce uncertainty of decision making in software engineering automation 利用模糊系统减少软件工程自动化决策的不确定性
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3533991
Yueke Zhang, Yu Huang
{"title":"Leveraging fuzzy system to reduce uncertainty of decision making in software engineering automation","authors":"Yueke Zhang, Yu Huang","doi":"10.1145/3520304.3533991","DOIUrl":"https://doi.org/10.1145/3520304.3533991","url":null,"abstract":"Decision making in automated GI-based software engineering tasks can significantly affect the performance of the system. However, modern SE usually presents high uncertainty in such decision making process due to the existence of multiple solutions that reply on heuristics. We propose to apply the theory of Fuzzy System to obtain a final decision with lower uncertainty and higher accuracy. We also demonstrate a motivating example and discuss the challenges and opportunities for applying fuzzy system to SE tasks.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"285 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":"132479400","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}
引用次数: 1
On the effect of the sampling ratio of past trajectories in the combination of evolutionary algorithm and deep reinforcement learning 进化算法与深度强化学习相结合对过去轨迹采样率的影响
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3533971
Yasen Wang, Youhei Akimoto
{"title":"On the effect of the sampling ratio of past trajectories in the combination of evolutionary algorithm and deep reinforcement learning","authors":"Yasen Wang, Youhei Akimoto","doi":"10.1145/3520304.3533971","DOIUrl":"https://doi.org/10.1145/3520304.3533971","url":null,"abstract":"Combinations of evolutionary approaches (EA) and deep reinforcement learning approaches (DRL) have been proposed to take advantages of two approaches: stability of EA and sample efficiency of DRL. CEM-RL is a promising approach combining cross-entropy method (CEM) and twin delayed deep deterministic policy gradient (TD3), showing competitive performance in this fields. In the TD3 part, interaction histories obtained by CEM-oriented agents and TD3-oriented agents are mixed in a single replay buffer, and mini-batch samples are drawn uniform-randomly from the replay buffer. The quality of the training in the TD3 part must depend on the distribution of samples in the replay buffer, hence it depends on the ratio of CEM-oriented and TD3-oriented samples, called replay sample ratio. In this paper we investigate the impact of the replay sample ratio in CEM-RL on 5 MuJoCo environments and confirm that a good ratio leads to outperforming the original CEM-RL on some environments. Based on this observation, we propose an adaptation mechanism for the replay sample ratio, and empirically show that the proposed variant, RSR-CEM-RL, outperforms the original CEM-RL on some environments.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"92 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":"133440429","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书