The performance of the batch learner algorithm

Simple item page
dc.creatorRivin, Igor
dc.date2002-01-14
dc.date.accessioned2026-07-07T03:18:03Z
dc.date.available2026-07-07T03:18:03Z
dc.descriptionWe 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.
dc.descriptionSupercedes a part of cs.LG/0107033
dc.identifierhttps://arxiv.org/abs/cs/0201009
dc.identifierhttp://arxiv.org/abs/cs/0201009
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30961
dc.subjectMachine Learning
dc.subjectDiscrete Mathematics
dc.subjectI2.6
dc.titleThe performance of the batch learner algorithm
dc.typetext

Files

Collections

arXiv