非平稳环境下分布随机优化问题的一个可能近似正确解
A Probably Approximately Correct Answer to Distributed Stochastic Optimization in a Non-stationary Environment
摘要:
本文考虑了一个分布式随机优化问题,其目标是最小化一个成本函数的时间平均值,该成本函数受一组约束条件的时间平均值的相关随机过程称为罚款。我们假设系统中一个事件的延迟信息是每个用户的公共信息,并且系统的状态以独立和非平稳的方式演化。我们表明,我们提出的近似漂移加惩罚(DPP)算法实现了时间平均成本,是在一些积极的常数范围内的最佳成本与高概率。此外,我们提供了一个条件的等待时间,这个结果举行。该条件被示出为混合系数、用于计算状态分布的估计的样本数(w)和延迟的函数。与现有的工作不同,本文中使用的方法可以适用于证明高概率的结果时,状态是在一个非独立同分布和非平稳的方式演变。在温和的条件下,我们证明了误差界对w的依赖性是指数的,这是一个显着的改进相比,现有的工作。
英文摘要:
This paper considers 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 a related stochastic processes called penalties. We assume that a delayed information about an event in the system is available as a common information at every user, and the state of the system is evolving in an independent and non-stationary fashion. We show that an approximate Drift-plus-penalty (DPP) algorithm that we propose achieves a time average cost that is within some positive constant epsilon of the optimal cost with high probability. Further, we provide a condition on the waiting time for this result to hold. The condition is shown to be a function of the mixing coefficient, the number of samples (w) used to compute an estimate of the distribution of the state, and the delay. Unlike the existing work, the method used in the paper can be adapted to prove high probability results when the state is evolving in a non-i.i.d and non-stationary fashion. Under mild conditions, we show that the dependency of the error bound on w is exponential, which is a significant improvement compared to the exiting work.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。