Online optimization of smoothed piecewise constant functions

Conference item

We study online optimization of smoothed piecewise constant functions over the domain [0, 1). This is motivated by the problem of adaptively picking parameters of learning algorithms as in the recently introduced framework by Gupta and Roughgarden (2016). Majority of the machine learning literature has focused on Lipschitz-continuous functions or functions with bounded gradients.1 This is with good reason—any learning algorithm suffers linear regret even against piecewise constant functions that are chosen adversarially, arguably the simplest of non-Lipschitz continuous functions. The smoothed setting we consider is inspired by the seminal work of Spielman and Teng (2004) and the recent work of Gupta and Roughgarden (2016)—in this setting, the sequence of functions may be chosen by an adversary, however, with some uncertainty in the location of discontinuities. We give algorithms that achieve sublinear regret in the full information and bandit settings.

Authors: Cohen-Addad, V; Kanade, V

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Proceedings of Machine Learning Research
• Host title: Proceedings of the 20th International Conference on Artificial Intelligence and Statistics
• Volume: 54
• Pages: 412-420
• Series: Proceedings of Machine Learning Research
• Publication date: 2017-01-01
• Acceptance date: 2017-01-24
• ISSN: 1938-7228