We lifted 5 functions out of this paper's own repositories and ran 4 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| OpenRL-Lab/DGPO | canonical | 2 of 3 |
| WentseChen/Soft-QMIX | pwc_unofficial | 2 of 2 |
| Function | Status | Where it lives |
|---|---|---|
| categorical_entropy | Ran | WentseChen/Soft-QMIX/src/components/action_selectors.py pointer only (licence: Apache-2.0) · get_code("6008b0eb92d8067c") |
| check | Ran | OpenRL-Lab/DGPO/onpolicy/algorithms/utils/util.py code served (permissive licence) · get_code("9589eca5bae9de80") |
| init | Ran | OpenRL-Lab/DGPO/onpolicy/algorithms/utils/util.py code served (permissive licence) · get_code("9de355e93051e4ad") |
| multinomial_entropy | Ran | WentseChen/Soft-QMIX/src/components/action_selectors.py pointer only (licence: Apache-2.0) · get_code("1da3ad2020291e67") |
| get_clones | Not yet run | OpenRL-Lab/DGPO/onpolicy/algorithms/utils/util.py code served (permissive licence) · get_code("0944240e80ec7625") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Most reinforcement learning algorithms seek a single optimal strategy that solves a given task. However, it can often be valuable to learn a diverse set of solutions, for instance, to make an agent's interaction with users more engaging, or improve the robustness of a policy to an unexpected perturbance. We propose Diversity-Guided Policy Optimization (DGPO), an on-policy algorithm that discovers multiple strategies for solving a given task. Unlike prior work, it achieves this with a shared policy network trained over a single run. Specifically, we design an intrinsic reward based on an information-theoretic diversity objective. Our final objective alternately constraints on the diversity of the strategies and on the extrinsic reward. We solve the constrained optimization problem by casting it as a probabilistic inference task and use policy iteration to maximize the derived lower bound. Experimental results show that our method efficiently discovers diverse strategies in a wide variety of reinforcement learning tasks. Compared to baseline methods, DGPO achieves comparable rewards, while discovering more diverse strategies, and often with better sample efficiency.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2207.05631")
get_code_for_paper("2207.05631")
have("2207.05631")
Connect an agent — have() is free.