.png){kind=icon}
返回
Distributed Derivative-Free Learning Method for Stochastic Optimization Over a Network With Sparse Activity
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2021.3077516.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article addresses a distributed optimization problem in a communication network where nodes are active sporadically. Each active node applies some learning method to control its action to maximize the global utility function, which is defined as the sum of the local utility functions of active nodes. We deal with stochastic optimization problem with the setting that utility functions are disturbed by some nonadditive stochastic process. We consider a more challenging situation where the learning method has to be performed only based on a scalar approximation of the utility function, rather than its closed-form expression, so that the typical gradient descent method cannot be applied. This setting is quite realistic when the network is affected by some stochastic and time-varying process, and that each node cannot have the full knowledge of the network states. We propose a distributed optimization algorithm and prove its almost surely convergence to the optimum. Convergence rate is also derived with an additional assumption that the objective function is strongly concave. Numerical results are also presented to justify our claim.
Keyword:
Optimization
Convergence
Stochastic processes
Perturbation methods
Linear programming
Convex functions
Tools
Convergence analysis
derivative-free learning
distributed algorithm
sparse network
stochastic optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Modification of Ninth-Order Weighted Essentially Nonoscillatory Scheme for Mixed Subsonic/Supersonic Flow.png)
AIAA Journal
AIAA JournalIF0
PREAI
分享收藏
查看更多内容