High-Level Connectionist Models

Abstract

Our goals this year involved learning in connectionist networks while automatically decomposing behaviors in order to support those behaviors with modular architectures. While there has been some work in this area, we desired to have the modules fully evolve in response to the demands of the task. To accomplish this, we needed a training mechanism more robust than back propagation, so we turned towards genetic algorithms (GAs). These algorithms, based on principles adopted from natural selection, allow solutions to be evolved which fit the requirements of an environment. There is an extensive body of work applying GAs to evolving neural networks, but most simply use GAs to set the weights for a fixed-structure network.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1993
Accession Number
ADA273638

Entities

People

  • Jordan B. Pollack

Organizations

  • Ohio State University

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Intelligence
  • Cognitive Science
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Evolutionary Algorithms
  • Genetic Algorithms
  • Information Processing
  • Information Science
  • Information Systems
  • Language
  • Lisp Programming Language
  • Neural Networks
  • Recurrent Neural Networks
  • Two Dimensional

Fields of Study

  • Computer science

Readers

  • Computational Modeling and Simulation
  • Neural Network Machine Learning.
  • Software Engineering.

Technology Areas

  • AI & ML
  • AI & ML - Autonomous Systems
  • AI & ML - Neural Networks
  • Biotechnology