On-Line Learning with Restricted Training Sets: An Exactly Solvable Case

Details On-Line Learning with Restricted Training Sets: An Exactly Solvable Case On-Line Learning with Restricted Training Sets: An Exactly Solvable Case

1998-11-16

arxiv.org/abs/cond-mat/9811231v1

J. Phys. A: Math. Gen., 32: 3321-3339, 1999

Physics

Condensed Matter

Disordered Systems and Neural Networks

19 pages, eps figures included, uses epsfig macro

Scientific paper

10.1088/0305-4470/32/18/308

We solve the dynamics of on-line Hebbian learning in large perceptrons exactly, for the regime where the size of the training set scales linearly with the number of inputs. We consider both noiseless and noisy teachers. Our calculation cannot be extended to non-Hebbian rules, but the solution provides a convenient and welcome benchmark with which to test more general and advanced theories for solving the dynamics of learning with restricted training sets.

Affiliated with

Also associated with

No associations

Rating

On-Line Learning with Restricted Training Sets: An Exactly Solvable Case 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 On-Line Learning with Restricted Training Sets: An Exactly Solvable Case, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On-Line Learning with Restricted Training Sets: An Exactly Solvable Case will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-615377