Rishabh Agarwal, Marc Bellemare, Pablo Castro, Marlos Machado
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.
Reinforcement learning methods trained on few environments rarely learn policies that generalize to unseen environments. To improve generalization, we incorporate the inherent sequential structure in reinforcement learning into the representation learning process. This approach is orthogonal to recent approaches, which rarely exploit this structure explicitly. Specifically, we introduce a theoretically motivated policy similarity metric (PSM) for measuring behavioral similarity between states. PSM assigns high similarity to states for which the optimal policies in those states as well as in future states are similar. We also present a contrastive representation learning procedure to embed any state similarity metric, which we instantiate with PSM to obtain policy similarity embeddings (PSEs 1 ). We demonstrate that PSEs improve generalization on diverse benchmarks, including LQR with spurious correlations, a jumping task from pixels, and Distracting DM Control Suite. Source code is available at agarwl.github.io/pse.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2101.05265")
get_code_for_paper("2101.05265")
have("2101.05265")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2101.05265.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2101.05265)
Connect an agent — have() is free.