A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs
A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs
复制标题
一种近乎最优的两全其美的反馈图在线学习算法
DOI:
10.48550/arxiv.2206.00557
复制
发表时间:
2022
期刊:
影响因子:
--
通讯作者:
Yevgeny Seldin
中科院分区:
文献类型:
--
作者:
Chloé Rouyer;Dirk van der Hoeven;Nicolò Cesa;Yevgeny Seldin
We consider online learning with feedback graphs, a sequential decision-making framework where the learner's feedback is determined by a directed graph over the action set. We present a computationally efficient algorithm for learning in this framework that simultaneously achieves near-optimal regret bounds in both stochastic and adversarial environments. The bound against oblivious adversaries is $\tilde{O} (\sqrt{\alpha T})$, where $T$ is the time horizon and $\alpha$ is the independence number of the feedback graph. The bound against stochastic environments is $O\big( (\ln T)^2 \max_{S\in \mathcal I(G)} \sum_{i \in S} \Delta_i^{-1}\big)$ where $\mathcal I(G)$ is the family of all independent sets in a suitably defined undirected version of the graph and $\Delta_i$ are the suboptimality gaps. The algorithm combines ideas from the EXP3++ algorithm for stochastic and adversarial bandits and the EXP3.G algorithm for feedback graphs with a novel exploration scheme. The scheme, which exploits the structure of the graph to reduce exploration, is key to obtain best-of-both-worlds guarantees with feedback graphs. We also extend our algorithm and results to a setting where the feedback graphs are allowed to change over time.
DOI:
--
发表时间:
2021
期刊:
Advances in neural information processing systems
影响因子:
--
作者:
Negrea, Jeffrey;Bilodeau, Blair;Campolongo, Nicolò;Orabona, Francesco;Roy, Dan
通讯作者:
Roy, Dan