FANS: A Flatness-Aware Network Structure for Generalization in Offline Reinforcement Learning
Da Wang, Yi Ma, Ting Guo, Hongyao Tang, Wei Wei, Jiye Liang
Abstract
Offline reinforcement learning (RL) aims to learn optimal policies from static datasets while enhancing generalization to out-of-distribution (OOD) data. To mitigate overfitting to suboptimal behaviors in offline datasets, existing methods often relax constraints on policy and data or extract informative patterns through data-driven techniques. However, there has been limited exploration into structurally guiding the optimization process toward flatter regions of the solution space that offer better generalization. Motivated by this observation, we present FANS , a generalization-oriented structured network framework that promotes flatter and robust policy learning by guiding the optimization trajectory through modular architectural design. FANS comprises four key components: (1) Residual Blocks, which facilitate compact and expressive representations; (2) Gaussian Activation, which promotes smoother gradients; (3) Layer Normalization, which mitigates overfitting; and (4) Ensemble Modeling, which reduces estimation variance. By integrating FANS into a standard actor-critic framework, we highlight that this remarkably simple architecture achieves superior performance across various tasks compared to many existing advanced methods. Moreover, we validate the effectiveness of FANS in mitigating overestimation and promoting generalization, demonstrating the promising potential of architectural design in advancing offline RL.
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 6dfa2292-57da-4ed7-91fd-d51707bbd234Builds on37
- Conservative Q-Learning for Offline Reinforcement LearningAviral Kumar, Aurick Zhou, George Tucker, Sergey LevineNeurIPS 2020 · 2,881 citations
- Decision Transformer: Reinforcement Learning via Sequence ModelingLili Chen, Kevin Lu, Aravind Rajeswaran, Kimin Lee et al.NeurIPS 2021 · 2,557 citations
- A Minimalist Approach to Offline Reinforcement LearningScott Fujimoto, Shixiang Shane GuNeurIPS 2021 · 1,292 citations
- Uncertainty-Based Offline Reinforcement Learning with Diversified Q-EnsembleGaon An, Seungyong Moon, Jang-Hyun Kim, Hyun Oh SongNeurIPS 2021 · 430 citations
- Offline Reinforcement Learning with Fisher Divergence Critic RegularizationIlya Kostrikov, Rob Fergus, Jonathan Tompson, Ofir NachumICML 2021 · 350 citations
Related papers
- Towards Efficient and Expressive Offline RL via Flow-Anchored Noise-conditioned Q-LearningSungyoung Lee, Dohyeong Kim, Eshan Balachandar, Zelal Mustafaoglu et al.ICML 2026
- Anti-Exploration by Random Network DistillationAlexander Nikulin, Vladislav Kurenkov, Denis Tarasov, Sergey KolesnikovICML 2023 · 55 citations
- ACTIVE: Offline Reinforcement Learning via Adaptive Imitation and In-sample V-EnsembleTianyuan Chen, Ronglong Cai, Faguo Wu, Xiao ZhangICLR 2025
- Flow Actor-Critic for Offline Reinforcement LearningJongseong Chae, Jongeui Park, Yongjae Shin, Gyeongmin Kim et al.ICLR 2026 · 7 citations
- When Data Geometry Meets Deep Function: Generalizing Offline Reinforcement LearningJianxiong Li, Xianyuan Zhan, Haoran Xu, Xiangyu Zhu et al.ICLR 2023 · 4 citations
