Discrete Natural Evolution Strategies
Natural evolution strategies are a class of approximate-gradient black-box optimizers that have been successfully used for continuous parameter spaces. In this paper, we derive NES algorithms for discrete parameter spaces and demonstrate their effectiveness in tasks involving discrete parameters.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Learning Discrete Structured Variational Auto-Encoder using Natural Evolution Strategies
Discrete variational auto-encoders (VAEs) are able to represent semantic latent spaces in generative learning. In many real-life settings, the discrete latent space consists of high-dimensional structures, and propagatin…
Learning Synthetic Environments for Reinforcement Learning with Evolution Strategies
This work explores learning agent-agnostic synthetic environments (SEs) for Reinforcement Learning. SEs act as a proxy for target environments and allow agents to be trained more efficiently than when directly trained on…
Acrobotreinforcement-learningReinforcement LearningReinforcement Learning (RL)Natural evolution strategies and variational Monte Carlo
A notion of quantum natural evolution strategies is introduced, which provides a geometric synthesis of a number of known quantum/classical algorithms for performing classical black-box optimization. Recent work of Gomes…
Combinatorial OptimizationVariational Monte CarloEvolutionary games: natural selection of strategies
In this paper, I model and study the process of natural selection between all possible mixed strategies in classical two-player two-strategy games. I derive and solve an equation that is a natural generalization of the T…
Mixed strategy approach destabilizes cooperation in finite populations with clustering coefficient
Evolutionary game theory, encompassing discrete, continuous, and mixed strategies, is pivotal for understanding cooperation dynamics. Discrete strategies involve deterministic actions with a fixed probability of one, whe…
Clustering