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.
We consider the problem of knowledge transfer when an agent is facing a series of Reinforcement Learning (RL) tasks. We introduce a novel metric between Markov Decision Processes (MDPs) and establish that close MDPs have close optimal value functions. Formally, the optimal value functions are Lipschitz continuous with respect to the tasks space. These theoretical results lead us to a value-transfer method for Lifelong RL, which we use to build a PAC-MDP algorithm with improved convergence rate. Further, we show the method to experience no negative transfer with high probability. We illustrate the benefits of the method in Lifelong RL experiments.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2001.05411")
get_code_for_paper("2001.05411")
have("2001.05411")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2001.05411.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2001.05411)
Connect an agent — have() is free.