q-exponential family for policy optimization
Lingwei Zhu, Haseeb Shah, Han Wang, Yukie Nagai, Martha White
Abstract
Policy optimization methods benefit from a simple and tractable policy parametrization, usually the Gaussian for continuous action spaces. In this paper, we consider a broader policy family that remains tractable: the q-exponential family. This family of policies is flexible, allowing the specification of both heavy-tailed policies (q > 1) and light-tailed policies (q < 1). This paper examines the interplay between q-exponential policies for several actor-critic algorithms conducted on both online and offline problems. We find that heavy-tailed policies are more effective in general and can consistently improve on Gaussian. In particular, we find the Student's t-distribution to be more stable than the Gaussian across settings and that a heavy-tailed q-Gaussian for Tsallis Advantage Weighted Actor-Critic consistently performs well in offline benchmark problems. In summary, we find that the Student's t policy a strong candidate for drop-in replacement to the Gaussian. Our code is available at https://github.com/lingweizhu/qexp .
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 0375c53e-bf48-426d-b206-438ba6e5b6f7Cited by top-tier papers1
Ask how each one uses itBuilds on8
- Offline Reinforcement Learning with Implicit Q-LearningIlya Kostrikov, Ashvin Nair, Sergey LevineICLR 2022 · 1,402 citations
- A Minimalist Approach to Offline Reinforcement LearningScott Fujimoto, Shixiang Shane GuNeurIPS 2021 · 1,292 citations
- On the Global Convergence Rates of Softmax Policy Gradient MethodsJincheng Mei, Chenjun Xiao, Csaba Szepesvári, Dale SchuurmansICML 2020 · 349 citations
- A Policy-Guided Imitation Approach for Offline Reinforcement LearningHaoran Xu, Li Jiang, Jianxiong Li, Xianyuan ZhanNeurIPS 2022 · 86 citations
- Offline RL with No OOD Actions: In-Sample Learning via Implicit Value RegularizationHaoran Xu, Li Jiang, Jianxiong Li, Zhuoran Yang et al.ICLR 2023 · 4 citations
Related papers
- Fat-to-Thin Policy Optimization: Offline Reinforcement Learning with Sparse PoliciesLingwei Zhu, Han Wang, Yukie NagaiICLR 2025
- On the Hidden Biases of Policy Mirror Ascent in Continuous Action SpacesAmrit Singh Bedi, Souradip Chakraborty, Anjaly Parayil, Brian M. Sadler et al.ICML 2022 · 20 citations
- Tackling Heavy-Tailed Q-Value Bias in Offline-to-Online Reinforcement Learning with Laplace-Robust ModelingRuibo Guo, Lei Liu, Rui Yang, Junjie Shen et al.ICLR 2026
- Provably Robust Temporal Difference Learning for Heavy-Tailed RewardsSemih Cayci, Atilla EryilmazNeurIPS 2023 · 12 citations
- General Munchausen Reinforcement Learning with Tsallis Kullback-Leibler DivergenceLingwei Zhu, Zheng Chen, Matthew Schlegel, Martha WhiteNeurIPS 2023 · 4 citations
