.png){kind=icon}
返回
Linear convergence of decentralized estimation for statistical estimation using gradient method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2024.127584.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
There has been a growing interest in solving consensus optimization problems in a multi-agent system. It is known that there is an exactness-speed dilemma for decentralized optimization for the naive gradient method, where either we have fast linear convergence to a neighborhood of size O(eta) using a fixed constant step size eta, or slow convergence to the exact optimizer with a decreasing step size. We reinvestigate a special case of this problem from a statistical point of view, where each agent's local function is a sample estimate of a common population function. It is shown that when considering the convergence to the population target instead of to the exact consensual solution, the convergence is linear up to the statistical accuracy of the problem, using a step size only depending on the network characteristics instead of the sample size N. The objective function is not required to be strongly convex (but their statistical limit is), which allows for example the absolute deviation function which is used in median regression. Such results are in stark contrast to the optimization literature, where strong convexity of the objective function is necessary for linear convergence.
Keyword:
Consensus optimization
Distributed estimation
Linear convergence
Median regression
Statistical error
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
分享收藏A Unified Framework for High-Dimensional Analysis of M-Estimators with Decomposable Regularizers.png)
STATISTICAL SCIENCE
OAAI
STATISTICAL SCIENCEIF3.4
OAAI分享收藏Deep Convolutional Neural Networks Exploit High-Spatial- and -Temporal-Resolution Aerial Imagery to Phenotype Key Traits in Miscanthus深度卷积神经网络利用高空间和时域分辨率航空影像对芒草关键性状进行表型分析
OAAI
OAAI分享收藏
查看更多内容