[其他] ICML-Risk Bounds and Rademacher Complexity in Batch Reinforcement Learning [推广有奖]

1关注
167
粉丝

已卖：5681份资源

泰斗

还不是VIP/贵宾

威望: 0 级
论坛币: 13312 个
通用积分: 746.7483
学术水平: 459 点
热心指数: 484 点
信用等级: 414 点
经验: 116309 点
帖子: 4687
精华: 0
在线时间: 16731 小时
注册时间: 2013-1-2
最后登录: 2026-1-30

楼主

Mujahida

发表于 2025-7-27 15:26:13 |AI写论文

是否 +2 论坛币

k人参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

Risk Bounds and Rademacher Complexity in Batch Reinforcement Learning

                  Yaqi Duan 1 Chi Jin 2 Zhiyuan Li 3

         Abstract                algorithms including support vector machines (Cortes &
                              Vapnik, 1995; Suykens & Vandewalle, 1999), boosting (Fre-
This paper considers batch Reinforcement Learn-
                              und et al., 1996; Schapire, 1999), as well as many success-
ing (RL) with general value function app ...