.png){kind=icon}
返回
Predictive online convex optimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2019.108771.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Convex optimization
Learning algorithms
Machine learning
Power systems
Renewable energy systems
Load dispatching
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
.png){kind=icon}
分享收藏Demand Side Management: Demand Response, Intelligent Energy Systems, and Smart Loads需求侧管理: 需求响应、智能能源系统和智能负载
OAAI
OAAI分享收藏
查看更多内容