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
Proceedings ArticleDOI
Clustering large amounts of healthcare datasets using fuzzy c-means algorithm
TL;DR: This paper proposes the way of solving the difficulty in retrieving data sets that belongs to multiple clusters i.e. clustering of health care big data using fuzzy c means algorithm.
Journal ArticleDOI
MR-search: massively parallel heuristic search
TL;DR: With breadth‐ first frontier search, the MR‐Search framework computed large and powerful table‐driven heuristics, so‐called pattern databases that exceed the main memory capacity, which were used to solve random instances of the 24‐puzzle with breadth‐first iterative deepening A* on systems with up to 4093 processor cores.
Proceedings Article
Multicore Gibbs Sampling in Dense, Unstructured Graphs
Tianbing Xu,Alexander T. Ihler +1 more
TL;DR: A parallel Gibbs sampling algorithm for shared-memory systems that does not require any independence structure among the variables yet does not approximate the sampling distributions, and is nearly as fast as approximate samplers while maintaining the correct stationary distribution.
Posted Content
Do optimization methods in deep learning applications matter
TL;DR: Comparing first and higher-order optimization functions, experiments reveal that Levemberg-Marquardt (LM) significantly supersedes optimal convergence but suffers from very large processing time increasing the training complexity of both, classification and reinforcement learning problems.
ESCUELA SUPERIOR POLITECNICA DEL LITORAL Facultad de Ingeniería en Electrónica y Computación
TL;DR: In this paper, the authors present a Computer System that allows the Modernization and optimization of the Control and handling of the Fixed Assets, improving the current operations of the Municipal Government's public servants notably through a better assignment, administration and control of the fixed assets.
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.