arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1706.02857cs.LGcs.FLstat.ML
收藏

谱学习中基选择的最大匹配算法

A Maximum Matching Algorithm for Basis Selection in Spectral Learning

Xerox Research Centre Europe(欧洲施乐研究院)

Ariadna Quattoni, Xavier Carreras, Matthias Gallé

摘要:

我们提出了一个解决方案,学习序列函数的尺度谱算法。我们感兴趣的是这些函数是稀疏的情况(也就是说,对于大多数序列,它们返回0)。谱算法将学习问题简化为在称为汉克尔矩阵的特殊类型的矩阵上计算SVD分解的任务。该矩阵旨在捕获训练序列的相关统计数据。重要的是,为了捕获长程依赖,我们必须考虑非常大的汉克尔矩阵。因此,奇异值分解的计算成为一个关键的瓶颈。我们的解决方案找到了一个子集的行和列的汉克尔,实现了一个紧凑的和翔实的汉克尔子矩阵。新颖之处在于这个子集的选择方式:我们利用最大二分匹配组合算法寻找一个子块与完整的结构秩,并显示如何计算这个子块可以进一步提高利用特定的结构汉克尔矩阵。

英文摘要:

We present a solution to scale spectral algorithms for learning sequence functions. We are interested in the case where these functions are sparse (that is, for most sequences they return 0). Spectral algorithms reduce the learning problem to the task of computing an SVD decomposition over a special type of matrix called the Hankel matrix. This matrix is designed to capture the relevant statistics of the training sequences. What is crucial is that to capture long range dependencies we must consider very large Hankel matrices. Thus the computation of the SVD becomes a critical bottleneck. Our solution finds a subset of rows and columns of the Hankel that realizes a compact and informative Hankel submatrix. The novelty lies in the way that this subset is selected: we exploit a maximal bipartite matching combinatorial algorithm to look for a sub-block with full structural rank, and show how computation of this sub-block can be further improved by exploiting the specific structure of Hankel matrices.

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

↑