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.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Model-free deep reinforcement learning is sample inefficient. One hypothesis -- speculated, but not confirmed -- is that catastrophic interference within an environment inhibits learning. We test this hypothesis through a large-scale empirical study in the Arcade Learning Environment (ALE) and, indeed, find supporting evidence. We show that interference causes performance to plateau; the network cannot train on segments beyond the plateau without degrading the policy used to reach there. By synthetically controlling for interference, we demonstrate performance boosts across architectures, learning algorithms and environments. A more refined analysis shows that learning one segment of a game often increases prediction errors elsewhere. Our study provides a clear empirical link between catastrophic interference and sample efficiency in reinforcement learning.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2002.12499")
get_code_for_paper("2002.12499")
have("2002.12499")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2002.12499.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2002.12499)
Connect an agent — have() is free.