For linear SVM, gradient descent is a fine algorithm. If you go into this work, I would recommend that you implement an all-reduce operation since iterated map-reduce is very inefficient.
On Wed, Feb 29, 2012 at 10:30 PM, Aditya Sarawgi <[email protected]>wrote: > Hi, > > Thanks Todd for the pointer. I actually had one more paper in mind, and its > from > the original author of SVM > http://leon.bottou.org/publications/pdf/nips-2004c.pdf > > I think this makes more sense for mapreduce. I am open to other suggestions > or > algorithms. > > Thanks > Aditya Sarawgi > > On Thu, Mar 1, 2012 at 1:04 AM, Todd Johnson <[email protected]> > wrote: > > > The authors of that paper don't believe their algorithm is a good > candidate > > for mapreduce. See: > > > http://groups.google.com/group/psvm/browse_thread/thread/cedd3a6caef0f9c9# > > > > todd. > > > > > > > > On Wed, Feb 29, 2012 at 9:31 PM, Aditya Sarawgi < > [email protected] > > >wrote: > > > > > Hello, > > > > > > I am looking to implement psvm for Mahout as a part of of my > coursework. > > > The reference paper is > > > http://books.nips.cc/papers/files/nips20/NIPS2007_0435.pdf > > > and there is a implementation over http://code.google.com/p/psvm/which > > > uses MPI. > > > Any ideas, pointers are much appreciated. > > > > > > Thanks > > > Aditya Sarawgi > > > > > > > > > -- > Cheers, > Aditya Sarawgi >
