Reinforcement Learning with Automated Auxiliary Loss Search
Tairan He, Yuge Zhang, Kan Ren, Minghuan Liu, Che Wang, Weinan Zhang, Yuqing Yang, Dongsheng Li
Abstract
A good state representation is crucial to solving complicated reinforcement learning (RL) challenges. Many recent works focus on designing auxiliary losses for learning informative representations. Unfortunately, these handcrafted objectives rely heavily on expert knowledge and may be sub-optimal. In this paper, we propose a principled and universal method for learning better representations with auxiliary loss functions, named Automated Auxiliary Loss Search (A2LS), which automatically searches for top-performing auxiliary loss functions for RL. Specifically, based on the collected trajectory data, we define a general auxiliary loss space of size 7.5 × 10 20 and explore the space with an efficient evolutionary search strategy. Empirical results show that the discovered auxiliary loss (namely, A2-winner) significantly improves the performance on both high-dimensional (image) and lowdimensional (vector) unseen tasks with much higher efficiency, showing promising generalization ability to different settings and even different benchmark domains. We conduct a statistical analysis to reveal the relations between patterns of auxiliary losses and RL performance. The codes and supplementary materials are available at https://seqml.github.io/a2ls . * The work was conducted during Tairan He's internship at Microsoft Research. † The corresponding author is Kan Ren. 36th Conference on Neural Information Processing Systems (NeurIPS 2022).
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 01e8d8e3-33bc-469b-9017-6eb07d96557fCited by top-tier papers3
- CrossQ: Batch Normalization in Deep Reinforcement Learning for Greater Sample Efficiency and SimplicityAditya Bhatt, Daniel Palenicek, Boris Belousov, Max Argus et al.ICLR 2024 · 106 citations
- Pre-training with Synthetic Data Helps Offline Reinforcement LearningZecheng Wang, Che Wang, Zixuan Dong, Keith W. RossICLR 2024 · 11 citations
- Graph Your Own PromptXi Ding, Lei Wang, Piotr Koniusz, Yongsheng GaoNeurIPS 2025 · 6 citations
Builds on21
- A Simple Framework for Contrastive Learning of Visual RepresentationsTing Chen, Simon Kornblith, Mohammad Norouzi, Geoffrey E. HintonICML 2020 · 24,064 citations
- Dream to Control: Learning Behaviors by Latent ImaginationDanijar Hafner, Timothy P. Lillicrap, Jimmy Ba, Mohammad NorouziICLR 2020 · 1,852 citations
- CURL: Contrastive Unsupervised Representations for Reinforcement LearningMichael Laskin, Aravind Srinivas, Pieter AbbeelICML 2020 · 1,261 citations
- Image Augmentation Is All You Need: Regularizing Deep Reinforcement Learning from PixelsDenis Yarats, Ilya Kostrikov, Rob FergusICLR 2021 · 911 citations
- Reinforcement Learning with Augmented DataMichael Laskin, Kimin Lee, Adam Stooke, Lerrel Pinto et al.NeurIPS 2020 · 833 citations
Related papers
- AM-LFS: AutoML for Loss Function SearchChuming Li, Xin Yuan, Chen Lin, Minghao Guo et al.ICCV 2019 · 75 citations
- Return-Based Contrastive Representation Learning for Reinforcement LearningGuoqing Liu, Chuheng Zhang, Li Zhao, Tao Qin et al.ICLR 2021 · 55 citations
- Contrastive Learning as Goal-Conditioned Reinforcement LearningBenjamin Eysenbach, Tianjun Zhang, Sergey Levine, Ruslan SalakhutdinovNeurIPS 2022 · 331 citations
- Loss Function Search for Face RecognitionXiaobo Wang, Shuo Wang, Cheng Chi, Shifeng Zhang et al.ICML 2020 · 51 citations
- Learning State Representations from Random Deep Action-conditional PredictionsZeyu Zheng, Vivek Veeriah, Risto Vuorio, Richard L. Lewis et al.NeurIPS 2021 · 6 citations
