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

McKernel:对数线性时间近似核展开函数库

McKernel: A Library for Approximate Kernel Expansions in Log-linear Time

Eidgenössische Technische Hochschule Zürich(苏黎世联邦理工学院);Carnegie Mellon(卡内基梅隆大学);The Chinese University of Hong Kong(香港中文大学);City University of Hong Kong(香港城市大学);Amazon(亚马逊);Google(谷歌);Facebook(脸书)

J. D. Curtó, I. C. Zarza, Feng Yang, Alex Smola, Fernando de la Torre, Chong Wah Ngo, Luc van Gool

摘要:

McKernel引入了一个框架,在小批量设置中使用内核近似,并使用随机梯度下降(SGD)作为深度学习的替代方案。基于Random Kitchen Sinks [Rahimi and Recht 2007],我们为大规模机器学习提供了一个C++库。它包含[Le et al. 2013]中算法的CPU优化实现,允许在对数线性时间内计算近似的内核扩展。该算法需要计算Walsh Hadamard矩阵的乘积。一个高速缓存友好的快速沃尔什哈达玛,实现引人注目的速度和优于目前国家的最先进的方法已经开发出来。McKernel建立了一种新的学习架构的基础,该架构允许获得结合闪电内核扩展和线性分类器的大规模非线性分类。它在小批量环境中的工作类似于神经网络。我们通过对MNIST和FASHION MNIST的广泛实验证明了我们方法的有效性[Xiao et al. 2017]。

英文摘要:

McKernel introduces a framework to use kernel approximates in the mini-batch setting with Stochastic Gradient Descent (SGD) as an alternative to Deep Learning. Based on Random Kitchen Sinks [Rahimi and Recht 2007], we provide a C++ library for Large-scale Machine Learning. It contains a CPU optimized implementation of the algorithm in [Le et al. 2013], that allows the computation of approximated kernel expansions in log-linear time. The algorithm requires to compute the product of matrices Walsh Hadamard. A cache friendly Fast Walsh Hadamard that achieves compelling speed and outperforms current state-of-the-art methods has been developed. McKernel establishes the foundation of a new architecture of learning that allows to obtain large-scale non-linear classification combining lightning kernel expansions and a linear classifier. It travails in the mini-batch setting working analogously to Neural Networks. We show the validity of our method through extensive experiments on MNIST and FASHION MNIST [Xiao et al. 2017].

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

↑