Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe - Archive ouverte HAL Access content directly
Conference Papers Year :

Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe

Abstract

We consider the problem of bandit optimization, inspired by stochastic optimization and online learning problems with bandit feedback. In this problem, the objective is to minimize a global loss function of all the actions, not necessarily a cumulative loss. This framework allows us to study a very general class of problems, with applications in statistics, machine learning, and other fields. To solve this problem, we analyze the Upper-Confidence Frank-Wolfe algorithm, inspired by techniques for bandits and convex optimization. We give theoretical guarantees for the performance of this algorithm over various classes of functions, and discuss the optimality of these results.

Dates and versions

hal-03089509 , version 1 (28-12-2020)

Identifiers

Cite

Quentin Berthet, Vianney Perchet. Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe. Advances in Neural Information Processing Systems, Dec 2017, Long Beach, United States. ⟨hal-03089509⟩

Collections

INSMI TDS-MACS
44 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More