arXiv:2512.18763cs.LG2025-12被引 2

用高斯混合模型直接建模强化学习的Q函数,提升效率与精度。

Gaussian-Mixture-Model Q-Functions for Policy Iteration in Reinforcement Learning

  • 用高斯混合模型替代传统方法建模Q函数,具备强表达能力。
  • 在多个基准任务中性能媲美甚至超越现有方法,计算开销更小。
  • 基于黎曼流形优化,适合追求高效精确的强化学习研究者。

不同于传统将高斯混合模型(GMM)用于概率密度估计,本文提出将其作为Q函数损失的直接近似器,称为GMM-QF。该方法具有强大的表示能力,被证明是广泛函数类的通用逼近器。其可学习参数——固定数量的混合权重、高斯均值向量和协方差矩阵——通过在乘积黎曼流形上的优化从数据中推断。这种几何视角自然地将黎曼优化引入标准策略迭代框架中的策略评估步骤。严格的理论分析建立了所提策略迭代方案下Q函数估计误差的性能界。数值实验表明,GMM-QF在多种基准强化学习任务中表现优异,部分场景优于当前先进方法,且相比深度学习方法显著降低计算开销。

原文摘要 · Abstract (English)

Unlike their conventional use as estimators of probability density functions in reinforcement learning (RL), this paper introduces a novel function-approximation role for Gaussian mixture models (GMMs) as direct surrogates for Q-function losses. The proposed estimators, termed GMM-QFs, possess substantial representational capacity, as they are shown to be universal approximators over a broad class of functions. They are further embedded within Bellman residuals, where their learnable parameters--a fixed number of mixing weights, together with Gaussian mean vectors and covariance matrices--are inferred from data via optimization on a product Riemannian manifold. This geometric perspective on the parameter space naturally introduces Riemannian optimization into the policy-evaluation step of standard policy-iteration (PI) frameworks. Moreover, rigorous theoretical analysis establishes performance bounds on Q-function estimation error under the proposed PI scheme. Supporting numerical tests show that GMM-QFs deliver competitive performance and, in some cases, outperform state-of-the-art approaches across a range of benchmark RL tasks, all while maintaining a significantly smaller computational footprint than deep-learning methods.

强化学习高斯混合函数逼近黎曼优化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。