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 Õ (√ 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. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Maillard, O. A., & Munos, R. (2010). Online learning in adversarial lipschitz environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6322 LNAI, pp. 305–320). https://doi.org/10.1007/978-3-642-15883-4_20
Mendeley helps you to discover research relevant for your work.