Representational trajectories in connectionist learning

Minds and Machines 4 (3):317-32 (1994)
Abstract   The paper considers the problems involved in getting neural networks to learn about highly structured task domains. A central problem concerns the tendency of networks to learn only a set of shallow (non-generalizable) representations for the task, i.e., to miss the deep organizing features of the domain. Various solutions are examined, including task specific network configuration and incremental learning. The latter strategy is the more attractive, since it holds out the promise of a task-independent solution to the problem. Once we see exactly how the solution works, however, it becomes clear that it is limited to a special class of cases in which (1) statistically driven undersampling is (luckily) equivalent to task decomposition, and (2) the dangers of unlearning are somehow being minimized. The technique is suggestive nonetheless, for a variety of developmental factors may yield the functional equivalent of both statistical AND informed undersampling in early learning
Keywords Connectionism  Epistemology  Learning  Metaphysics  Representation
Categories
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 5,709
External links
  •   Try with proxy.
  • Through your library Configure

    Similar books and articles

    Analytics

    Monthly downloads

    Added to index

    2009-01-28

    Total downloads

    5 ( #160,518 of 549,715 )

    Recent downloads (6 months)

    0

    How can I increase my downloads?


    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.

    Other forums