检索结果-内蒙古大学图书馆

distributed Bayesian optimisation framework for deep neuroevolution

NEUROCOMPUTING 2022年第0期470卷 51-65页

作者： Chandra, Rohitash Tiwari, Animesh Univ New South Wales UNSW Data Sci Hub Sydney NSW Australia Univ New South Wales Sch Math & Stat Sydney NSW Australia Indian Inst Technol Guwahati Dept Civil Engn Gauhati Assam India

Neuroevolution is a machine learning method for evolving neural networks parameters and topology with a high degree of flexibility that makes them applicable to a wide range of architectures. Neuroevolution has been popular in reinforcement learning and has also shown to be promising for deep learning. The major feature of Bayesian optimisation is in reducing computational load by approximating the actual model with an acquisition function (surrogate model) that is computationally cheaper. A major limitation of neuroevolution is the high computational time required for convergence since learning (evo-lution) typically does not utilize gradient information. Bayesian optimisation, which is also known as surrogate-assisted optimisation, has been popular for expensive engineering optimisation problems and hyper-parameter tuning in machine learning. It has potential for training deep learning models via neuroevolution given large datasets and complex models. Recent advances in parallel and distributed computing have enabled efficient implementation of neuroevolution for complex and computationally expensive neural models. In this paper, we present a Bayesian optimisation framework for deep neu-roevolution using a distributed architecture to provide computational efficiency in training. Our results demonstrate promising results for simple to deep neural network models such as convolutional neural networks which motivates further applications. (c) 2021 Elsevier B.V. All rights reserved.

关键词： distributed evolutionary algorithms Surrogate-assisted optimization Bayesian optimisation Parallel computing Neuroevolution

来源：评论

学校读者我要写书评

暂无评论

The EvoSpace Model for Pool-Based evolutionary algorithms

引用

JOURNAL OF GRID COMPUTING 2015年第3期13卷 329-349页

作者： Garcia-Valdez, Mario Trujillo, Leonardo Merelo, Juan-J Fernandez de Vega, Francisco Olague, Gustavo Inst Tecnol Tijuana Tijuana 22414 BC Mexico Inst Tecnol Tijuana Dept Ingn Elect & Elect Posgrad Ciencias Ingn Tijuana 22414 BC Mexico Univ Granada Dept Arquitectura & Tecnol Comp Ctr Invest Tecnol Informac & Comunicac Granada Spain Univ Extremadura Grp Evoluc Artificial Extremadura Spain Ctr Invest Cient & Educ Super Ensenada Ensenada BC Mexico

This work presents the EvoSpace model for the development of pool-based evolutionary algorithms (Pool-EA). Conceptually, the EvoSpace model is built around a central repository or population store, incorporating some of the principles of the tuple-space model and adding additional features to tackle some of the issues associated with Pool-EAs;such as, work redundancy, starvation of the population pool, unreliability of connected clients or workers, and a large parameter space. The model is intended as a platform to develop search algorithms that take an opportunistic approach to computing, allowing the exploitation of freely available services over the Internet or volunteer computing resources within a local network. A comprehensive analysis of the model at both the conceptual and implementation levels is provided, evaluating performance based on efficiency, optima found and speedup, while providing a comparison with a standard EA and an island-based model. The issues of lost connections and system parametrization are studied and validated experimentally with encouraging results, that suggest how EvoSpace can be used to develop and implement different Pool-EAs for search and optimization.

关键词： Pool-based evolutionary algorithms distributed evolutionary algorithms Heterogeneous computing platforms for bioinspired algorithms Parameter setting

来源：评论

学校读者我要写书评

暂无评论

Design and analysis of migration in parallel evolutionary algorithms

引用

SOFT COMPUTING 2013年第7期17卷 1121-1144页

作者： Laessig, Joerg Sudholt, Dirk Univ Appl Sci Zittau Gorlitz Dept Elect Engn & Comp Sci Gorlitz Germany Univ Sheffield Dept Comp Sci Sheffield S10 2TN S Yorkshire England

Parallelization is becoming a more important issue for solving difficult optimization problems. Island models combine phases of independent evolution with migration where genetic information is spread out to neighbored islands. This can lead to an increased diversity within the population. Despite many successful applications, the reasons behind the success of island models are not well understood. We perform a first rigorous runtime analysis for island models and construct a function where phases of independent evolution as well as communication among the islands are essential. A simple island model with migration finds a global optimum in polynomial time, while panmictic populations as well as island models without migration need exponential time, with very high probability. Our results lead to new insights into the usefulness of migration, how information is propagated in island models, and how to set parameters such as the migration interval. This is a novel contribution to the theoretical foundation of parallel EAs. Further, we provide empirical results that complement the theoretical results, investigate the robustness with respect to the choice of the migration interval and compare various migration topologies using statistical tests.

关键词： Parallel evolutionary algorithms Island model Migration distributed evolutionary algorithms Spatial structures Multi-deme model Runtime analysis

来源：评论

学校读者我要写书评

暂无评论

A new initialization procedure for the distributed estimation of distribution algorithms

引用

SOFT COMPUTING 2011年第4期15卷 713-720页

作者： Muelas, Santiago Pena, Jose-Maria LaTorre, Antonio Robles, Victor Univ Politecn Madrid Fac Informat Dept Comp Syst Architecture & Technol Madrid Spain

Estimation of distribution algorithms (EDAs) are one of the most promising paradigms in today's evolutionary computation. In this field, there has been an incipient activity in the so-called parallel estimation of distribution algorithms (pEDAs). One of these approaches is the distributed estimation of distribution algorithms (dEDAs). This paper introduces a new initialization mechanism for each of the populations of the islands based on the Voronoi cells. To analyze the results, a series of different experiments using the benchmark suite for the special session on Real-parameter Optimization of the IEEE CEC 2005 conference has been carried out. The results obtained suggest that the Voronoi initialization method considerably improves the performance obtained from a traditional uniform initialization.

关键词： Estimation of distribution algorithms distributed evolutionary algorithms Initialization Continuous optimization

来源：评论

学校读者我要写书评

暂无评论

A distributed Swarm Optimizer With Adaptive Communication for Large-Scale Optimization

引用

IEEE TRANSACTIONS ON CYBERNETICS 2020年第7期50卷 3393-3408页

作者： Yang, Qiang Chen, Wei-Neng Gu, Tianlong Zhang, Huaxiang Yuan, Huaqiang Kwong, Sam Zhang, Jun Sun Yat Sen Univ Sch Data & Comp Sci Guangzhou 510006 Peoples R China South China Univ Technol Sch Comp Sci & Engn Guangzhou 510006 Peoples R China South China Univ Technol Guangdong Prov Key Lab Computat Intelligence & Cy Guangzhou 510006 Peoples R China Guilin Univ Elect Technol Sch Comp Sci & Engn Guilin 541004 Peoples R China Shandong Normal Univ Sch Informat Sci & Engn Jinan 250014 Peoples R China Dongguan Univ Technol Sch Comp Sci & Network Secur Dongguan 523808 Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China

Large-scale optimization with high dimensionality and high computational cost becomes ubiquitous nowadays. To tackle such challenging problems efficiently, devising distributed evolutionary computation algorithms is imperative. To this end, this paper proposes a distributed swarm optimizer based on a special master-slave model. Specifically, in this distributed optimizer, the master is mainly responsible for communication with slaves, while each slave iterates a swarm to traverse the solution space. An asynchronous and adaptive communication strategy based on the request-response mechanism is especially devised to let the slaves communicate with the master efficiently. Particularly, the communication between the master and each slave is adaptively triggered during the iteration. To aid the slaves to search the space efficiently, an elite-guided learning strategy is especially designed via utilizing elite particles in the current swarm and historically best solutions found by different slaves to guide the update of particles. Together, this distributed optimizer asynchronously iterates multiple swarms to collaboratively seek the optimum in parallel. Extensive experiments on a widely used large-scale benchmark set substantiate that the distributed optimizer could: 1) achieve competitive effectiveness in terms of solution quality as compared to the state-of-the-art large-scale methods;2) accelerate the execution of the algorithm in comparison with the sequential one and obtain almost linear speedup as the number of cores increases;and 3) preserve a good scalability to solve higher dimensional problems.

关键词： Optimization Adaptation models Computational modeling Computer science Topology Sociology Statistics distributed evolutionary algorithms elite-guided learning (EGL) high-dimensional problems large-scale optimization particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Scale factor inheritance mechanism in distributed differential evolution

引用

SOFT COMPUTING 2010年第11期14卷 1187-1207页

作者： Weber, Matthieu Tirronen, Ville Neri, Ferrante Univ Jyvaskyla Dept Math Informat Technol Agora 40014 Finland

This article proposes a distributed differential evolution which employs a novel self-adaptive scheme, namely scale factor inheritance. In the proposed algorithm, the population is distributed over several sub-populations allocated according to a ring topology. Each sub-population is characterized by its own scale factor value. With a probabilistic criterion, that individual displaying the best performance is migrated to the neighbor population and replaces a pseudo-randomly selected individual of the target sub-population. The target sub-population inherits not only this individual but also the scale factor if it seems promising at the current stage of evolution. In addition, a perturbation mechanism enhances the exploration feature of the algorithm. The proposed algorithm has been run on a set of various test problems and then compared to two sequential differential evolution algorithms and three distributed differential evolution algorithms recently proposed in literature and representing state-of-the-art in the field. Numerical results show that the proposed approach seems very efficient for most of the analyzed problems, and outperforms all other algorithms considered in this study.

关键词： Differential evolution distributed evolutionary algorithms evolutionary algorithms Continuous optimization

来源：评论

学校读者我要写书评

暂无评论

Identification of the dynamical properties of structures using free vibration data and distributed genetic algorithms

引用

ENGINEERING OPTIMIZATION 2007年第8期39卷 969-980页

作者： Annicchiarico, W. Cerrolaza, M. Cent Univ Venezuela Fac Ingn Inst Mat & Modelos Estruct Caracas Venezuela

The dynamical properties of structures, such as natural frequencies, damping ratios and mode shapes, can be obtained by several identification methods. Some are based on the direct signal processing in a time domain;others transform response data to the frequency domain. The development of these techniques is useful in the production of more accurate structural models;they can be also used to test the level of damage in structures (or verify their strength to support new load actions) by using experimental data. There are situations where frequency domain algorithms and conventional system identification techniques fail, do not allow adequate solution of the identification problems or become trapped in a local optimum. It is in these cases where evolutionary optimization techniques are important tools for evaluating the dynamical properties of structural systems in practical applications. This article presents a methodology to determine the dynamic properties of structures knowing their response in terms of displacement, velocities or accelerations in the time domain when they are subjected to a free vibration excitation. In order to do that, a specialized evolutionary algorithm capable of adapting its parameters to the different types of registers obtained from the dynamic time response of a structure is implemented in a robust way, making this approach useful in practical situations. A distributed real genetic algorithm (DRGA) based on an island model of different subpopulations is used to adjust a simulated response signal of a building to the real response signal. Initially, computer-generated synthetic response signals are used but, in future, the approach will be validated with signals obtained from free vibration experimental tests and will be extended to other types of dynamical excitation signals. Finally, the method will be tested with data obtained from earthquake events.

关键词： multi-objective optimization distributed evolutionary algorithms structural dynamics system identification problems

来源：评论

学校读者我要写书评

暂无评论

DEAP: evolutionary algorithms Made Easy

引用

JOURNAL OF MACHINE LEARNING RESEARCH 2012年第7期13卷 2171-2175页

作者： Fortin, Felix-Antoine De Rainville, Francois-Michel Gardner, Marc-Andre Parizeau, Marc Gagne, Christian Univ Laval Lab Vis & Syst Numer Dept Genie Elect & Genie Informat Quebec City PQ G1V 0A6 Canada

DEAP is a novel evolutionary computation framework for rapid prototyping and testing of ideas. Its design departs from most other existing frameworks in that it seeks to make algorithms explicit and data structures transparent, as opposed to the more common black-box frameworks. Freely available with extensive documentation at http://***, DEAP is an open source project under an LGPL license.

关键词： distributed evolutionary algorithms software tools

来源：评论

学校读者我要写书评

暂无评论

A Cooperative Parallel Search-Based Software Engineering Approach for Code-Smells Detection

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2014年第9期40卷 841-861页

作者： Kessentini, Wael Kessentini, Marouane Sahraoui, Houari Bechikh, Slim Ouni, Ali Univ Montreal Dept Comp Sci Montreal PQ Canada Univ Michigan Dept Comp Sci Dearborn MI 48128 USA

We propose in this paper to consider code-smells detection as a distributed optimization problem. The idea is that different methods are combined in parallel during the optimization process to find a consensus regarding the detection of code-smells. To this end, we used Parallel evolutionary algorithms (P-EA) where many evolutionary algorithms with different adaptations (fitness functions, solution representations, and change operators) are executed, in a parallel cooperative manner, to solve a common goal which is the detection of code-smells. An empirical evaluation to compare the implementation of our cooperative P-EA approach with random search, two single population-based approaches and two code-smells detection techniques that are not based on meta-heuristics search. The statistical analysis of the obtained results provides evidence to support the claim that cooperative P-EA is more efficient and effective than state of the art detection approaches based on a benchmark of nine large open source systems where more than 85 percent of precision and recall scores are obtained on a variety of eight different types of code-smells.

关键词： Search-based software engineering code-smells software quality distributed evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Surrogate-assisted distributed swarm optimisation for computationally expensive geoscientific models

引用

COMPUTATIONAL GEOSCIENCES 2023年第6期27卷 939-954页

作者： Chandra, Rohitash Sharma, Yash Vardhan Univ New South Wales Sch Math & Stat Transit Artificial Intelligence Res Grp Sydney Australia Indian Inst Technol Roorkee Mech & Ind Engn Dept Roorkee India

evolutionary algorithms provide gradient-free optimisation which is beneficial for models that have difficulty in obtaining gradients;for instance, geoscientific landscape evolution models. However, such models are at times computationally expensive and even distributed swarm-based optimisation with parallel computing struggle. We can incorporate efficient strategies such as surrogate-assisted optimisation to address the challenges;however, implementing inter-process communication for surrogate-based model training is difficult. In this paper, we implement surrogate-based estimation of fitness evaluation in distributed swarm optimisation over a parallel computing architecture. We first test the framework on a set of benchmark optimisation problems and then apply to a geoscientifc model that features landscape evolution model. Our results demonstrate very promising results for benchmark functions and the Badlands landscape evolution model. We obtain a reduction in computationally time while retaining optimisation solution accuracy through the use of surrogates in a parallel computing environment. The major contribution of the paper is in the application of surrogate-based optimisation for geoscientific models which can in the future help in better understanding of paleoclimate and geomorphology.

关键词： distributed evolutionary algorithms Surrogate-assisted optimization Bayesian optimisation Parallel computing Neuroevolution

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：