Policy search with rare significant events: Choosing the right partner to cooperate with

Abstract

This paper focuses on a class of reinforcement learning problems where significant events are rare and limited to a single positive reward per episode. A typical example is that of an agent who has to choose a partner to cooperate with, while a large number of partners are simply not interested in cooperating, regardless of what the agent has to offer. We address this problem in a continuous state and action space with two different kinds of search methods: a gradient policy search method and a direct policy search method using an evolution strategy. We show that when significant events are rare, gradient information is also scarce, making it difficult for policy gradient search methods to find an optimal policy, with or without a deep neural architecture. On the other hand, we show that direct policy search methods are invariant to the rarity of significant events, which is yet another confirmation of the unique role evolutionary algorithms has to play as a reinforcement learning method.

Applications of Deep Learning for Drug Discovery Systems with BigData

“…There are mainly three types of approaches. (II-a) Deep reinforcement learning is a machine-learning algorithm that deals with a type of problem where a learner performs a certain state and receives a certain reward [202][203][204][205][206][207][208][209][210][211][212][213]. By repeatedly selecting actions and receiving rewards, it learns decision-making strategies for selecting actions that yield more rewards in the future.…”

Deep Reinforcement Learning Versus Evolution Strategies: A Comparative Survey

“…Although DRL and ESs have the same objectiveoptimizing an objective function in a potentially unknown environment-they have different strengths and weaknesses [175], [176]. For example, DRL can be sample efficient, while ESs have robust convergence properties and exploration strategies.…”