Mathematics of learning

Details Mathematics of learning Mathematics of learning

2001-05-29

arxiv.org/abs/math/0105235v3

Mathematics

Probability

Minor revisions

Scientific paper

We study the convergence properties of a pair of learning algorithms (learning with and without memory). This leads us to study the dominant eigenvalue of a class of random matrices. This turns out to be related to the roots of the derivative of random polynomials (generated by picking their roots uniformly at random in the interval [0, 1], although our results extend to other distributions). This, in turn, requires the study of the statistical behavior of the harmonic mean of random variables as above, which leads us to delicate question of the rate of convergence to stable laws and tail estimates for stable laws. The reader can find the proofs of most of the results announced here in the paper entitled "Harmonic mean, random polynomials, and random matrices", by the same authors.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-196714