MapReduce / Bigtable for Distributed Optimization

  • Hall K
  • Gilpin S
  • Mann G
N/ACitations
Citations of this article
102Readers
Mendeley users who have this article in their library.

Abstract

For large data it can be very time consuming to run gradient based optimizat ion,for example to minimize the log-likelihood for maximum entropy models.Distributed methods are therefore appealing and a number of distributed gradientoptimization strategies have been proposed including: distributed gradient, asynchronousupdates, and iterative parameter mixtures. In this paper, we evaluatethese various strategies with regards to their accuracy and speed over MapReduce/Bigtable and discuss the techniques needed for high performance.

Cite

CITATION STYLE

APA

Hall, K. B., Gilpin, S., & Mann, G. (2010). MapReduce / Bigtable for Distributed Optimization. NIPS 2010 Workshop on Learning on Cores, Clusters and Clouds, 1(1), 1–7.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free