Beating Bandits in Gradually Evolving WorldsDownload PDFOpen Website

2013 (modified: 27 Jan 2026)COLT 2013Readers: Everyone
Abstract: Consider the online convex optimization problem, in which a player has to choose actions iteratively and suffers corresponding losses according to some convex loss functions, and the goal is to min...
0 Replies

Loading