Expert-Calibrated Learning for Online Optimization with Switching Costs
Expert-Calibrated Learning for Online Optimization with Switching Costs
复制标题
具有转换成本的在线优化专家校准学习
DOI:
10.1145/3530894
复制
发表时间:
2022
期刊:
影响因子:
--
通讯作者:
Ren, Shaolei
中科院分区:
文献类型:
--
作者:
Li, Pengfei;Yang, Jianyi;Ren, Shaolei
We study online convex optimization with switching costs, a practically important but also extremely challenging problem due to the lack of complete offline information. By tapping into the power of machine learning (ML) based optimizers, ML-augmented online algorithms (also referred to as expert calibration in this paper) have been emerging as state of the art, with provable worst-case performance guarantees. Nonetheless, by using the standard practice of training an ML model as a standalone optimizer and plugging it into an ML-augmented algorithm, the average cost performance can be highly unsatisfactory. In order to address the "how to learn" challenge, we propose EC-L2O (expert-calibrated learning to optimize), which trains an ML-based optimizer by explicitly taking into account the downstream expert calibrator. To accomplish this, we propose a new differentiable expert calibrator that generalizes regularized online balanced descent and offers a provably better competitive ratio than pure ML predictions when the prediction error is large. For training, our loss function is a weighted sum of two different losses --- one minimizing the average ML prediction error for better robustness, and the other one minimizing the post-calibration average cost. We also provide theoretical analysis for EC-L2O, highlighting that expert calibration can be even beneficial for the average cost performance and that the high-percentile tail ratio of the cost achieved by EC-L2O to that of the offline optimal oracle (i.e., tail cost ratio) can be bounded. Finally, we test EC-L2O by running simulations for sustainable datacenter demand response. Our results demonstrate that EC-L2O can empirically achieve a lower average cost as well as a lower competitive ratio than the existing baseline algorithms.
登录
查看更多内容
DOI:
--
发表时间:
2020-02
期刊:
arXiv: Learning
影响因子:
--
作者:
Guanya Shi;Yiheng Lin;Soon-Jo Chung;Yisong Yue;A. Wierman
通讯作者:
Guanya Shi;Yiheng Lin;Soon-Jo Chung;Yisong Yue;A. Wierman
DOI:
--
发表时间:
2021-03
期刊:
J. Mach. Learn. Res.
影响因子:
--
作者:
Tianlong Chen;Xiaohan Chen;Wuyang Chen;Howard Heaton;Jialin Liu;Zhangyang Wang;W. Yin
通讯作者:
Tianlong Chen;Xiaohan Chen;Wuyang Chen;Howard Heaton;Jialin Liu;Zhangyang Wang;W. Yin
DOI:
--
发表时间:
2021
期刊:
Neural Information Processing Systems
影响因子:
--
作者:
Kai Wang;Sanket Shah;Haipeng Chen;A. Perrault;F. Doshi;M. Tambe
通讯作者:
M. Tambe
影响因子:
0.8
作者:
J. Friedman;N. Linial
通讯作者:
N. Linial
DOI:
10.1145/3374888.3374892
发表时间:
2019
期刊:
ACM SIGMETRICS Performance Evaluation Review
影响因子:
--
作者:
Gautam Goel;A. Wierman
通讯作者:
A. Wierman