BriefGPT.xyz
Jan, 2024
自适应遗憾在可能的情况下:只需两个查询
Adaptive Regret for Bandits Made Possible: Two Queries Suffice
HTML
PDF
Zhou Lu, Qiuyi Zhang, Xinyi Chen, Fred Zhang, David Woodruff...
TL;DR
在线优化中,给出了强适应遗憾的准确查询和遗憾最优的贪心算法,同时给出了多臂赌博机和赌博凸优化的最优算法,并通过实证研究表明了在不稳定环境和下游任务中的卓越表现。
Abstract
Fast changing states or
volatile environments
pose a significant challenge to
online optimization
, which needs to perform rapid adaptation under limited observation. In this paper, we give query and regret optima
→