Learning Task-relevant Representations for Generalization via Characteristic Functions of Reward Sequence Distributions
Rui Yang, Jie Wang, Zijie Geng, Mingxuan Ye, Shuiwang Ji, Bin Li, Feng Wu
Abstract
Generalization across different environments with the same tasks is critical for successful applications of visual reinforcement learning (RL) in real scenarios. However, visual distractions---which are common in real scenes---from high-dimensional observations can be hurtful to the learned representations in visual RL, thus degrading the performance of generalization. To tackle this problem, we propose a novel approach, namely Characteristic Reward Sequence Prediction (CRESP), to extract the task-relevant information by learning reward sequence distributions (RSDs), as the reward signals are task-relevant in RL and invariant to visual distractions. Specifically, to effectively capture the task-relevant information via RSDs, CRESP introduces an auxiliary task---that is, predicting the characteristic functions of RSDs---to learn task-relevant representations, because we can well approximate the high-dimensional distributions by leveraging the corresponding characteristic functions. Experiments demonstrate that CRESP significantly improves the performance of generalization on unseen environments, outperforming several state-of-the-arts on DeepMind Control tasks with different visual distractions.
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 2d3c4e24-728d-48ff-b5dd-9b4b3d57dfb1Cited by top-tier papers9
- Reinforcement Learning within Tree Search for Fast Macro PlacementZijie Geng, Jie Wang, Ziyan Liu, Siyuan Xu et al.ICML 2024 · 23 citations
- State Sequences Prediction via Fourier Transform for Representation LearningMingxuan Ye, Yufei Kuang, Jie Wang, Rui Yang et al.NeurIPS 2023 · 18 citations
- Learning to Stop Cut Generation for Efficient Mixed-Integer Linear ProgrammingHaotian Ling, Zhihai Wang, Jie WangAAAI 2024 · 14 citations
- Scalable and Effective Arithmetic Tree Generation for Adder and Multiplier DesignsYao Lai, Jinxin Liu, David Z. Pan, Ping LuoNeurIPS 2024 · 14 citations
- De Novo Molecular Generation via Connection-aware Motif MiningZijie Geng, Shufang Xie, Yingce Xia, Lijun Wu et al.ICLR 2023 · 8 citations
Builds on13
- 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
- Network Randomization: A Simple Technique for Generalization in Deep Reinforcement LearningKimin Lee, Kibok Lee, Jinwoo Shin, Honglak LeeICLR 2020 · 191 citations
- Self-Supervised Policy Adaptation during DeploymentNicklas Hansen, Rishabh Jangir, Yu Sun, Guillem Alenyà et al.ICLR 2021 · 187 citations
Related papers
- Learning Robust Representations with Long-Term Information for Generalization in Visual Reinforcement LearningRui Yang, Jie Wang, Qijie Peng, Ruibo Guo et al.ICLR 2025
- Unsupervised Visual Attention and Invariance for Reinforcement LearningXudong Wang, Long Lian, Stella X. YuCVPR 2021
- TSTM: Temporal Segmentation for Task-relevant Mask in Visual Reinforcement Learning GeneralizationWeicheng Du, Wenjia Meng, Zhengzhe Zhang, Yilong Yin et al.CVPR 2026
- Focus On What Matters: Separated Models For Visual-Based RL GeneralizationDi Zhang, Bowen Lv, Hai Zhang, Feifan Yang et al.NeurIPS 2024 · 14 citations
- DRIBO: Robust Deep Reinforcement Learning via Multi-View Information BottleneckJiameng Fan, Wenchao LiICML 2022 · 49 citations
