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.
In this paper we introduce plan2vec, an unsupervised representation learning approach that is inspired by reinforcement learning. Plan2vec constructs a weighted graph on an image dataset using near-neighbor distances, and then extrapolates this local metric to a global embedding by distilling path-integral over planned path. When applied to control, plan2vec offers a way to learn goal-conditioned value estimates that are accurate over long horizons that is both compute and sample efficient. We demonstrate the effectiveness of plan2vec on one simulated and two challenging real-world image datasets. Experimental results show that plan2vec successfully amortizes the planning cost, enabling reactive planning that is linear in memory and computation complexity rather than exhaustive over the entire state space.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2005.03648")
get_code_for_paper("2005.03648")
have("2005.03648")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2005.03648.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2005.03648)
Connect an agent — have() is free.