Online Learning in Adversarial Lipschitz Environments - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Online Learning in Adversarial Lipschitz Environments

Rémi Munos
  • Function : Author
  • PersonId : 836863


We consider the problem of online learning in an adversarial environment when the reward functions chosen by the adversary are assumed to be Lipschitz. This setting extends previous works on linear and convex online learning. We provide a class of algorithms with cumulative regret upper bounded by O(sqrt{dT ln(λ)}) where d is the dimension of the search space, T the time horizon, and λ the Lipschitz constant. Efficient numerical implementations using particle methods are discussed. Applications include online supervised learning problems for both full and partial (bandit) information settings, for a large class of non-linear regressors/classifiers, such as neural networks.
Fichier principal
Vignette du fichier
ALF_ecml10.pdf (286.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00510674 , version 1 (20-08-2010)


  • HAL Id : inria-00510674 , version 1


Odalric Maillard, Rémi Munos. Online Learning in Adversarial Lipschitz Environments. European Conference on Machine Learing, 2010, Barcelone, Spain. ⟨inria-00510674⟩
169 View
815 Download


Gmail Facebook X LinkedIn More