[其他] ICML-Pure Exploration and Regret Minimization in Matching Bandits [推广有奖]

1关注
168
粉丝

已卖：5760份资源

泰斗

还不是VIP/贵宾

威望: 0 级
论坛币: 13312 个
通用积分: 770.7901
学术水平: 460 点
热心指数: 485 点
信用等级: 415 点
经验: 116859 点
帖子: 4685
精华: 0
在线时间: 16742 小时
注册时间: 2013-1-2
最后登录: 2026-4-18

楼主

Mujahida

发表于 2025-7-27 17:12:44 |AI写论文

是否 +2 论坛币

k人参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

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

立即领取

感谢您参与论坛问题回答

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

+2 论坛币

Pure Exploration and Regret Minimization in Matching Bandits

   Flore Sentenac * 1 Jialin Yi * 2 Clement Calauzenes 3 Vianney Perchet 4 Milan Vojnovic 2

         Abstract                online advertising, where the probability that a user clicks
Finding an optimal matching in a weighted graph       on an ad depends on both the position at which the ad
is a standard combinatorial problem. We consider       is displayed and its relevance to the user (Katariya et al.,
it ...