A Thompson Sampling Algorithm With Logarithmic Regret for Unimodal Gaussian Bandit
Author:
Affiliation:
1. College of Computer Science and Technology, Zhejiang University, Hangzhou, China
2. Alibaba Group, Hangzhou, China
Funder
STI 2030 Major Projects
Natural Science Foundation of China
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Subject
Artificial Intelligence,Computer Networks and Communications,Computer Science Applications,Software
Link
http://xplorestaging.ieee.org/ielx7/5962385/10237282/10198752.pdf?arnumber=10198752
Reference32 articles.
1. Multi-armed bandits in metric spaces
2. Nearly tight bounds for the continuum-armed bandit problem;kleinberg;Proc NeurIPS,2004
3. Stochastic Estimation of the Maximum of a Regression Function
4. Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems
5. A Unified Approach for Multi-step Temporal-Difference Learning with Eligibility Traces in Reinforcement Learning
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3