存在撒谎神谕下的序列预测

中文摘要 AI 辅助

我们研究m元序列的序列预测问题：在每一轮，（i）环境从m元字母表中选择一个结果；（ii）学习者选择同一字母表上的概率分布（不知晓环境生成的结果）；（iii）学习者产生的代价取决于分配给该结果的概率。所考虑的代价函数刻画了通过向撒谎神谕进行对比查询来完成预测这一场景下，预测环境生成结果的复杂度。我们分别针对随机环境和对抗环境展开研究，为两种场景提出了算法，并建立了它们的遗憾对数上界。

英文摘要

We consider the problem of sequential prediction of an $m$-ary sequence, where at each epoch, (i) the environment selects an outcome from an $m$-ary alphabet, (ii) the learner selects a probability distribution over the same alphabet (unaware of the outcome generated by the environment), and finally, (iii) the learner incurs a cost that depends on the probability assigned to the outcome. The cost function we consider captures the complexity of predicting the outcome generated by the environment, in a scenario where the aforementioned prediction is performed via comparative queries to a lying oracle. We consider both stochastic and adversarial environments, propose algorithms for both settings, and establish logarithmic upper bounds on their regret.

发表机构

• IIT Bombay（印度理工学院孟买分校）

机构由 AI 辅助整理，请以论文原文为准。