arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1511.04428cs.DCcs.GTcs.SYeess.SYmath.OC
收藏

关于基于扩散策略的分布式帕累托优化的渐近偏差

On the Asymptotic Bias of the Diffusion-Based Distributed Pareto Optimization

Commonwealth Scientific and Industrial Research Organisation (CSIRO)(联邦科学与工业研究组织);School of Engineering, University of South Australia(南澳大利亚大学工程学院);Aalto University(阿尔托大学);University of Notre Dame(圣母大学)

Reza Arablouei, Kutluyıl Doğançay, Stefan Werner, Yih-Fang Huang

AI总结:

本文研究了基于扩散策略的分布式帕累托优化算法的渐近偏差分析,提出了一种在小步长下分析渐近偏差的方法,并展示了当步长参数足够小时,渐近偏差与最大步长参数线性相关。

摘要:

我们重新审视了基于扩散策略开发的分布式帕累托优化算法的渐近偏差分析。我们提出了一种在小步长下分析该算法渐近偏差的替代方法,并证明当该参数足够小时,渐近偏差与最大步长参数呈线性关系。此外,通过所提出的分析方法,我们提供了在组合矩阵和步长共同假设不严格成立时的小步长渐近偏差表达式。这种情况在实践中很常见,但原论文中并未考虑。我们的方法为深入了解扩散帕累托优化算法的内部机制提供了新的见解,同时比原工作中提出的微步长渐近偏差分析要简洁得多。这是因为我们利用了算法中使用的复合组合矩阵的特殊特征,而无需调用任何特征空间分解或矩阵求逆。

英文摘要:

We revisit the asymptotic bias analysis of the distributed Pareto optimization algorithm developed based on the diffusion strategies. We propose an alternative way to analyze the asymptotic bias of this algorithm at small step-sizes and show that the asymptotic bias descends to zero with a linear dependence on the largest step-size parameter when this parameter is sufficiently small. In addition, through the proposed analytic approach, we provide an expression for the small-step-size asymptotic bias when a condition assumed jointly on the combination matrices and the step-sizes does not strictly hold. This is a likely scenario in practice, which has not been considered in the original paper that introduced the algorithm. Our methodology provides new insights into the inner workings of the diffusion Pareto optimization algorithm while being considerably less involved than the small-step-size asymptotic bias analysis presented in the original work. This is because we take advantage of the special eigenstructure of the composite combination matrix used in the algorithm without calling for any eigenspace decomposition or matrix inversion.

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

↑