Masking fields: a massively parallel neural architecture for learning, recognizing, and predicting multiple groupings of patterned data

Abstract

A massively parallel neural network architecture, called a masking field, is characterized through systematic computer simulations. A masking field is a multiple-scale self-similar automatically gain-controlled cooperative- competitive feedback network F(2). Network F(2) receives input patterns from an adaptive filter F(1) ? F(2) that is activated by a prior processing level F(1). Such a network F(2) behaves like a content-addressable memory. It activates compressed recognition codes that are predictive with respect to the activation patterns flickering across the feature detectors of F(1) and competitively inhibits, or masks, codes which are unpredictive with respect to the F(1) patterns. In particular, a masking field can simultaneously detect multiple groupings within its input patterns and assign activation weights to the codes for these groupings which are predictive with respect to the contextual information embedded within the patterns and the prior learning of the system. A masking field automatically rescales its sensitivity as the overall size of an input pattern changes, yet also remains sensitive to the microstructure within each input pattern. In this way, a masking field can more strongly activate a code for the whole F(1) pattern than for its salient parts, yet amplifies the code for a pattern part when it becomes a pattern whole in a new input context. A masking field can also be primed by inputs from F(1): it can activate codes which represent predictions of how the F(1) pattern may evolve in the subsequent time interval. Network F(2) can also exhibit an adaptive sharpening property: repetition of a familiar F(1) pattern can tune the adaptive filter to elicit a more focal spatial activation of its F(2) recognition code than does an unfamiliar input pattern. The F(2) recognition code also becomes less distributed when an input pattern contains more contextual information on which to base an unambiguous prediction of which the F(1) pattern is being processed. Thus a masking field suggests a solution of the credit assignment problem by embodying a real-time code for the predictive evidence contained within its input patterns. Such capabilities are useful in speech recognition, visual object recognition, and cognitive information processing. An absolutely stable design for a masking field is disclosed through an analysis of the computer simulations. This design suggests how associative mechanisms, cooperative-competitive interactions, and modulatory gating signals can be joined together to regulate the learning of compressed recognition codes. Data about the neural substrates of learning and memory are compared to these mechanisms.