非平稳环境下分布式随机优化的时间复杂度分析
Time Complexity Analysis of a Distributed Stochastic Optimization in a Non-Stationary Environment
摘要:
在本文中,我们考虑一个分布式随机优化问题的目标是最小化的时间平均成本函数的时间平均值的相关随机过程的时间平均值的一组约束称为罚款。我们假设系统的状态是以独立和非平稳的方式演化的,并且每个节点上可用的“公共信息”是分布式和延迟的。这种随机优化是无线网络中许多重要问题的组成部分,例如调度、路由、资源分配和人群感知。我们提出了一个近似的分布式漂移加惩罚(DPP)算法,并表明,它实现了时间平均成本(和罚款)是在最佳成本(和约束)的概率很高,在0> 0。此外,我们提供了一个条件的收敛时间t,这个结果保持。特别地,对于公共信息中的任何延迟D >= 0,我们使用耦合参数来证明所提出的算法几乎必然收敛到最优解。我们使用无线传感器网络的应用程序,通过仿真结果来证实我们的理论研究结果。
英文摘要:
In this paper, we consider a distributed stochastic optimization problem where the goal is to minimize the time average of a cost function subject to a set of constraints on the time averages of related stochastic processes called penalties. We assume that the state of the system is evolving in an independent and non-stationary fashion and the "common information" available at each node is distributed and delayed. Such stochastic optimization is an integral part of many important problems in wireless networks such as scheduling, routing, resource allocation and crowd sensing. We propose an approximate distributed Drift- Plus-Penalty (DPP) algorithm, and show that it achieves a time average cost (and penalties) that is within epsilon > 0 of the optimal cost (and constraints) with high probability. Also, we provide a condition on the convergence time t for this result to hold. In particular, for any delay D >= 0 in the common information, we use a coupling argument to prove that the proposed algorithm converges almost surely to the optimal solution. We use an application from wireless sensor network to corroborate our theoretical findings through simulation results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。