SoccerDream AI ← AI 圈资讯 论文研究

Improved Regret via Variance-Aware Policy Optimization in Adversarial MDPs

arXiv 机器学习 ·

arXiv:2611.17469v1 Announce Type: new Abstract: We study episodic adversarial MDPs with unknown dynamics and full-information rewards and achieve regret with leading term $\widetilde O(\sqrt{H^3SAK})$. Here $H$ is the horizon, $S$ the total number of states across decision layers, $A$ the number of actions, and $K$ the number of episodes. This improves the two incomparable prior leading terms by factors $\sqrt{S/H}$ and $\sqrt{H^3}$, leaving a factor $\sqrt H$ to the lower-bound scale. We give a reduction from unknown to known dynamics for \emph{downstream-dependent} algorithms, whose policy a

阅读原文 · arXiv 机器学习
本文由 SoccerDream AI 自动聚合索引,内容版权归原作者与 arXiv 机器学习 所有。
本站仅作技术动态聚合,不构成任何形式的建议。
AI 生成内容标识:本页的分析结论与文字内容由 SoccerDream AI 大语言模型自动生成,依据《人工智能生成合成内容标识办法》予以标注;赛事数据、赛果与市场指数来自公开数据源,并经系统规则校验。内容仅供研究参考,不构成任何建议。