登录 注册 会员服务 联系我们

Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits

  • Published:2024-01 Issue:1 Volume:70 Page:372-388
  • ISSN:0018-9448
  • Container-title:IEEE Transactions on Information Theory
  • language:
  • Short-container-title:IEEE Trans. Inform. Theory

Author:

Li Yingkai1ORCID,Wang Yining2ORCID,Zhou Yuan3ORCID

Affiliation:

1. Cowles Foundation for Research in Economics, Yale University, New Haven, CT, USA

2. Naveen Jindal School of Management, The University of Texas at Dallas (UTD), Richardson, TX, USA

3. Yau Mathematical Sciences Center and the Department of Mathematical Sciences, Tsinghua University, Beijing, China

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Library and Information Sciences,Computer Science Applications,Information Systems

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits;IEEE Transactions on Information Theory;2024-01

2. Rate-Matching the Regret Lower-Bound in the Linear Quadratic Regulator with Unknown Dynamics;2023 62nd IEEE Conference on Decision and Control (CDC);2023-12-13
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3