paper-with-me

Papers

Maximum Mutation Reinforcement Learning for Scalable Control

2020-07-24 · Karush Suri, Xiao Qi Shi, Konstantinos N. Plataniotis, Yuri A. Lawryshyn

Advances in Reinforcement Learning (RL) have demonstrated data efficiency and optimal control over large state spaces at the cost of scalable performance. Genetic methods, on the other hand, provide scalability but depict hyperparameter sensitivity towards evolutionary operations. However, a combination of the two methods has recently demonstrated success in scaling RL agents to high-dimensional action spaces. Parallel to recent developments, we present the Evolution-based Soft Actor-Critic (ESAC), a scalable RL algorithm. We abstract exploration from exploitation by combining Evolution Strategies (ES) with Soft Actor-Critic (SAC). Through this lens, we enable dominant skill transfer between offsprings by making use of soft winner selections and genetic crossovers in hindsight and simultaneously improve hyperparameter sensitivity in evolutions using the novel Automatic Mutation Tuning (AMT). AMT gradually replaces the entropy framework of SAC allowing the population to succeed at the task while acting as randomly as possible, without making use of backpropagation updates. In a study of challenging locomotion tasks consisting of high-dimensional action spaces and sparse rewards, ESAC demonstrates improved performance and sample efficiency in comparison to the Maximum Entropy framework. Additionally, ESAC presents efficacious use of hardware resources and algorithm overhead. A complete implementation of ESAC can be found at karush17.github.io/esac-web/.

📄 PDF Abstract BibTeX arXiv:2007.13690

Code (2)

karush17/emix pytorch
karush17/esac pytorch

Tasks

reinforcement-learningReinforcement LearningReinforcement Learning (RL)Sensitivity

Methods 이 논문이 사용한 방법론

Dilated Convolution 설명 없음
Global Average Pooling Global Average Pooling is a pooling operation designed to replace fully connected layers in classical CNNs. The idea is to generate one feature map for each corresponding…
Average Pooling 설명 없음
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
1x1 Convolution A 1 x 1 Convolution is a convolution with some special properties in that it can be used for dimensionality reduction,…
SAC 설명 없음

Similar Papers 제목 키워드 기반

Probabilistic Pontryagin's Maximum Principle for Continuous-Time Model-Based Reinforcement Learning

2025-04-03 · David Leeftink, Çağatay Yıldız, Steffen Ridderbusch, Max Hinne 외

Without exact knowledge of the true system dynamics, optimal control of non-linear continuous-time systems requires careful treatment of epistemic uncertainty. In this work, we propose a probabilistic extension to Pontry…

Model-based Reinforcement Learningreinforcement-learningReinforcement Learning

Maximum Entropy of Random Permutation Set

2021-12-16 · Jixiang Deng, Yong Deng

Recently, a new type of set, named as random permutation set (RPS), is proposed by considering all the permutations of elements in a certain set. For measuring the uncertainty of RPS, the entropy of RPS is presented. How…

A Reinforcement Learning Perspective on the Optimal Control of Mutation Probabilities for the (1+1) Evolutionary Algorithm: First Results on the OneMax Problem

2019-05-09 · Luca Mossina, Emmanuel Rachelson, Daniel Delahaye

We study how Reinforcement Learning can be employed to optimally control parameters in evolutionary algorithms. We control the mutation probability of a (1+1) evolutionary algorithm on the OneMax function. This problem i…

Evolutionary AlgorithmsQ-Learningreinforcement-learningReinforcement Learning+1

Cheap Permutation Testing

2025-02-11 · Carles Domingo-Enrich, Raaz Dwivedi, Lester Mackey

Permutation tests are a popular choice for distinguishing distributions and testing independence, due to their exact, finite-sample control of false positives and their minimax optimality when paired with U-statistics. H…

Permutation Complexity Bound on Out-Sample Error

2010-12-01 · NeurIPS 2010 12 · Malik Magdon-Ismail

We define a data dependent permutation complexity for a hypothesis set \math{\hset}, which is similar to a Rademacher complexity or maximum discrepancy. The permutation complexity is based like the maximum discrepancy on…

Math