pith. sign in

arxiv: 1805.00569 · v1 · pith:GEQFIFKFnew · submitted 2018-05-01 · 💻 cs.DC

Accurate, Fast and Scalable Kernel Ridge Regression on Parallel and Distributed Systems

classification 💻 cs.DC
keywords achievessamescalingspeeduptimesweakaccuracybkrr
0
0 comments X
read the original abstract

We propose two new methods to address the weak scaling problems of KRR: the Balanced KRR (BKRR) and K-means KRR (KKRR). These methods consider alternative ways to partition the input dataset into p different parts, generating p different models, and then selecting the best model among them. Compared to a conventional implementation, KKRR2 (optimized version of KKRR) improves the weak scaling efficiency from 0.32% to 38% and achieves a 591times speedup for getting the same accuracy by using the same data and the same hardware (1536 processors). BKRR2 (optimized version of BKRR) achieves a higher accuracy than the current fastest method using less training time for a variety of datasets. For the applications requiring only approximate solutions, BKRR2 improves the weak scaling efficiency to 92% and achieves 3505 times speedup (theoretical speedup: 4096 times).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.