PulseAugur
中
实时 23:58:55

New Q-learning method achieves n^{-1/4} Gaussian approximation bound

作者 PulseAugur 编辑部 · [2 个来源] ·

Researchers have developed a new method for approximating Gaussian distributions in entropy-regularized Q-learning with function approximation. The study establishes convergence rates for averaged iterates generated by asynchronous Q-learning, achieving a Gaussian approximation bound with a rate of order n^{-1/4}. This work combines linearization of the soft Bellman recursion with a Gaussian approximation for the leading martingale term, also deriving high-order moment bounds for the algorithm's final iterate. AI

影响 Establishes theoretical bounds for Q-learning algorithms, potentially improving sample efficiency in reinforcement learning applications.

排序理由 The cluster contains an academic paper detailing a new theoretical result in machine learning.

在 arXiv stat.ML 阅读 →

AI 生成摘要 · Google Gemini · 来自 2 个来源。 我们如何撰写摘要 →

New Q-learning method achieves n^{-1/4} Gaussian approximation bound

报道来源 [2]

  1. arXiv stat.ML TIER_1 English(EN) · Artemy Rubtsov, Rahul Singh, Eric Moulines, Alexey Naumov, Sergey Samsonov ·

    On Gaussian approximation for entropy-regularized Q-learning with function approximation

    arXiv:2605.17678v1 Announce Type: new Abstract: In this paper, we derive rates of convergence in the high-dimensional central limit theorem for Polyak--Ruppert averaged iterates generated by entropy-regularized asynchronous Q-learning with linear function approximation and a poly…

  2. arXiv stat.ML TIER_1 English(EN) · Sergey Samsonov ·

    On Gaussian approximation for entropy-regularized Q-learning with function approximation

    In this paper, we derive rates of convergence in the high-dimensional central limit theorem for Polyak--Ruppert averaged iterates generated by entropy-regularized asynchronous Q-learning with linear function approximation and a polynomial stepsize $k^{-ω}$, $ω\in (1/2,1)$. Assumi…

相关实体

相关话题