Pub Date : 2022-07-18DOI: 10.1109/CEC55065.2022.9870280
Seyed Vahid Moravvej, S. J. Mousavirad, D. Oliva, G. Schaefer, Zahra Sobhaninia
Plagiarism detection is a challenging task, aiming to identify similar items in two documents. In this paper, we present a novel approach to automatic plagiarism detection that combines BERT (bidirectional encoder representations from transformers) word embedding, attention mechanism-based long short-term memory (LSTM) networks, and an improved differential evolution (DE) algorithm for weight initialisation. BERT is used to pretrain deep bidirectional representations in all layers, while the pre-trained BERT model can be fine-tuned with only one extra output layer without significant changes in architecture. Deep learning algorithms often use the random weighting method for initialisation, followed by gradient-based optimisation algorithms such as back-propagation for training, making them susceptible to getting trapped in local optima. To address this, population- based metaheuristic algorithms such as DE can be used. We propose an improved DE algorithm with a clustering-based mutation operator, where first a winning cluster of candidate solutions is identified and a new updating strategy is then applied to include new candidate solutions in the current population. The proposed DE algorithm is used in LSTM, attention mechanism, and feed- forward neural networks to yield the initial seeds for subsequent gradient-based optimisation. We compare our proposed model with conventional and population-based approaches on three datasets (SNLI, MSRP and SemEval2014) and demonstrate it to give superior plagiarism detection performance.
{"title":"An Improved DE Algorithm to Optimise the Learning Process of a BERT-based Plagiarism Detection Model","authors":"Seyed Vahid Moravvej, S. J. Mousavirad, D. Oliva, G. Schaefer, Zahra Sobhaninia","doi":"10.1109/CEC55065.2022.9870280","DOIUrl":"https://doi.org/10.1109/CEC55065.2022.9870280","url":null,"abstract":"Plagiarism detection is a challenging task, aiming to identify similar items in two documents. In this paper, we present a novel approach to automatic plagiarism detection that combines BERT (bidirectional encoder representations from transformers) word embedding, attention mechanism-based long short-term memory (LSTM) networks, and an improved differential evolution (DE) algorithm for weight initialisation. BERT is used to pretrain deep bidirectional representations in all layers, while the pre-trained BERT model can be fine-tuned with only one extra output layer without significant changes in architecture. Deep learning algorithms often use the random weighting method for initialisation, followed by gradient-based optimisation algorithms such as back-propagation for training, making them susceptible to getting trapped in local optima. To address this, population- based metaheuristic algorithms such as DE can be used. We propose an improved DE algorithm with a clustering-based mutation operator, where first a winning cluster of candidate solutions is identified and a new updating strategy is then applied to include new candidate solutions in the current population. The proposed DE algorithm is used in LSTM, attention mechanism, and feed- forward neural networks to yield the initial seeds for subsequent gradient-based optimisation. We compare our proposed model with conventional and population-based approaches on three datasets (SNLI, MSRP and SemEval2014) and demonstrate it to give superior plagiarism detection performance.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133782423","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}
Pub Date : 2022-07-18DOI: 10.1109/CEC55065.2022.9870259
Songbai Liu, Min Jiang, Qiuzhen Lin, K. Tan
The performance of traditional multiobj ective evolutionary algorithms (MOEAs) often deteriorates rapidly when using them to solve large-scale multiobjective optimization problems (LMOPs). To effectively handle LMOPs, we propose a large-scale MOEA via self-guided problem transformation. In the proposed optimizer, the original large-scale search space is transferred to a lower-dimensional weighted space by the guidance of solutions themselves, aiming to effectively search in the weighted space for speeding up the convergence of the population. Specifically, the variables of the target LMOP are adaptively and randomly divided into multiple equal groups, and then solutions are self-guided to construct the small-scale weighted space correspondingly to these variable groups. In this way, each solution is projected as a self-guided vector with multiple weight variables, and then new weight vectors can be generated by searching in the weighted space. Next, new offspring is produced by inversely mapping the newly generated weight vectors to the original search space of this LMOP. Finally, the proposed optimizer is tested on two different LMOP test suites by comparing them with five competitive large-scale MOEAs. Experimental results show some advantages of the proposed algorithm in solving the considered benchmarks.
{"title":"Evolutionary Large-Scale Multiobjective Optimization via Self-guided Problem Transformation","authors":"Songbai Liu, Min Jiang, Qiuzhen Lin, K. Tan","doi":"10.1109/CEC55065.2022.9870259","DOIUrl":"https://doi.org/10.1109/CEC55065.2022.9870259","url":null,"abstract":"The performance of traditional multiobj ective evolutionary algorithms (MOEAs) often deteriorates rapidly when using them to solve large-scale multiobjective optimization problems (LMOPs). To effectively handle LMOPs, we propose a large-scale MOEA via self-guided problem transformation. In the proposed optimizer, the original large-scale search space is transferred to a lower-dimensional weighted space by the guidance of solutions themselves, aiming to effectively search in the weighted space for speeding up the convergence of the population. Specifically, the variables of the target LMOP are adaptively and randomly divided into multiple equal groups, and then solutions are self-guided to construct the small-scale weighted space correspondingly to these variable groups. In this way, each solution is projected as a self-guided vector with multiple weight variables, and then new weight vectors can be generated by searching in the weighted space. Next, new offspring is produced by inversely mapping the newly generated weight vectors to the original search space of this LMOP. Finally, the proposed optimizer is tested on two different LMOP test suites by comparing them with five competitive large-scale MOEAs. Experimental results show some advantages of the proposed algorithm in solving the considered benchmarks.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133971207","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}
Pub Date : 2022-07-18DOI: 10.1109/CEC55065.2022.9870368
Sasha Abramowitz, G. Nitschke
This paper investigates a novel method combining Scalable Evolution Strategies (S-ES) and Hierarchical Reinforcement Learning (HRL). S-ES, named for its excellent scalability, was popularised with demonstrated performance comparable to state-of-the-art policy gradient methods. However, S-ES has not been tested in conjunction with HRL methods, which empower temporal abstraction thus allowing agents to tackle more challenging problems. We introduce a novel method merging S-ES and HRL, which creates a highly scalable and efficient (compute time) algorithm. We demonstrate that the proposed method benefits from S-ES's scalability and indifference to delayed rewards. This results in our main contribution: significantly higher learning speed and competitive performance compared to gradient-based HRL methods, across a range of tasks.
{"title":"Towards Run-time Efficient Hierarchical Reinforcement Learning","authors":"Sasha Abramowitz, G. Nitschke","doi":"10.1109/CEC55065.2022.9870368","DOIUrl":"https://doi.org/10.1109/CEC55065.2022.9870368","url":null,"abstract":"This paper investigates a novel method combining Scalable Evolution Strategies (S-ES) and Hierarchical Reinforcement Learning (HRL). S-ES, named for its excellent scalability, was popularised with demonstrated performance comparable to state-of-the-art policy gradient methods. However, S-ES has not been tested in conjunction with HRL methods, which empower temporal abstraction thus allowing agents to tackle more challenging problems. We introduce a novel method merging S-ES and HRL, which creates a highly scalable and efficient (compute time) algorithm. We demonstrate that the proposed method benefits from S-ES's scalability and indifference to delayed rewards. This results in our main contribution: significantly higher learning speed and competitive performance compared to gradient-based HRL methods, across a range of tasks.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132806466","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}
Pub Date : 2022-07-18DOI: 10.1109/CEC55065.2022.9870240
Eva Christodoulaki, Michael Kampouridis
Algorithmic trading has become an increasingly thriving research area and a lot of focus has been given on indicators from technical and sentiment analysis. In this paper, we examine the advantages of combining features from both analyses. To do this, we use two different genetic programming algorithms (GP). The first algorithm allows trees to contain technical and/or sentiment analysis indicators without any con-straints. The second algorithm introduces technical and sentiment analysis types through a strongly typed GP, whereby one branch of a given tree contains only technical analysis indicators and another branch of the same tree contains only sentiment analysis features. This allows for better exploration and exploitation of the search space of the indicators. We perform experiments on 10 international stocks and compare the above two GPs' performances. Our goal is to demonstrate that the combination of the indicators leads to improved financial performance. Our results show that the strongly typed GP is able to rank first in terms of Sharpe ratio and statistically outperform all other algorithms in terms of rate of return.
{"title":"U sing strongly typed genetic programming to combine technical and sentiment analysis for algorithmic trading","authors":"Eva Christodoulaki, Michael Kampouridis","doi":"10.1109/CEC55065.2022.9870240","DOIUrl":"https://doi.org/10.1109/CEC55065.2022.9870240","url":null,"abstract":"Algorithmic trading has become an increasingly thriving research area and a lot of focus has been given on indicators from technical and sentiment analysis. In this paper, we examine the advantages of combining features from both analyses. To do this, we use two different genetic programming algorithms (GP). The first algorithm allows trees to contain technical and/or sentiment analysis indicators without any con-straints. The second algorithm introduces technical and sentiment analysis types through a strongly typed GP, whereby one branch of a given tree contains only technical analysis indicators and another branch of the same tree contains only sentiment analysis features. This allows for better exploration and exploitation of the search space of the indicators. We perform experiments on 10 international stocks and compare the above two GPs' performances. Our goal is to demonstrate that the combination of the indicators leads to improved financial performance. Our results show that the strongly typed GP is able to rank first in terms of Sharpe ratio and statistically outperform all other algorithms in terms of rate of return.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133125580","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}
Pub Date : 2022-07-18DOI: 10.1109/CEC55065.2022.9870402
Karine Levonyan, Jesse Harder, F. Silva
Many games are reliant on creating new and engaging content constantly to maintain the interest of their player-base. One such example are puzzle games, in such it is common to have a recurrent need to create new puzzles. Creating new puzzles requires guaranteeing that they are solvable and interesting to players, both of which require significant time from the designers. Automatic validation of puzzles provides designers with a significant time saving and potential boost in quality. Automation allows puzzle designers to estimate different properties, increase the variety of constraints, and even personalize puzzles to specific players. Puzzles often have a large design space, which renders exhaustive search approaches infeasible, if they require significant time. Specifically, those puzzles can be formulated as quadratic combinatorial optimization problems. This paper presents an evolutionary algorithm, empowered by expert-knowledge informed heuristics, for solving logical puzzles in video games efficiently, leading to a more efficient design process. We discuss multiple variations of hybrid genetic approaches for constraint satisfaction problems that allow us to find a diverse set of near-optimal solutions for puzzles. We demonstrate our approach on a fantasy Party Building Puzzle game, and discuss how it can be applied more broadly to other puzzles to guide designers in their creative process.
{"title":"Automated Graph Genetic Algorithm based Puzzle Validation for Faster Game Design","authors":"Karine Levonyan, Jesse Harder, F. Silva","doi":"10.1109/CEC55065.2022.9870402","DOIUrl":"https://doi.org/10.1109/CEC55065.2022.9870402","url":null,"abstract":"Many games are reliant on creating new and engaging content constantly to maintain the interest of their player-base. One such example are puzzle games, in such it is common to have a recurrent need to create new puzzles. Creating new puzzles requires guaranteeing that they are solvable and interesting to players, both of which require significant time from the designers. Automatic validation of puzzles provides designers with a significant time saving and potential boost in quality. Automation allows puzzle designers to estimate different properties, increase the variety of constraints, and even personalize puzzles to specific players. Puzzles often have a large design space, which renders exhaustive search approaches infeasible, if they require significant time. Specifically, those puzzles can be formulated as quadratic combinatorial optimization problems. This paper presents an evolutionary algorithm, empowered by expert-knowledge informed heuristics, for solving logical puzzles in video games efficiently, leading to a more efficient design process. We discuss multiple variations of hybrid genetic approaches for constraint satisfaction problems that allow us to find a diverse set of near-optimal solutions for puzzles. We demonstrate our approach on a fantasy Party Building Puzzle game, and discuss how it can be applied more broadly to other puzzles to guide designers in their creative process.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133184890","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}
Pub Date : 2022-07-18DOI: 10.1109/CEC55065.2022.9870268
Henrik Smedberg, Sunith Bandaru
Although an entire frontier of Pareto-optimal solutions exists for multi-objective optimization problems, in practice, decision makers are often only interested in a small subset of these solutions, called the region of interest. Specialized optimizers, such as reference-point based evolutionary algorithms, exist that can focus the search to only find solutions inside this region of interest. These algorithms typically only modify the selection mechanism of regular multi-objective optimizers to preferentially select solutions that conform to the reference point. However, a more effective search may be performed by additionally modifying the variation mechanism of the optimizers, namely the crossover and the mutation operators, to preferentially generate solutions conforming to the reference point. In this paper, we propose a modular mutation operator that uses a recent knowledge discovery technique to first find decision rules unique to the preferred solutions in each generation. These rules are then used to build an empirical distribution in the decision space that can be sampled to generate new mutated solutions which are more likely to be closer to the preferred solutions. The operator is modular in the sense that it can be used with any existing reference-point based evolutionary algorithm by simply replacing the mutation operator. We incorporate the proposed knowledge-driven mutation operator into three such algorithms, and through benchmark test problems up to 10 objectives, demonstrate that their performance improves significantly in the majority of cases according to two different performance indicators.
{"title":"A Modular Knowledge-Driven Mutation Operator for Reference-Point Based Evolutionary Algorithms","authors":"Henrik Smedberg, Sunith Bandaru","doi":"10.1109/CEC55065.2022.9870268","DOIUrl":"https://doi.org/10.1109/CEC55065.2022.9870268","url":null,"abstract":"Although an entire frontier of Pareto-optimal solutions exists for multi-objective optimization problems, in practice, decision makers are often only interested in a small subset of these solutions, called the region of interest. Specialized optimizers, such as reference-point based evolutionary algorithms, exist that can focus the search to only find solutions inside this region of interest. These algorithms typically only modify the selection mechanism of regular multi-objective optimizers to preferentially select solutions that conform to the reference point. However, a more effective search may be performed by additionally modifying the variation mechanism of the optimizers, namely the crossover and the mutation operators, to preferentially generate solutions conforming to the reference point. In this paper, we propose a modular mutation operator that uses a recent knowledge discovery technique to first find decision rules unique to the preferred solutions in each generation. These rules are then used to build an empirical distribution in the decision space that can be sampled to generate new mutated solutions which are more likely to be closer to the preferred solutions. The operator is modular in the sense that it can be used with any existing reference-point based evolutionary algorithm by simply replacing the mutation operator. We incorporate the proposed knowledge-driven mutation operator into three such algorithms, and through benchmark test problems up to 10 objectives, demonstrate that their performance improves significantly in the majority of cases according to two different performance indicators.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133533374","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}
Pub Date : 2022-07-18DOI: 10.1109/CEC55065.2022.9870265
Nikolas Hohmann, M. Bujny, J. Adamy, M. Olhofer
In the context of real-world path planning applications for Unmanned Aerial Vehicles (UAVs), aspects such as handling of multiple objectives (e.g., minimizing risk, path length, travel time, energy consumption, or noise pollution), generation of smooth trajectories in 3D space, and the ability to deal with urban environments have to be taken into account jointly by an optimization algorithm to provide practically feasible solutions. Since the currently available methods do not allow for that, in this paper, we propose a holistic approach for solving a Multi-Objective Path Planning (MOPP) problem for UAVs in a three-dimensional, large-scale urban environment. For the tackled optimization problem, we propose an energy model and a noise model for a UAV, following a smooth 3D path. We utilize a path representation based on 3D Non-Uniform Rational B-Splines (NURBS). As optimizers, we use a conventional version of an Evolution Strategy (ES), two standard Multi-Objective Evolutionary Algorithms (MOEAs) - NSGA2 and MO-CMA-ES, and a gradient-based L-BFGS-B approach. To guide the optimization, we propose hybrid versions of the mentioned algorithms by applying an advanced initialization scheme that is based on the exact bidirectional Dijkstra algorithm. We compare the different algorithms with and without hybrid initialization in a statistical analysis, which considers the number of function evaluations and quality features of the obtained Pareto fronts indicating convergence and diversity of the solutions. We evaluate the methods on a realistic 3D urban path planning scenario in New York City, based on real-world data exported from OpenStreetMap. The examination's results indicate that hybrid initialization is the main factor for the efficient identification of near-optimal solutions.
{"title":"Multi-objective 3D Path Planning for UAVs in Large-Scale Urban Scenarios","authors":"Nikolas Hohmann, M. Bujny, J. Adamy, M. Olhofer","doi":"10.1109/CEC55065.2022.9870265","DOIUrl":"https://doi.org/10.1109/CEC55065.2022.9870265","url":null,"abstract":"In the context of real-world path planning applications for Unmanned Aerial Vehicles (UAVs), aspects such as handling of multiple objectives (e.g., minimizing risk, path length, travel time, energy consumption, or noise pollution), generation of smooth trajectories in 3D space, and the ability to deal with urban environments have to be taken into account jointly by an optimization algorithm to provide practically feasible solutions. Since the currently available methods do not allow for that, in this paper, we propose a holistic approach for solving a Multi-Objective Path Planning (MOPP) problem for UAVs in a three-dimensional, large-scale urban environment. For the tackled optimization problem, we propose an energy model and a noise model for a UAV, following a smooth 3D path. We utilize a path representation based on 3D Non-Uniform Rational B-Splines (NURBS). As optimizers, we use a conventional version of an Evolution Strategy (ES), two standard Multi-Objective Evolutionary Algorithms (MOEAs) - NSGA2 and MO-CMA-ES, and a gradient-based L-BFGS-B approach. To guide the optimization, we propose hybrid versions of the mentioned algorithms by applying an advanced initialization scheme that is based on the exact bidirectional Dijkstra algorithm. We compare the different algorithms with and without hybrid initialization in a statistical analysis, which considers the number of function evaluations and quality features of the obtained Pareto fronts indicating convergence and diversity of the solutions. We evaluate the methods on a realistic 3D urban path planning scenario in New York City, based on real-world data exported from OpenStreetMap. The examination's results indicate that hybrid initialization is the main factor for the efficient identification of near-optimal solutions.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133417129","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}
Pub Date : 2022-07-18DOI: 10.1109/CEC55065.2022.9870344
V. Parque
Lattice paths are functional entities that model efficient navigation in discrete/grid maps. This paper presents a new scheme to generate collision-free lattice paths with utmost efficiency using the bijective property to rooted ordered trees, rendering a one-dimensional search problem. Our computational studies using ten state-of-the-art and relevant nature-inspired swarm heuristics in navigation scenarios with obstacles with convex and non-convex geometry show the practical feasibility and efficiency in rendering collision-free lattice paths. We believe our scheme may find use in devising fast algorithms for planning and combinatorial optimization in discrete maps.
{"title":"Learning Obstacle-Avoiding Lattice Paths using Swarm Heuristics: Exploring the Bijection to Ordered Trees","authors":"V. Parque","doi":"10.1109/CEC55065.2022.9870344","DOIUrl":"https://doi.org/10.1109/CEC55065.2022.9870344","url":null,"abstract":"Lattice paths are functional entities that model efficient navigation in discrete/grid maps. This paper presents a new scheme to generate collision-free lattice paths with utmost efficiency using the bijective property to rooted ordered trees, rendering a one-dimensional search problem. Our computational studies using ten state-of-the-art and relevant nature-inspired swarm heuristics in navigation scenarios with obstacles with convex and non-convex geometry show the practical feasibility and efficiency in rendering collision-free lattice paths. We believe our scheme may find use in devising fast algorithms for planning and combinatorial optimization in discrete maps.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124800472","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}
Properly configuring mutation strategies and their associated parameters in DE is inherently a difficult issue. In this paper, an adaptive multi-subpopulation based differential evolution has been proposed and employed for global optimization. In the proposed method, the entire population is firstly adaptively divided at each generation according to a devised population division strategy, which try to partition the population into multiple subpopulations according to the potential of individuals. Then, a suitable mutation strategy along with an appropriate parameter control scheme is introduced and assigned to each subpopulation for evolution, with the purpose of delivering a balanced evolution. The performance of proposed algorithm has been evaluated on CEC'2015 benchmark functions and compared with related methods. The results show that our method can outperform related methods to be compared.
{"title":"Adaptive Multi-subpopulation based Differential Evolution for Global Optimization","authors":"Qingping Liu, Ting Pang, Kaige Chen, Zuling Wang, Weiguo Sheng","doi":"10.1109/CEC55065.2022.9870398","DOIUrl":"https://doi.org/10.1109/CEC55065.2022.9870398","url":null,"abstract":"Properly configuring mutation strategies and their associated parameters in DE is inherently a difficult issue. In this paper, an adaptive multi-subpopulation based differential evolution has been proposed and employed for global optimization. In the proposed method, the entire population is firstly adaptively divided at each generation according to a devised population division strategy, which try to partition the population into multiple subpopulations according to the potential of individuals. Then, a suitable mutation strategy along with an appropriate parameter control scheme is introduced and assigned to each subpopulation for evolution, with the purpose of delivering a balanced evolution. The performance of proposed algorithm has been evaluated on CEC'2015 benchmark functions and compared with related methods. The results show that our method can outperform related methods to be compared.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130376266","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}
We have recently proposed a novel framework of in vivo computation by transforming the early tumor detection into an optimization problem. In the framework, the tumor-triggered biological gradient field (BGF) provides aided knowledge for the swarm-intelligence-assisted tumor targeting process. Our previous investigations are based on the hypothesis that the BGF landscape is time-invariant, which results in a static function optimization problem. However, the properties of internal environment, such as the flow state of body fluid, will bring about time-dependent variation of BGF. Thus, we focus on dynamic in vivo computation by considering different variation patterns of BGF in this paper. A computational intelligence strategy named “swarm-based learning strategy” is proposed for overcoming the turbulence of the fitness estimation caused by the BGF variation. The in silico experiments and statistical results demonstrate the effectiveness of the proposed strategy. In addition, the above process is conducted in a three-dimensional search space, which is more realistic compared to the two-dimensional search space in our previous work.
{"title":"Dynamic In Vivo Computation: Nanobiosensing from a Dynamic Optimization Perspective","authors":"Shaolong Shi, Yifan Chen, Qiang Liu, Jurong Ding, Qingfu Zhang","doi":"10.1109/CEC55065.2022.9870332","DOIUrl":"https://doi.org/10.1109/CEC55065.2022.9870332","url":null,"abstract":"We have recently proposed a novel framework of in vivo computation by transforming the early tumor detection into an optimization problem. In the framework, the tumor-triggered biological gradient field (BGF) provides aided knowledge for the swarm-intelligence-assisted tumor targeting process. Our previous investigations are based on the hypothesis that the BGF landscape is time-invariant, which results in a static function optimization problem. However, the properties of internal environment, such as the flow state of body fluid, will bring about time-dependent variation of BGF. Thus, we focus on dynamic in vivo computation by considering different variation patterns of BGF in this paper. A computational intelligence strategy named “swarm-based learning strategy” is proposed for overcoming the turbulence of the fitness estimation caused by the BGF variation. The in silico experiments and statistical results demonstrate the effectiveness of the proposed strategy. In addition, the above process is conducted in a three-dimensional search space, which is more realistic compared to the two-dimensional search space in our previous work.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129154469","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：