.png){kind=icon}
Return
Predictive online convex optimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2019.108771.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We incorporate future information in the form of the estimated value of future gradients in online convex optimization. This is motivated by demand response in power systems, where forecasts about the current round, e.g., the weather or the loads' behavior, can be used to improve on predictions made with only past observations. Specifically, we introduce an additional predictive step that follows the standard online convex optimization step when certain conditions on the estimated gradient and descent direction are met. We show that under these conditions and without any assumptions on the predictability of the environment, the predictive update strictly improves on the performance of the standard update. We give two types of predictive update for various family of loss functions. We provide a regret bound for each of our predictive online convex optimization algorithms. Finally, we apply our framework to an example based on demand response which demonstrates its superior performance to a standard online convex optimization algorithm. (C) 2019 Elsevier Ltd. All rights reserved.
Keywords:
Convex optimization
Learning algorithms
Machine learning
Power systems
Renewable energy systems
Load dispatching
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSave View more