arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.05474math.OC
收藏

应用于马尔可夫时变网络一致性问题的加速随机梯度方法

Accelerated Stochastic Gradient Method with Applications to Consensus Problem in Markov-Varying Networks

Vladimir Solodkin, Savelii Chezhegov, Ruslan Nazikov, Aleksandr Beznosikov, Alexander Gasnikov

AI总结:

本文提出一种融合Nesterov加速的适用于马尔可夫噪声场景的一阶优化算法,完成收敛性分析,并将其应用于马尔可夫时变网络一致性问题,实验验证其性能优于经典方法。

摘要:

随机优化是数学优化领域的一个重要方向,在运筹学、机器学习等诸多领域都有应用。本文提出了一种适用于存在马尔可夫噪声场景的新型一阶优化算法,该算法融合了Nesterov加速技术以提升效率。我们基于噪声依赖于到解的距离这一假设进行了收敛性分析。我们还深入研究了马尔可夫时变网络上的一致性问题,探索了如何应用该算法在通信系统变化的过程中,让具有不同目标的多个智能体达成一致。为验证所提方法在上述问题上的性能,我们开展了实验,结果表明该方法优于经典方法。

英文摘要:

Stochastic optimization is a vital field in the realm of mathematical optimization, finding applications in diverse areas ranging from operations research to machine learning. In this paper, we introduce a novel first-order optimization algorithm designed for scenarios where Markovian noise is present, incorporating Nesterov acceleration for enhanced efficiency. The convergence analysis is performed using an assumption on noise depending on the distance to the solution. We also delve into the consensus problem over Markov-varying networks, exploring how this algorithm can be applied to achieve agreement among multiple agents with differing objectives during changes in the communication system. To show the performance of our method on the problem above, we conduct experiments to demonstrate the superiority over the classic approach.

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

↑