No subject

Michael Biehl biehl at connect.nbi.dk
Wed Jun 16 17:21:12 EDT 1993


FTP-host: archive.cis.ohio-state.edu
FTP-filename:  /pub/neuroprose/biehl.unsupervised.ps.Z

*** Hardcopies cannot be provided *** 

The following paper has been placed in the Neuroprose archive
(see above for ftp-host)  in file 
 biehl.unsupervised.ps.Z   (8 pages of output)

email address of author: biehl at physik.uni-wuerzburg.de 

---------------------------------------------------------------- 

  "An exactly solvable model of unsupervised learning"
       by  Michael Biehl 

Abstract:
A model for unsupervised learning from N-dimensional data is
studied. Random training examples are drawn such that the
distribution of their overlaps with a vector B is a mixture of
two Gaussians of unit width and a separation rho.  A student
vector is generated by an online algorithm, using each example
only once. The evolution of its overlap with B can be calculated
exactly in the thermodynamic limit (infinite N). As a specific
example Oja's rule is investigated.   Its dynamics and approach
to the stationary solution are solved for both a constant and an
optimally chosen time-dependent learning rate.

-----------------------------------------------------------------


More information about the Connectionists mailing list