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 new approach for comparing reinforcement learning policies, using Wasserstein distances (WDs) in a newly defined latent behavioral space. We show that by utilizing the dual formulation of the WD, we can learn score functions over policy behaviors that can in turn be used to lead policy optimization towards (or away from) (un)desired behaviors. Combined with smoothed WDs, the dual formulation allows us to devise efficient algorithms that take stochastic gradient descent steps through WD regularizers. We incorporate these regularizers into two novel on-policy algorithms, Behavior-Guided Policy Gradient and Behavior-Guided Evolution Strategies, which we demonstrate can outperform existing methods in a variety of challenging environments. We also provide an open source demo.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1906.04349")
get_code_for_paper("1906.04349")
have("1906.04349")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1906.04349.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1906.04349)
Connect an agent — have() is free.