Can Increasing Input Dimensionality Improve Deep Reinforcement Learning?
Kei Ota, Tomoaki Oiki, Devesh K. Jha, Toshisada Mariyama, Daniel Nikovski
Abstract
Deep reinforcement learning (RL) algorithms have recently achieved remarkable successes in various sequential decision making tasks, leveraging advances in methods for training large deep networks. However, these methods usually require large amounts of training data, which is often a big problem for real-world applications. One natural question to ask is whether learning good representations for states and using larger networks helps in learning better policies. In this paper, we try to study if increasing input dimensionality helps improve performance and sample efficiency of model-free deep RL algorithms. To do so, we propose an online feature extractor network (OFENet) that uses neural nets to produce good representations to be used as inputs to deep RL algorithms. Even though the high dimensionality of input is usually supposed to make learning of RL agents more difficult, we show that the RL agents in fact learn more efficiently with the high-dimensional representation than with the lower-dimensional state observations. We believe that stronger feature propagation together with larger networks (and thus larger search space) allows RL agents to learn more complex functions of states and thus improves the sample efficiency. Through numerical experiments, we show that the proposed method outperforms several other state-of-the-art algorithms in terms of both sample efficiency and performance. Codes for the proposed method are available at this http URL .
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 7d7668ef-0bc2-4fe3-b3b6-9d54333da1acCited by top-tier papers14
- For SALE: State-Action Representation Learning for Deep Reinforcement LearningScott Fujimoto, Wei-Di Chang, Edward J. Smith, Shixiang Gu et al.NeurIPS 2023 · 128 citations
- 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
- Bridging State and History Representations: Understanding Self-Predictive RLTianwei Ni, Benjamin Eysenbach, Erfan Seyedsalehi, Michel Ma et al.ICLR 2024 · 50 citations
- LLM-Empowered State Representation for Reinforcement LearningBoyuan Wang, Yun Qu, Yuhang Jiang, Jianzhun Shao et al.ICML 2024 · 34 citations
- Cross-Domain Policy Adaptation by Capturing Representation MismatchJiafei Lyu, Chenjia Bai, Jingwen Yang, Zongqing Lu et al.ICML 2024 · 30 citations
Related papers
- Pretraining a Shared Q-Network for Data-Efficient Offline Reinforcement LearningJongchan Park, Mingyu Park, Donghwan LeeNeurIPS 2025 · 2 citations
- Stochastic Latent Actor-Critic: Deep Reinforcement Learning with a Latent Variable ModelAlex X. Lee, Anusha Nagabandi, Pieter Abbeel, Sergey LevineNeurIPS 2020 · 437 citations
- State Sequences Prediction via Fourier Transform for Representation LearningMingxuan Ye, Yufei Kuang, Jie Wang, Rui Yang et al.NeurIPS 2023 · 18 citations
- Synthetic Experience ReplayCong Lu, Philip J. Ball, Yee Whye Teh, Jack Parker-HolderNeurIPS 2023 · 148 citations
- Overcoming the Curse of Dimensionality in Reinforcement Learning Through Approximate FactorizationChenbei Lu, Laixi Shi, Zaiwei Chen, Chenye Wu et al.ICML 2025
