paper-with-me

홈 › Papers

Evolutionary Selective Imitation: Interpretable Agents by Imitation Learning Without a Demonstrator

2020-09-17 · Roy Eliya, J. Michael Herrmann

We propose a new method for training an agent via an evolutionary strategy (ES), in which we iteratively improve a set of samples to imitate: Starting with a random set, in every iteration we replace a subset of the samples with samples from the best trajectories discovered so far. The evaluation procedure for this set is to train, via supervised learning, a randomly initialised neural network (NN) to imitate the set and then execute the acquired policy against the environment. Our method is thus an ES based on a fitness function that expresses the effectiveness of imitating an evolving data subset. This is in contrast to other ES techniques that iterate over the weights of the policy directly. By observing the samples that the agent selects for learning, it is possible to interpret and evaluate the evolving strategy of the agent more explicitly than in NN learning. In our experiments, we trained an agent to solve the OpenAI Gym environment Bipedalwalker-v3 by imitating an evolutionarily selected set of only 25 samples with a NN with only a few thousand parameters. We further test our method on the Procgen game Plunder and show here as well that the proposed method is an interpretable, small, robust and effective alternative to other ES or policy gradient methods.

📄 PDF Abstract BibTeX arXiv:2009.08403

Code (0)

등록된 구현이 없습니다.

Tasks

Imitation LearningOpenAI GymPolicy Gradient Methods

Similar Papers 제목 키워드 기반

Evolutionary game theory using agent-based methods

2016-08-31

Evolutionary game theory is a successful mathematical framework geared towards understanding the selective pressures that affect the evolution of the strategies of agents engaged in interactions with potential conflicts.…

An Evolutionary Strategy based on Partial Imitation for Solving Optimization Problems

2016-02-12 · Marco Alberto Javarone

In this work we introduce an evolutionary strategy to solve combinatorial optimization tasks, i.e. problems characterized by a discrete search space. In particular, we focus on the Traveling Salesman Problem (TSP), i.e. …

Combinatorial OptimizationTraveling Salesman Problem

Massively-concurrent Agent-based Evolutionary Computing

2015-01-27 · D. Krzywicki, W. Turek, A. Byrski, M. Kisiel-Dorohinicki

The fusion of the multi-agent paradigm with evolutionary computation yielded promising results in many optimization problems. Evolutionary multi-agent system (EMAS) are more similar to biological evolution than classical…

Evolutionary Algorithms

Modelling Agent Policies with Interpretable Imitation Learning

2020-06-19 · Tom Bewley, Jonathan Lawry, Arthur Richards

As we deploy autonomous agents in safety-critical domains, it becomes important to develop an understanding of their internal mechanisms and representations. We outline an approach to imitation learning for reverse-engin…

Imitation Learning

Co-Imitation Learning without Expert Demonstration

2021-03-27 · Kun-Peng Ning, Hu Xu, Kun Zhu, Sheng-Jun Huang

Imitation learning is a primary approach to improve the efficiency of reinforcement learning by exploiting the expert demonstrations. However, in many real scenarios, obtaining expert demonstrations could be extremely ex…

Imitation Learning