Online optimization of smoothed piecewise constant functions
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...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Published: |
Proceedings of Machine Learning Research
2017
|