Open AccessProceedings Article
Map-Reduce for Machine Learning on Multicore
Cheng-Tao Chu,Sang K. Kim,Yi-an Lin,Yuanyuan Yu,Gary Bradski,Kunle Olukotun,Andrew Y. Ng +6 more
- Vol. 19, pp 281-288
TLDR
This work shows that algorithms that fit the Statistical Query model can be written in a certain "summation form," which allows them to be easily parallelized on multicore computers and shows basically linear speedup with an increasing number of processors.Abstract:
We are at the beginning of the multicore era. Computers will have increasingly many cores (processors), but there is still no good programming framework for these architectures, and thus no simple and unified way for machine learning to take advantage of the potential speed up. In this paper, we develop a broadly applicable parallel programming method, one that is easily applied to many different learning algorithms. Our work is in distinct contrast to the tradition in machine learning of designing (often ingenious) ways to speed up a single algorithm at a time. Specifically, we show that algorithms that fit the Statistical Query model [15] can be written in a certain "summation form," which allows them to be easily parallelized on multicore computers. We adapt Google's map-reduce [7] paradigm to demonstrate this parallel speed up technique on a variety of learning algorithms including locally weighted linear regression (LWLR), k-means, logistic regression (LR), naive Bayes (NB), SVM, ICA, PCA, gaussian discriminant analysis (GDA), EM, and backpropagation (NN). Our experimental results show basically linear speedup with an increasing number of processors.read more
Citations
More filters
Fatman vs. littleboy: scaling up linear algebraic operations in scale-out data platforms
TL;DR: This work enables hardware acceleration for matrix multiplications in a distributed Spark setup without user intervention and achieves more than 2× performance speed-up, and up to 96.1% computation improvement, compared to a state of the art Spark MLlib for dense matrices.
Proceedings ArticleDOI
Comparison of data processing tools in hadoop
TL;DR: To process this kind of gargantuan amounts data the authors have different kind of tools in Hadoop, namely — MapReduce, Pig and Hive.
Book ChapterDOI
Budget-Driven Big Data Classification
TL;DR: Compared with the most popular big data classification tool, LibLinear, the presented approach is shown to be competent at processing extreme large data, while consuming a fractional of memory and time.
Proceedings ArticleDOI
Fast algorithms for time series mining
Lei Li,Christos Faloutsos +1 more
TL;DR: This paper presents fast algorithms on mining coevolving time series, with or with out missing values, and proposes a parallel learning algorithm for LDS to fully utilize the power of multicore/multiprocessors.
Book ChapterDOI
Sparsity-aware distributed learning
TL;DR: In this article, the problem of sparsity-aware distributed learning is studied, where the setup of an ad hoc network, the nodes of which are tasked to estimate, in a collaborative way, a sparse parameter vector of interest, is considered.
References
More filters
Journal ArticleDOI
Learning representations by back-propagating errors
TL;DR: Back-propagation repeatedly adjusts the weights of the connections in the network so as to minimize a measure of the difference between the actual output vector of the net and the desired output vector, which helps to represent important features of the task domain.
Journal ArticleDOI
MapReduce: simplified data processing on large clusters
Jeffrey Dean,Sanjay Ghemawat +1 more
TL;DR: This paper presents the implementation of MapReduce, a programming model and an associated implementation for processing and generating large data sets that runs on a large cluster of commodity machines and is highly scalable.
Journal ArticleDOI
An information-maximization approach to blind separation and blind deconvolution
TL;DR: It is suggested that information maximization provides a unifying framework for problems in "blind" signal processing and dependencies of information transfer on time delays are derived.
Journal ArticleDOI
Principal component analysis
TL;DR: Principal Component Analysis is a multivariate exploratory analysis method useful to separate systematic variation from noise and to define a space of reduced dimensions that preserve noise.