新的Q学习框架解决了平均奖励强化学习的挑战

作者 PulseAugur 编辑部 · [1 个来源] · 2026-10-14 04:00

研究人员开发了一个新的平均奖励强化学习框架，解决了非混合马尔可夫链带来的挑战。所提出的方法使用与奖励无关的m步混合策略来正则化学习策略的收缩和探索特性。分析为Q学习算法提供了有限时间保证，匹配了单步设置中现有的速率，并推导了m步混合的新速率。该研究还扩展到Q规划变体，表明规划充当时间局部学习，规划范围在边界值偏差和样本复杂度之间取得平衡。 AI

影响为强化学习引入了新颖的理论框架，可能在平均奖励设置中提高智能体性能。

排序理由详细介绍强化学习新理论框架和算法的学术论文。 [lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv stat.ML 阅读 →

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

本文如何被排名

Signal score: 3 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 详细介绍强化学习新理论框架和算法的学术论文。 [lever_c_demoted from research: ic=1 ai=1.0]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: High; Clearly on-topic for AI-industry coverage.
Story freshness: Same-day; Cluster formed today. Ranking reflects the current source set at time of score.

完整方法见我们的编辑标准。

报道来源 [1]

arXiv stat.ML TIER_1 English(EN) · Julien Roger, Sam Bodmer, Jian Qian, Benjamin Riviere · 2026-10-14 04:00

混合正则化用于平均奖励 $Q$-学习和 $Q$-规划

arXiv:2610.14988v1 Announce Type: cross Abstract: The average-reward setting for reinforcement learning is challenging because its Bellman operator is known to contract in span only when the underlying Markov chain is mixing. Whereas existing work typically assumes a contraction …

本文如何被排名

报道来源 [1]

混合正则化用于平均奖励 $Q$-学习和 $Q$-规划

相关实体

相关话题