arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2008.09477stat.MLcs.LG
收藏

基于拓扑一致性的竞争学习

Topological Gradient-based Competitive Learning

Cambridge University(剑桥大学);University of Florence(佛罗伦萨大学);Politecnico di Torino(都灵理工大学);University of Picardie Jules Verne(皮卡第儒勒-凡尔纳大学);University of South Pacific(南太平洋大学)

Pietro Barbiero, Gabriele Ciravegna, Vincenzo Randazzo, Giansalvo Cirrincione

摘要:

拓扑学习是一个广泛的研究领域,旨在揭示一个集合的元素之间的相互空间关系。一些最常见和最古老的方法涉及使用无监督竞争神经网络。然而,这些方法不是基于梯度优化,梯度优化已被证明在特征提取中以及在无监督学习中提供惊人的结果。不幸的是,由于主要关注算法的效率和准确性,深度聚类技术由过于复杂的特征提取器组成,而在其顶层使用平凡的算法。这项工作的目的是提出一种新颖的综合理论,旨在将竞争性学习与基于梯度的学习相结合,从而允许使用非常强大的深度神经网络进行特征提取和投影,并结合竞争性学习的显着灵活性和表现力。在本文中,我们充分证明了两个新的基于梯度的竞争层的理论等价性。初步的实验表明,如何双重的方法,训练上的转置的输入矩阵,即$X^T$,导致更快的收敛速度和更高的训练精度在低和高维的情况。

英文摘要:

Topological learning is a wide research area aiming at uncovering the mutual spatial relationships between the elements of a set. Some of the most common and oldest approaches involve the use of unsupervised competitive neural networks. However, these methods are not based on gradient optimization which has been proven to provide striking results in feature extraction also in unsupervised learning. Unfortunately, by focusing mostly on algorithmic efficiency and accuracy, deep clustering techniques are composed of overly complex feature extractors, while using trivial algorithms in their top layer. The aim of this work is to present a novel comprehensive theory aspiring at bridging competitive learning with gradient-based learning, thus allowing the use of extremely powerful deep neural networks for feature extraction and projection combined with the remarkable flexibility and expressiveness of competitive learning. In this paper we fully demonstrate the theoretical equivalence of two novel gradient-based competitive layers. Preliminary experiments show how the dual approach, trained on the transpose of the input matrix i.e. $X^T$, lead to faster convergence rate and higher training accuracy both in low and high-dimensional scenarios.

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

↑