F2F: A Library For Fast Kernel Expansions
arXiv: Learning, Volume abs/1702.08159, 2017.
F2F is a C++ library for large-scale machine learning. It contains a CPU optimized implementation of the Fastfood algorithm, that allows the computation of approximated kernel expansions in loglinear time. The algorithm requires to compute the product of Walsh-Hadamard Transform (WHT) matrices. A cache friendly SIMD Fast Walsh-Hadamard Tr...More
Full Text (Upload PDF)