Distilling Morphology-Conditioned Hypernetworks for Efficient Universal Morphology Control

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Xiong, Zheng, Vuorio, Risto, Beck, Jacob, Zimmer, Matthieu, Shao, Kun, Whiteson, Shimon
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866914821392302080
author Xiong, Zheng
Vuorio, Risto
Beck, Jacob
Zimmer, Matthieu
Shao, Kun
Whiteson, Shimon
author_facet Xiong, Zheng
Vuorio, Risto
Beck, Jacob
Zimmer, Matthieu
Shao, Kun
Whiteson, Shimon
contents Learning a universal policy across different robot morphologies can significantly improve learning efficiency and enable zero-shot generalization to unseen morphologies. However, learning a highly performant universal policy requires sophisticated architectures like transformers (TF) that have larger memory and computational cost than simpler multi-layer perceptrons (MLP). To achieve both good performance like TF and high efficiency like MLP at inference time, we propose HyperDistill, which consists of: (1) A morphology-conditioned hypernetwork (HN) that generates robot-wise MLP policies, and (2) A policy distillation approach that is essential for successful training. We show that on UNIMAL, a benchmark with hundreds of diverse morphologies, HyperDistill performs as well as a universal TF teacher policy on both training and unseen test robots, but reduces model size by 6-14 times, and computational cost by 67-160 times in different environments. Our analysis attributes the efficiency advantage of HyperDistill at inference time to knowledge decoupling, i.e., the ability to decouple inter-task and intra-task knowledge, a general principle that could also be applied to improve inference efficiency in other domains.
format Preprint
id arxiv_https___arxiv_org_abs_2402_06570
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Distilling Morphology-Conditioned Hypernetworks for Efficient Universal Morphology Control
Xiong, Zheng
Vuorio, Risto
Beck, Jacob
Zimmer, Matthieu
Shao, Kun
Whiteson, Shimon
Machine Learning
Robotics
Learning a universal policy across different robot morphologies can significantly improve learning efficiency and enable zero-shot generalization to unseen morphologies. However, learning a highly performant universal policy requires sophisticated architectures like transformers (TF) that have larger memory and computational cost than simpler multi-layer perceptrons (MLP). To achieve both good performance like TF and high efficiency like MLP at inference time, we propose HyperDistill, which consists of: (1) A morphology-conditioned hypernetwork (HN) that generates robot-wise MLP policies, and (2) A policy distillation approach that is essential for successful training. We show that on UNIMAL, a benchmark with hundreds of diverse morphologies, HyperDistill performs as well as a universal TF teacher policy on both training and unseen test robots, but reduces model size by 6-14 times, and computational cost by 67-160 times in different environments. Our analysis attributes the efficiency advantage of HyperDistill at inference time to knowledge decoupling, i.e., the ability to decouple inter-task and intra-task knowledge, a general principle that could also be applied to improve inference efficiency in other domains.
title Distilling Morphology-Conditioned Hypernetworks for Efficient Universal Morphology Control
topic Machine Learning
Robotics
url https://arxiv.org/abs/2402.06570