论文 ID ATH-ZW5STC
· 二区论文
· 计算机科学
CC-BY
这是一篇从 Theory of Computing 导入的开放获取论文,用于长期保存;它并非本站投稿,因此不设版本历史与时间戳历史。
- 原出版日期:2012年1月1日 UTC
- 权利状态:CC-BY(未记录届满日期)
- 加入本站:2026年10月3日 UTC
由以下人员代作者上传 AthenXiv (UW2JTS24Y)
摘要
Algorithms in varied fields use the idea of maintaining a distribution over a certain set and use the multiplicative update rule to iteratively change these weights. Their analyses are usually very similar and rely on an exponential potential function. In this survey we present a simple meta-algorithm that unifies many of these disparate algorithms and derives them as simple instantiations of the meta-algorithm. We feel that since this meta-algorithm and its analysis are so simple, and its applications so broad, it should be a standard part of algorithms courses, like “divide and conquer.”
关键词: Advanced Bandit Algorithms Research, Management Science and Operations Research, Decision Sciences, Social Sciences
DOI: 10.4086/toc.2012.v008a006
许可协议: CC-BY
在线阅读
外部链接
- DOI Theory of Computing https://doi.org/10.4086/toc.2012.v008a006
引用本文
Sanjeev Arora, Elad Hazan, Satyen Kale (2026).
. AthenXiv.
https://athenxiv.com/paper/ATH-ZW5STC