XLVIN: eXecuted Latent Value Iteration Nets
About
Value Iteration Networks (VINs) have emerged as a popular method to incorporate planning algorithms within deep reinforcement learning, enabling performance improvements on tasks requiring long-range reasoning and understanding of environment dynamics. This came with several limitations, however: the model is not incentivised in any way to perform meaningful planning computations, the underlying state space is assumed to be discrete, and the Markov decision process (MDP) is assumed fixed and known. We propose eXecuted Latent Value Iteration Networks (XLVINs), which combine recent developments across contrastive self-supervised learning, graph representation learning and neural algorithmic reasoning to alleviate all of the above limitations, successfully deploying VIN-style models on generic environments. XLVINs match the performance of VIN-like models when the underlying MDP is discrete, fixed and known, and provides significant improvements to model-free baselines across three general MDP setups.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Graph Coloring | Erdos Renyi 100 sampled tasks | Average Violations25 | 6 | |
| Graph Coloring | Erdos Renyi 2 (100 sampled tasks) | Average Violations93.8 | 6 | |
| Graph Coloring | Holme Kim 100 sampled tasks | Average Violations29 | 6 | |
| Graph Coloring | Holme Kim 2 (100 sampled tasks) | Average Violations182.6 | 6 | |
| Graph Coloring | Regular Expander 100 sampled tasks | Average Violations29 | 6 | |
| Graph Coloring | Paley 100 sampled tasks | Average Violations151.8 | 6 | |
| Graph Coloring | Complete (100 sampled tasks) | Average Violations34.8 | 6 | |
| Graph Coloring | Regular Expander 2 (100 sampled tasks) | Average Violations112.6 | 5 |