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 introduce a sampling perspective to tackle the challenging task of training robust Reinforcement Learning (RL) agents. Leveraging the powerful Stochastic Gradient Langevin Dynamics, we present a novel, scalable two-player RL algorithm, which is a sampling variant of the two-player policy gradient method. Our algorithm consistently outperforms existing baselines, in terms of generalization across different training and testing conditions, on several MuJoCo environments. Our experiments also show that, even for objective functions that entirely ignore potential environmental shifts, our sampling approach remains highly robust in comparison to standard RL algorithms.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2002.06063")
get_code_for_paper("2002.06063")
have("2002.06063")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2002.06063.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2002.06063)
Connect an agent — have() is free.