PulseAugur
中
实时 08:16:52
English(EN) Near-Optimal Regret for Oracle-Efficient Adversarial Contextual Bandits

新算法改进了对抗性 MDP 和上下文老虎机中的遗憾界限

研究人员为对抗性马尔可夫决策过程 (MDP) 和上下文老虎机中的策略优化开发了新算法。对于对抗性 MDP,一种利用稳定性匹配奖励的新颖方法 VOPO,在遗憾界限上比先前方法提高了 $\sqrt{S/H}$ 和 $\sqrt{H^3}$ 的因子。在上下文老虎机领域,一种新的 Oracle-高效算法通过采用具有拉普拉斯噪声的策略分数扰动,实现了近乎最优的遗憾率,改进了先前依赖于时间范围的界限。 AI

影响 这些在策略优化和遗憾最小化方面的进展可能导致在复杂、动态环境中更高效、更鲁棒的 AI 代理。

排序理由 该集群包含两篇学术论文,详细介绍了机器学习研究领域(对抗性 MDP 和上下文老虎机)的新算法和理论改进。

在 Hugging Face Daily Papers 阅读 →

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

新算法改进了对抗性 MDP 和上下文老虎机中的遗憾界限

本文如何被排名

Signal score
0 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Research
该集群包含两篇学术论文,详细介绍了机器学习研究领域(对抗性 MDP 和上下文老虎机)的新算法和理论改进。
Source corroboration
2 independent sources
Multiple independent publishers reporting the same story raises confidence that it's real and newsworthy.
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
5 days old
Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

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

报道来源 [2]

  1. arXiv cs.LG TIER_1 English(EN) · Ofir Schlisselberg, Alon Cohen, Yishay Mansour ·

    在对抗性MDP中通过方差感知策略优化改进遗憾

    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…

  2. Hugging Face Daily Papers TIER_1 English(EN) ·

    面向Oracle高效对抗性上下文赌博机的近乎最优遗憾

    We study contextual bandits with $K$ actions, a class of $N$ policies, and i.i.d.\ contexts from a distribution that the learner can sample. For any sequence of loss functions fixed before play, we give an oracle-efficient algorithm with expected regret $O(\sqrt{KT\log(2N)}\,\log…