BriefGPT.xyz
May, 2023
遗憾最小化的帕累托前沿识别
Pareto Front Identification with Regret Minimization
HTML
PDF
Wonyoung Kim, Garud Iyengar, Assaf Zeevi
TL;DR
该文介绍了一种PFILin算法,可同时有效地识别帕累托前沿和减少遗憾,并证明了其样本复杂度是最优的。
Abstract
We consider
pareto front identification
for
linear bandits
(PFILin) where the goal is to identify a set of arms whose reward vectors are not dominated by any of the others when the mean reward vector is a linear
→