{"title":"近端进化策略:通过进化策略优化改进深度强化学习","authors":"Yiming Peng, Gang Chen, Mengjie Zhang, Bing Xue","doi":"10.1007/s12293-024-00419-1","DOIUrl":null,"url":null,"abstract":"<p>Evolutionary Algorithms (EAs), including Evolutionary Strategies (ES) and Genetic Algorithms (GAs), have been widely accepted as competitive alternatives to Policy Gradient techniques for Deep Reinforcement Learning (DRL). However, they remain eclipsed by cutting-edge DRL algorithms in terms of time efficiency, sample complexity, and learning effectiveness. In this paper, aiming at advancing evolutionary DRL research, we develop an evolutionary policy optimization algorithm with three key technical improvements. First, we design an efficient layer-wise strategy for training DNNs through Covariance Matrix Adaptation Evolutionary Strategies (CMA-ES) in a highly scalable manner. Second, we establish a surrogate model based on proximal performance lower bound for fitness evaluations with low sample complexity. Third, we embed a gradient-based local search technique within the evolutionary policy optimization process to further improve the learning effectiveness. The three technical innovations jointly forge a new EA for DRL method named Proximal Evolutionary Strategies (PES). Our experiments on ten continuous control problems show that PES with layer-wise training can be more computationally efficient than CMA-ES; our surrogate model can remarkably reduce the sample complexity of PES in comparison to latest EAs for DRL including CMA-ES, OpenAI-ES, and Uber-GA; PES with gradient-based local search can significantly outperform several promising DRL algorithms including TRPO, AKCTR, PPO, OpenAI-ES, and Uber-GA.</p>","PeriodicalId":48780,"journal":{"name":"Memetic Computing","volume":null,"pages":null},"PeriodicalIF":3.3000,"publicationDate":"2024-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Proximal evolutionary strategy: improving deep reinforcement learning through evolutionary policy optimization\",\"authors\":\"Yiming Peng, Gang Chen, Mengjie Zhang, Bing Xue\",\"doi\":\"10.1007/s12293-024-00419-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Evolutionary Algorithms (EAs), including Evolutionary Strategies (ES) and Genetic Algorithms (GAs), have been widely accepted as competitive alternatives to Policy Gradient techniques for Deep Reinforcement Learning (DRL). However, they remain eclipsed by cutting-edge DRL algorithms in terms of time efficiency, sample complexity, and learning effectiveness. In this paper, aiming at advancing evolutionary DRL research, we develop an evolutionary policy optimization algorithm with three key technical improvements. First, we design an efficient layer-wise strategy for training DNNs through Covariance Matrix Adaptation Evolutionary Strategies (CMA-ES) in a highly scalable manner. Second, we establish a surrogate model based on proximal performance lower bound for fitness evaluations with low sample complexity. Third, we embed a gradient-based local search technique within the evolutionary policy optimization process to further improve the learning effectiveness. The three technical innovations jointly forge a new EA for DRL method named Proximal Evolutionary Strategies (PES). Our experiments on ten continuous control problems show that PES with layer-wise training can be more computationally efficient than CMA-ES; our surrogate model can remarkably reduce the sample complexity of PES in comparison to latest EAs for DRL including CMA-ES, OpenAI-ES, and Uber-GA; PES with gradient-based local search can significantly outperform several promising DRL algorithms including TRPO, AKCTR, PPO, OpenAI-ES, and Uber-GA.</p>\",\"PeriodicalId\":48780,\"journal\":{\"name\":\"Memetic Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":3.3000,\"publicationDate\":\"2024-08-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Memetic Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s12293-024-00419-1\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Memetic Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s12293-024-00419-1","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
摘要
进化算法(EAs),包括进化策略(ES)和遗传算法(GAs),已被广泛接受为深度强化学习(DRL)中政策梯度技术的竞争性替代方案。然而,它们在时间效率、样本复杂度和学习效果方面仍然无法与最先进的 DRL 算法相提并论。本文旨在推进进化 DRL 研究,我们开发了一种进化策略优化算法,并在技术上做了三项关键改进。首先,我们通过协方差矩阵适应进化策略(CMA-ES)设计了一种高效的分层策略,以高度可扩展的方式训练 DNN。其次,我们建立了一个基于近端性能下限的代用模型,用于低样本复杂度的适配性评估。第三,我们在进化策略优化过程中嵌入了基于梯度的局部搜索技术,以进一步提高学习效率。这三项技术创新共同打造了 DRL 方法的新 EA,命名为 "近端进化策略"(PES)。我们在 10 个连续控制问题上的实验表明,与 CMA-ES 相比,采用分层训练的 PES 计算效率更高;与 CMA-ES、OpenAI-ES 和 Uber-GA 等最新的 DRL EA 相比,我们的代用模型可以显著降低 PES 的样本复杂度;与 TRPO、AKCTR、PPO、OpenAI-ES 和 Uber-GA 等几种有前途的 DRL 算法相比,采用基于梯度的局部搜索的 PES 可以明显优于它们。
Proximal evolutionary strategy: improving deep reinforcement learning through evolutionary policy optimization
Evolutionary Algorithms (EAs), including Evolutionary Strategies (ES) and Genetic Algorithms (GAs), have been widely accepted as competitive alternatives to Policy Gradient techniques for Deep Reinforcement Learning (DRL). However, they remain eclipsed by cutting-edge DRL algorithms in terms of time efficiency, sample complexity, and learning effectiveness. In this paper, aiming at advancing evolutionary DRL research, we develop an evolutionary policy optimization algorithm with three key technical improvements. First, we design an efficient layer-wise strategy for training DNNs through Covariance Matrix Adaptation Evolutionary Strategies (CMA-ES) in a highly scalable manner. Second, we establish a surrogate model based on proximal performance lower bound for fitness evaluations with low sample complexity. Third, we embed a gradient-based local search technique within the evolutionary policy optimization process to further improve the learning effectiveness. The three technical innovations jointly forge a new EA for DRL method named Proximal Evolutionary Strategies (PES). Our experiments on ten continuous control problems show that PES with layer-wise training can be more computationally efficient than CMA-ES; our surrogate model can remarkably reduce the sample complexity of PES in comparison to latest EAs for DRL including CMA-ES, OpenAI-ES, and Uber-GA; PES with gradient-based local search can significantly outperform several promising DRL algorithms including TRPO, AKCTR, PPO, OpenAI-ES, and Uber-GA.
Memetic ComputingCOMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-OPERATIONS RESEARCH & MANAGEMENT SCIENCE
CiteScore
6.80
自引率
12.80%
发文量
31
期刊介绍:
Memes have been defined as basic units of transferrable information that reside in the brain and are propagated across populations through the process of imitation. From an algorithmic point of view, memes have come to be regarded as building-blocks of prior knowledge, expressed in arbitrary computational representations (e.g., local search heuristics, fuzzy rules, neural models, etc.), that have been acquired through experience by a human or machine, and can be imitated (i.e., reused) across problems.
The Memetic Computing journal welcomes papers incorporating the aforementioned socio-cultural notion of memes into artificial systems, with particular emphasis on enhancing the efficacy of computational and artificial intelligence techniques for search, optimization, and machine learning through explicit prior knowledge incorporation. The goal of the journal is to thus be an outlet for high quality theoretical and applied research on hybrid, knowledge-driven computational approaches that may be characterized under any of the following categories of memetics:
Type 1: General-purpose algorithms integrated with human-crafted heuristics that capture some form of prior domain knowledge; e.g., traditional memetic algorithms hybridizing evolutionary global search with a problem-specific local search.
Type 2: Algorithms with the ability to automatically select, adapt, and reuse the most appropriate heuristics from a diverse pool of available choices; e.g., learning a mapping between global search operators and multiple local search schemes, given an optimization problem at hand.
Type 3: Algorithms that autonomously learn with experience, adaptively reusing data and/or machine learning models drawn from related problems as prior knowledge in new target tasks of interest; examples include, but are not limited to, transfer learning and optimization, multi-task learning and optimization, or any other multi-X evolutionary learning and optimization methodologies.