基于零阶反馈的分布式需求响应优化
Zeroth-Order Feedback-Based Optimization for Distributed Demand Response
AI总结:
本文针对分布式需求响应中模型未知、非凸和隐私等挑战,提出两种基于零阶反馈的分布式算法,分别适用于一般凸紧致可行集和盒约束问题,并给出复杂度界与实验验证。
摘要:
分布式需求响应是一类典型的分布式优化问题,需要多个智能体之间协调以满足需求响应要求。然而,针对该问题的现有分布式算法仍面临系统模型未知、非凸性、隐私问题等挑战。为应对这些挑战,我们提出并分析了两种分布式算法,其中智能体不共享自身信息,而是利用零阶反馈信息进行局部更新,以估计全局目标函数的梯度。一种算法适用于具有一般凸且紧致可行集的问题,但其预言机复杂度较高,上界为 $O(d/ε^2)$;另一种算法实现了更低的复杂度界 $O(d/ε)$,但仅适用于具有盒约束的问题。我们进行了实证实验以验证它们的性能。
英文摘要:
Distributed demand response is a typical distributed optimization problem that requires coordination among multiple agents to satisfy demand response requirements. However, existing distributed algorithms for this problem still face challenges such as unknown system models, nonconvexity, privacy issues, etc. To address these challenges, we propose and analyze two distributed algorithms, in which the agents do not share their information and instead perform local updates using zeroth-order feedback information to estimate the gradient of the global objective function. One algorithm applies to problems with general convex and compact feasible sets but has higher oracle complexity bounded by $O(d/ε^2)$, while the other algorithm achieves lower complexity bound $O(d/ε)$ but is only applicable to problems with box constraints. We conduct empirical experiments to validate their performance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。