arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2003.09505eess.SYcs.SY
收藏

需求响应中用户学习和选择的可靠性感知多臂Bandit方法

A Reliability-aware Multi-armed Bandit Approach to Learn and Select Users in Demand Response

Yingying Li, Qinran Hu, Na Li

摘要:

社会系统的优化和控制中的一个挑战是处理未知和不确定的用户行为。本文重点研究住宅需求响应(DR),并提出了一个闭环学习计划来解决这些问题。特别是,我们认为DR计划,其中聚合器呼吁住宅用户改变他们的需求,使总负荷调整接近目标值。为了学习和选择正确的用户,我们制定DR问题作为一个组合多臂强盗(CMAB)问题的可靠性目标。我们提出了一个学习算法:CUCB-Avg(组合上置信界平均值),它利用上置信界和样本平均值来平衡探索(学习)和利用(选择)之间的权衡。我们考虑了固定的时不变目标和时变目标,并表明CUCB-Avg实现$O(\log T)$和$O(\sqrt{T \log(T)})$遗憾分别。最后,我们数值测试我们的算法使用合成和真实的数据,并证明我们的CUCB-Avg执行显着优于经典CUCB,也优于汤普森采样。

英文摘要:

One challenge in the optimization and control of societal systems is to handle the unknown and uncertain user behavior. This paper focuses on residential demand response (DR) and proposes a closed-loop learning scheme to address these issues. In particular, we consider DR programs where an aggregator calls upon residential users to change their demand so that the total load adjustment is close to a target value. To learn and select the right users, we formulate the DR problem as a combinatorial multi-armed bandit (CMAB) problem with a reliability objective. We propose a learning algorithm: CUCB-Avg (Combinatorial Upper Confidence Bound-Average), which utilizes both upper confidence bounds and sample averages to balance the tradeoff between exploration (learning) and exploitation (selecting). We consider both a fixed time-invariant target and time-varying targets, and show that CUCB-Avg achieves $O(\log T)$ and $O(\sqrt{T \log(T)})$ regrets respectively. Finally, we numerically test our algorithms using synthetic and real data, and demonstrate that our CUCB-Avg performs significantly better than the classic CUCB and also better than Thompson Sampling.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑