Simple Random Search Provides A Competitive Approach To Reinforcement Learning

Abstract

A common belief in model-free reinforcement learning is that methods based on random search in the parameter space of policies exhibit significantly worse sample complexity than those that explore the space of actions. We dispel such beliefs by introducing a random search method for training static, linear policies for continuous control problems, matching state-of-the-art sample efficiency on the benchmark MuJoCo locomotion tasks. Our method also finds a nearly optimal controller for a challenging instance of the Linear Quadratic Regulator, a classical problem in control theory, when the dynamics are not known. Computationally, our random search algorithm is at least 15 times more efficient than the fastest competing model-free methods on these benchmarks. We take advantage of this computational efficiency to evaluate the performance of our method over hundreds of random seeds and many different hyperparameter configurations for each benchmark task. Our simulations highlight a high va

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keymania2018simple

Related papers

• Augmented Random Search For Quadcopter Control: An Alternative To Reinforcement Learning (2019)2.26
• Computationally Efficient Reinforcement Learning: Targeted Exploration Leveraging Simple Rules (2022)2.26
• Random Latent Exploration For Deep Reinforcement Learning (2024)0.00
• Multi-objective Model-based Policy Search For Data-efficient Learning With Sparse Rewards (2018)0.00
• PC-MLP: Model-based Reinforcement Learning With Policy Cover Guided Exploration (2021)0.00
• Extremum-seeking Action Selection For Accelerating Policy Optimization (2024)0.00
• On The Sample Complexity And Metastability Of Heavy-tailed Policy Search In Continuous Control (2021)0.00
• Exploring Reinforcement Learning Techniques For Discrete And Continuous Control Tasks In The Mujoco Environment (2023)0.00