研究人员推出了一种名为Delight-gated exploration (DE) 的新算法，旨在优化具有巨大动作空间的场景中的决策制定。DE根据其潜在的“delight”（一种结合了预期改进和惊喜的指标）来优先考虑探索性动作，而不是广泛搜索直到不确定性消除。这种方法比ε-greedy等传统方法更有效，尤其是在探索预算有限的情况下。该算法在各种bandit和MDP问题上都表现出了一致的性能，与Thompson Sampling和ε-greedy相比，其遗憾值有所降低。 AI
影响 为复杂环境中的决策制定提供了一种更有效的方法，有可能提高AI代理的性能。
排序理由 发布了一篇关于探索算法的新学术论文。
AI 生成摘要 · Google Gemini · 来自 2 个来源。 我们如何撰写摘要 →
arXiv:2605.13287v1 Announce Type: cross Abstract: Most exploration algorithms search broadly until uncertainty is resolved. When the action space is too large to resolve within budget, practitioners default to $\varepsilon$-greedy, which bounds disruption but spends its override …
Most exploration algorithms search broadly until uncertainty is resolved. When the action space is too large to resolve within budget, practitioners default to $\varepsilon$-greedy, which bounds disruption but spends its override blindly. We introduce \textit{Delight-gated explor…