Two share links about bandit algorithm

博客分享了多臂老虎机算法相关内容,介绍了文章发布链接,还提出什么是多臂老虎机算法,指出一个臂代表一个选项。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >



此文同时在 http://kunth.github.io/2014/04/23/bandit-algorithm.html


Two share links about bandit algorithm

what's (multi-arm) bandit algorithm ?

epsilon-greedy algorithm 

With probability 1 – epsilon, the epsilon-Greedy algorithm exploits the best known option. 
• With probability epsilon / 2, the epsilon-Greedy algorithm explores the best known option. 
• With probability epsilon / 2, the epsilon-Greedy algorithm explores the worst known option. 

one arm denotes one option

when pulled, any given arm will output a reward. 
you need to cope with risk by figuring out which arm has the highest average reward. 
what makes a bandit problem special is that we only receive a small amount of the information about the rewards from each arm. 
we only find out about the reward that was given out by the arm we actually pulled. 
whichever arm we pull, we miss out on information about hte other arms that we didn't pull. 
every time we experiment with an arm that isn't the best arm, we lose reawrd because we could, at least in principle, have pulled on a better arm. 

Here are two links about multi-bandit algorithm that may help you 
Bndit algorithm for website optimization
Algorithms for the multi-armed bandit problem


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值