分布式异步学习矢量量化算法的收敛性
Convergence of distributed asynchronous learning vector quantization algorithms
摘要:
基于在大规模数据集上有效执行聚类算法的问题,我们提出了一种大规模分布式聚类方法的模型。为此,我们简要回顾了一些标准的量化问题和竞争学习矢量量化(CLVQ)过程的几乎必然收敛的一些结果。线性分布式异步算法的一般模型,以及适合于几种并行计算体系结构进行了讨论。我们的方法汇集了这个可扩展的模型和CLVQ算法,我们称之为分布式异步学习矢量量化算法(DALVQ)的技术。深入分析了DALVQ算法的几乎必然收敛性。一个引人注目的结果是,我们证明了多个版本的量化器分布在并行架构的处理器之间的渐近达成共识几乎肯定。此外,我们还表明,这些版本几乎肯定会收敛到相同的几乎最优值的量化标准。
英文摘要:
Motivated by the problem of effectively executing clustering algorithms on very large data sets, we address a model for large scale distributed clustering methods. To this end, we briefly recall some standards on the quantization problem and some results on the almost sure convergence of the Competitive Learning Vector Quantization (CLVQ) procedure. A general model for linear distributed asynchronous algorithms well adapted to several parallel computing architectures is also discussed. Our approach brings together this scalable model and the CLVQ algorithm, and we call the resulting technique the Distributed Asynchronous Learning Vector Quantization algorithm (DALVQ). An in-depth analysis of the almost sure convergence of the DALVQ algorithm is performed. A striking result is that we prove that the multiple versions of the quantizers distributed among the processors in the parallel architecture asymptotically reach a consensus almost surely. Furthermore, we also show that these versions converge almost surely towards the same nearly optimal value for the quantization criterion.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。