title: How do PDP models learn quasiregularity?
abstract: Parallel distributed processing (PDP) models have had a profound impact on the study of cognition. One domain in which they have been particularly influential is learning quasiregularity, in which mastery requires both learning regularities that capture the majority of the structure in the input plus learning exceptions that violate the regularities. How PDP models learn quasiregularity is still not well understood. Small- and large-scale analyses of a feedforward, 3-layer network were carried out to address 2 fundamental issues about network functioning: how the model can learn both regularities and exceptions without sacrificing generalizability and the nature of the hidden representation that makes this learning possible. Results show that capacity-limited learning pressures the network to form componential representations, which ensures good generalizability. Small and highly local perturbations of this representational system allow exceptions to be learned while minimally disrupting generalizability. Theoretical and methodological implications of the findings are discussed.
authors.affiliation: Department of Psychology, Ohio State University.
authors.forename: Woojae
authors.initials: W
authors.lastname: Kim
authors.forename: Mark A
authors.initials: MA
authors.lastname: Pitt
authors.forename: Jay I
authors.initials: JI
authors.lastname: Myung
mesh_terms: D007858:Learning / Q000502:physiology*; D016571:Neural Networks, Computer
references.citation: Psychol Rev. 1999 Jul;106(3):491-528
references.pmid: 10467896
references.citation: Psychol Rev. 1989 Oct;96(4):523-68
references.pmid: 2798649
references.citation: Nat Rev Neurosci. 2003 Apr;4(4):310-22
references.pmid: 12671647
references.citation: Psychol Rev. 2004 Jul;111(3):662-720
references.pmid: 15250780
references.citation: Psychol Rev. 1996 Jan;103(1):56-115
references.pmid: 8650300