On-line learning in a discrete state space
| dc.creator | Kinzel, W. | |
| dc.creator | Urbanczik, R. | |
| dc.date | 1997-05-26 | |
| dc.date.accessioned | 2026-07-07T03:09:04Z | |
| dc.date.available | 2026-07-07T03:09:04Z | |
| dc.description | On-line learning of a rule given by an N-dimensional Ising perceptron, is considered for the case when the student is constrained to take values in a discrete state space of size $L^N$. For L=2 no on-line algorithm can achieve a finite overlap with the teacher in the thermodynamic limit. However, if $L$ is on the order of $\sqrt{N}$, Hebbian learning does achieve a finite overlap. | |
| dc.description | 7 pages, 1 Figure, Latex, submitted to J.Phys.A | |
| dc.identifier | https://arxiv.org/abs/cond-mat/9705257 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/9705257 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/27742 | |
| dc.subject | Condensed Matter | |
| dc.title | On-line learning in a discrete state space | |
| dc.type | text |