Task Decomposition Through Competition in a Modular Connectionist

  • Authors:
  • Robert A. Jacobs;Michael I. Jordan;Andrew G. Barto

  • Affiliations:
  • -;-;-

  • Venue:
  • Task Decomposition Through Competition in a Modular Connectionist
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

A NOVEL MODULAR CONNECTIONIST ARCHITECTURE IS PRESENTED IN WHICH THE NETWORKS COMPOSING THE ARCHITECTURE COMPETE TO LEARN THE TRAINING PATTERNS. AN OUTCOME OF THE COMPETITION IS THAT DIFFERENT NETWORKS LEARN DIFFERENT TRAINING PATTERNS AND, THUS, LEARN TO COMPUTE DIFFERENT FUNCTIONS. THE ARCHITECTURE PERFORMS TASK DECOMPOSITION IN THE SENSE THAT IT LEARNS TO PARTITION A TASK INTO TWO OR MORE FUNCTIONALLY INDEPENDENT TASKS AND ALLO- CATES DISTINCT NETWORKS TO LEARN EACH TASK. IN ADDITION, THE ARCHITECTURE TENDS TO ALLOCATE TO EACH TASK THE NETWORK WHOSE TOPOLOGY IS MORE APPROPRI- ATE TO THAT TASK. THE ARCHITECTURE''S PERFORMANCE ON "WHAT" AND "WHERE" VISION TASKS IS PRESENTED AND COMPARED WITH THE PERFORMANCE OF TWO MULTI- LAYER NETWORKS. FINALLY, IT IS NOTED THAT FUNCTION DECOMPOSITION IS AN UNDERCONSTRAINED PROBLEM AND, THUS, DIFFERENT MODULAR ARCHITECTURES MAY DECOMPOSE A FUNCTION IN DIFFERENT WAYS. WE ARGUE THAT A DESIRABLE DECOM- POSITION CAN BE ACHIEVED IF THE ARCHITECTURE IS SUITABLY RESTRICTED IN THE TYPES OF FUNCTIONS THAT IT CAN COMPUTE. APPROPRIATE RESTRICTIONS CAN BE FOUND THROUGH THE APPLICATION OF DOMAIN KNOWLEDGE. A STRENGTH OF THE MOD- ULAR ARCHITECTURE IS THAT ITS STRUCTURE IS WELL-SUITED FOR INCORPORATING DOMAIN KNOWLEDGE.