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.
Recently, neuro-inspired episodic control (EC) methods have been developed to overcome the data-inefficiency of standard deep reinforcement learning approaches. Using non-/semi-parametric models to estimate the value function, they learn rapidly, retrieving cached values from similar past states. In realistic scenarios, with limited resources and noisy data, maintaining meaningful representations in memory is essential to speed up the learning and avoid catastrophic forgetting. Unfortunately, EC methods have a large space and time complexity. We investigate different solutions to these problems based on prioritising and ranking stored states, as well as online clustering techniques. We also propose a new dynamic online k-means algorithm that is both computationally-efficient and yields significantly better performance at smaller memory sizes; we validate this approach on classic reinforcement learning environments and Atari games.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1911.09560")
get_code_for_paper("1911.09560")
have("1911.09560")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1911.09560.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1911.09560)
Connect an agent — have() is free.