Saved in:
Bibliographic Details
Main Authors: Wang, Yuhui, Wu, Qingyuan, Ashley, Dylan R., Faccio, Francesco, Li, Weida, Huang, Chao, Schmidhuber, Jürgen
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2406.08404
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912466850545664
author Wang, Yuhui
Wu, Qingyuan
Ashley, Dylan R.
Faccio, Francesco
Li, Weida
Huang, Chao
Schmidhuber, Jürgen
author_facet Wang, Yuhui
Wu, Qingyuan
Ashley, Dylan R.
Faccio, Francesco
Li, Weida
Huang, Chao
Schmidhuber, Jürgen
contents The Value Iteration Network (VIN) is an end-to-end differentiable neural network architecture for planning. It exhibits strong generalization to unseen domains by incorporating a differentiable planning module that operates on a latent Markov Decision Process (MDP). However, VINs struggle to scale to long-term and large-scale planning tasks, such as navigating a 100x100 maze -- a task that typically requires thousands of planning steps to solve. We observe that this deficiency is due to two issues: the representation capacity of the latent MDP and the planning module's depth. We address these by augmenting the latent MDP with a dynamic transition kernel, dramatically improving its representational capacity, and, to mitigate the vanishing gradient problem, introduce an "adaptive highway loss" that constructs skip connections to improve gradient flow. We evaluate our method on 2D/3D maze navigation environments, continuous control, and the real-world Lunar rover navigation task. We find that our new method, named Dynamic Transition VIN (DT-VIN), scales to 5000 layers and solves challenging versions of the above tasks. Altogether, we believe that DT-VIN represents a concrete step forward in performing long-term large-scale planning in complex environments.
format Preprint
id arxiv_https___arxiv_org_abs_2406_08404
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Scaling Value Iteration Networks to 5000 Layers for Extreme Long-Term Planning
Wang, Yuhui
Wu, Qingyuan
Ashley, Dylan R.
Faccio, Francesco
Li, Weida
Huang, Chao
Schmidhuber, Jürgen
Machine Learning
Artificial Intelligence
I.2.6
The Value Iteration Network (VIN) is an end-to-end differentiable neural network architecture for planning. It exhibits strong generalization to unseen domains by incorporating a differentiable planning module that operates on a latent Markov Decision Process (MDP). However, VINs struggle to scale to long-term and large-scale planning tasks, such as navigating a 100x100 maze -- a task that typically requires thousands of planning steps to solve. We observe that this deficiency is due to two issues: the representation capacity of the latent MDP and the planning module's depth. We address these by augmenting the latent MDP with a dynamic transition kernel, dramatically improving its representational capacity, and, to mitigate the vanishing gradient problem, introduce an "adaptive highway loss" that constructs skip connections to improve gradient flow. We evaluate our method on 2D/3D maze navigation environments, continuous control, and the real-world Lunar rover navigation task. We find that our new method, named Dynamic Transition VIN (DT-VIN), scales to 5000 layers and solves challenging versions of the above tasks. Altogether, we believe that DT-VIN represents a concrete step forward in performing long-term large-scale planning in complex environments.
title Scaling Value Iteration Networks to 5000 Layers for Extreme Long-Term Planning
topic Machine Learning
Artificial Intelligence
I.2.6
url https://arxiv.org/abs/2406.08404