SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2004.12399 · ICML · 2020

Reinforcement Learning Generalization with Surprise Minimization

Jerry Chen

arXiv · PDF · Open in the Atlas

Code that ran

We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Generalization remains a challenging problem for deep reinforcement learning algorithms, which are often trained and tested on the same set of deterministic game environments. When test environments are unseen and perturbed but the nature of the task remains the same, generalization gaps can arise. In this work, we propose and evaluate a surprise minimizing agent on a generalization benchmark to show an additional reward learned from a simple density model can show robustness in procedurally generated game environments that provide constant source of entropy and stochasticity. Recent work (SMiRL) (Berseth et al., 2019) inspired by the free energy principle (Friston, 2010) has shown that intelligent behaviours can emerge from minimizing expected

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2004.12399")
get_code_for_paper("2004.12399")
have("2004.12399")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2004.12399.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2004.12399.svg)](https://syntology.ai/paper/2004.12399)

Connect an agent — have() is free.