Better Mini-Batch Algorithms via Accelerated Gradient Methods

Computer Science – Learning

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Mini-batch algorithms have been proposed as a way to speed-up stochastic convex optimization problems. We study how such algorithms can be improved using accelerated gradient methods. We provide a novel analysis, which shows how standard gradient methods may sometimes be insufficient to obtain a significant speed-up and propose a novel accelerated gradient algorithm, which deals with this deficiency, enjoys a uniformly superior guarantee and works well in practice.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Better Mini-Batch Algorithms via Accelerated Gradient Methods does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Better Mini-Batch Algorithms via Accelerated Gradient Methods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Better Mini-Batch Algorithms via Accelerated Gradient Methods will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-469010

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.