随机优化
数学优化
凸函数
随机逼近
随机梯度下降算法
背景(考古学)
趋同(经济学)
计算机科学
最优化问题
解算器
数学
正多边形
算法
人工神经网络
人工智能
计算机安全
生物
经济
古生物学
钥匙(锁)
几何学
经济增长
作者
Jie Hou,Xianlin Zeng,Gang Wang,Jian Sun,Jie Chen
标识
DOI:10.48550/arxiv.2208.04053
摘要
This paper considers distributed stochastic optimization, in which a number of agents cooperate to optimize a global objective function through local computations and information exchanges with neighbors over a network. Stochastic optimization problems are usually tackled by variants of projected stochastic gradient descent. However, projecting a point onto a feasible set is often expensive. The Frank-Wolfe (FW) method has well-documented merits in handling convex constraints, but existing stochastic FW algorithms are basically developed for centralized settings. In this context, the present work puts forth a distributed stochastic Frank-Wolfe solver, by judiciously combining Nesterov's momentum and gradient tracking techniques for stochastic convex and nonconvex optimization over networks. It is shown that the convergence rate of the proposed algorithm is $\mathcal{O}(k^{-\frac{1}{2}})$ for convex optimization, and $\mathcal{O}(1/\mathrm{log}_2(k))$ for nonconvex optimization. The efficacy of the algorithm is demonstrated by numerical simulations against a number of competing alternatives.
科研通智能强力驱动
Strongly Powered by AbleSci AI