Skip to main content
Taylor & Francis Group Logo
Advanced Search

Click here to search books using title name,author name and keywords.

  • Login
  • Hi, User  
    • Your Account
    • Logout
Advanced Search

Click here to search books using title name,author name and keywords.

Breadcrumbs Section. Click here to navigate to respective pages.

Chapter

Dynamically constraining connectionist networks to produce distributed, orthogonal representations to reduce catastrophic interference

Chapter

Dynamically constraining connectionist networks to produce distributed, orthogonal representations to reduce catastrophic interference

DOI link for Dynamically constraining connectionist networks to produce distributed, orthogonal representations to reduce catastrophic interference

Dynamically constraining connectionist networks to produce distributed, orthogonal representations to reduce catastrophic interference book

Dynamically constraining connectionist networks to produce distributed, orthogonal representations to reduce catastrophic interference

DOI link for Dynamically constraining connectionist networks to produce distributed, orthogonal representations to reduce catastrophic interference

Dynamically constraining connectionist networks to produce distributed, orthogonal representations to reduce catastrophic interference book

ByRobert M. French
BookProceedings of the Sixteenth Annual Conference of the Cognitive Science Society

Click here to navigate to parent product.

Edition 1st Edition
First Published 1994
Imprint Routledge
Pages 6
eBook ISBN 9781315789354

ABSTRACT

It is well known that when a connectionist network is trained on one set of patterns and then attempts to add new patterns to its repertoire, catastrophic interference may result. The use of sparse, orthogonal hidden-layer representations has been shown to reduce catastrophic interference. The author demonstrates that the use of sparse representations may, in certain cases, actually result in worse performance on catastrophic interference. This paper argues for the necessity of maintaining hidden-layer representations that are both as highly distributed and as highly orthogonal as possible. The author presents a learning algorithm, called context-biasing, that dynamically solves the problem of constraining hidden-layer representations to simultaneously produce good orthogonality and distributedness. On the data tested for this study, context-biasing is shown to reduce catastrophic interference by more than 50% compared to standard backpropagation.

T&F logoTaylor & Francis Group logo
  • Policies
    • Privacy Policy
    • Terms & Conditions
    • Cookie Policy
    • Privacy Policy
    • Terms & Conditions
    • Cookie Policy
  • Journals
    • Taylor & Francis Online
    • CogentOA
    • Taylor & Francis Online
    • CogentOA
  • Corporate
    • Taylor & Francis Group
    • Taylor & Francis Group
    • Taylor & Francis Group
    • Taylor & Francis Group
  • Help & Contact
    • Students/Researchers
    • Librarians/Institutions
    • Students/Researchers
    • Librarians/Institutions
  • Connect with us

Connect with us

Registered in England & Wales No. 3099067
5 Howick Place | London | SW1P 1WG © 2021 Informa UK Limited