研究人员探讨了重尾赌徒学习者所面临的挑战,这些学习者由于未见过的奖励而难以适应未知的时刻。对最优臂定律的新表征允许以恒定因子成本适应这些未知时刻。该方法利用了分位数修剪的UCB指数,在具有可见最优臂和有限均值奖励的实例上实现了对数期望遗憾。 AI
排序理由 该集群包含两篇讨论计算学习理论和赌徒算法的学术论文。
在 Hugging Face Daily Papers 阅读 →
AI 生成摘要 · Google Gemini · 来自 3 个来源。 我们如何撰写摘要 →
研究人员探讨了重尾赌徒学习者所面临的挑战,这些学习者由于未见过的奖励而难以适应未知的时刻。对最优臂定律的新表征允许以恒定因子成本适应这些未知时刻。该方法利用了分位数修剪的UCB指数,在具有可见最优臂和有限均值奖励的实例上实现了对数期望遗憾。 AI
排序理由 该集群包含两篇讨论计算学习理论和赌徒算法的学术论文。
在 Hugging Face Daily Papers 阅读 →
AI 生成摘要 · Google Gemini · 来自 3 个来源。 我们如何撰写摘要 →
完整方法见我们的编辑标准。
arXiv:2611.12140v2 Announce Type: replace-cross Abstract: Heavy-tailed bandit learners must tell a poor arm from an arm whose favorable rewards have not yet appeared. We characterize this obstruction through a scale of one-sided visibility conditions on the optimal reward law: th…
Heavy-tailed bandit learners without moment parameters face an obstruction: the rewards that carry an arm's mean can stay unseen. We address the remaining part of a COLT open problem by characterizing the optimal-arm laws that permit adaptation to unknown moments at constant-fact…
<p>Vanessa Kosoy and I recently uploaded a new <a href="https://arxiv.org/abs/2610.08740">paper</a> to arXiv. In this post, I briefly describe what the paper does, and attempt to explain in a self-contained way why this is a useful thing to do for ASI alignment. For a more comple…