Improved second-order bounds for prediction with expert advice
Author:
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Software
Link
http://link.springer.com/content/pdf/10.1007/s10994-006-5001-7.pdf
Reference14 articles.
1. Allenberg-Neeman, C., & Neeman B. (2004). Full information game with gains and losses. Algorithmic Learning Theory, 15th International Conference, ALT 2004, Padova, Italy, October 2004, In Proceedings, volume 3244 of Lecture Notes in Artificial Intelligence, pp. 264-278, Springer.
2. Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R.E. (2002). The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32, 48–77.
3. Auer, P., Cesa-Bianchi, N., & Gentile, C. (2002). Adaptive and self-confident on-line learning algorithms. Journal of Computer and System Sciences, 64, 48–75.
4. Cesa-Bianchi, N., Freund, Y., Helmbold, D.P., Haussler, D., Schapire, R., & Warmuth, M.K. (1997). How to use expert advice. Journal of the ACM, 3, 427–485.
5. Cesa-Bianchi, N., & Lugosi, G. (2003). Potential-based algorithms in on-line prediction and game theory. Machine Learning, 51, 239–261.
Cited by 44 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Learning in games: a systematic review;Science China Information Sciences;2024-06-28
2. Universal Online Convex Optimization With Minimax Optimal Second-Order Dynamic Regret;IEEE Transactions on Automatic Control;2024-06
3. The Online Saddle Point Problem and Online Convex Optimization with Knapsacks;Mathematics of Operations Research;2024-01-12
4. Stochastic online convex optimization. Application to probabilistic time series forecasting;Electronic Journal of Statistics;2024-01-01
5. Relaxing the i.i.d. assumption: Adaptively minimax optimal regret via root-entropic regularization;The Annals of Statistics;2023-08-01
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3