Christos Dimitrakakis, Thomas Kleine Buening, Victor Villin, Thomas Buening
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.
Learning a reward function from demonstrations suffers from low sample-efficiency. Even with abundant data, current inverse reinforcement learning methods that focus on learning from a single environment can fail to handle slight changes in the environment dynamics. We tackle these challenges through adaptive environment design. In our framework, the learner repeatedly interacts with the expert, with the former selecting environments to identify the reward function as quickly as possible from the expert's demonstrations in said environments. This results in improvements in both sample-efficiency and robustness, as we show experimentally, for both exact and approximate inference.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2210.14972")
get_code_for_paper("2210.14972")
have("2210.14972")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2210.14972.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2210.14972)
Connect an agent — have() is free.