2017/03/10 by Tim Salimans, Salimans, Tim, Jonathan Ho +7 · 1 voice · 102 citations
Computer Science · Mathematics · #Artificial Intelligence (cs.AI) #Evolutionary Algorithms and Applications #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Metaheuristic Optimization Algorithms Research #Neural and Evolutionary Computing (cs.NE) #Reinforcement Learning in Robotics #cs.AI #cs.LG #cs.NE #stat.ML
paper · pdf · doi:10.48550/arxiv.1703.03864
openalex publication_date 2017/03/10 · arxiv published 2017/03/10 · arxiv updated 2017/09/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We explore the use of Evolution Strategies (ES), a class of black box optimization algorithms, as an alternative to popular MDP-based RL techniques such as Q-learning and Policy Gradients. Experiments on MuJoCo and Atari show that ES is a viable solution strategy that scales extremely well with the number of CPUs available: By using a novel communication strategy based on common random numbers, our ES implementation only needs to communicate scalars, making it possible to scale to over a thousand parallel workers. This allows us to solve 3D humanoid walking in 10 minutes and obtain competitive results on most Atari games after one hour of training. In addition, we highlight several advantages of ES as a black box optimization technique: it is invariant to action frequency and delayed rewards, tolerant of extremely long horizons, and does not need temporal discounting or value function approximation.