The performance of the batch learner algorithm

Computer Science – Learning

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Supercedes a part of cs.LG/0107033

Scientific paper

We analyze completely the convergence speed of the \emph{batch learning algorithm}, and compare its speed to that of the memoryless learning algorithm and of learning with memory. We show that the batch learning algorithm is never worse than the memoryless learning algorithm (at least asymptotically). Its performance \emph{vis-a-vis} learning with full memory is less clearcut, and depends on certain probabilistic assumptions.

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

The performance of the batch learner algorithm 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 The performance of the batch learner algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The performance of the batch learner algorithm will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-91066

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