A Note on Continuous-Time Online Learning
DOI:
https://doi.org/10.4208/jml.240605Keywords:
Online learning, Online optimization, Adversarial bandits, Adversarial linear bandits.Abstract
In online learning, the data is provided in sequential order, and the goal of the learner is to make online decisions to minimize overall regrets. This note is concerned with continuous-time models and algorithms for several online learning problems: online linear optimization, adversarial bandit, and adversarial linear bandit. For each problem, we extend the discrete-time algorithm to the continuous-time setting and provide a concise proof of the optimal regret bound.