ConCS: A Continual Classifier System for Continual Learning of Multiple Boolean Problems

Loading...
Thumbnail Image

Date

2023-08

DOI

Open Access Location

Journal Title

Journal ISSN

Volume Title

Publisher

IEEE

Rights

(c) 2023 The Author/s
CC BY 4.0

Abstract

Human intelligence can simultaneously process many tasks with the ability to accumulate and reuse knowledge. Recent advances in artificial intelligence, such as transfer, multitask, and layered learning, seek to replicate these abilities. However, humans must specify the task order, which is often difficult particularly with uncertain domain knowledge. This work introduces a continual-learning system (ConCS), such that given an open-ended set of problems once each is solved its solution can contribute to solving further problems. The hypothesis is that the evolutionary computation approach of learning classifier systems (LCSs) can form this system due to its niched, cooperative rules. A collaboration of parallel LCSs identifies sets of patterns linking features to classes that can be reused in related problems automatically. Results from distinct Boolean and integer classification problems, with varying interrelations, show that by combining knowledge from simple problems, complex problems can be solved at increasing scales. 100% accuracy is achieved for the problems tested regardless of the order of task presentation. This includes intractable problems for previous approaches, e.g., n-bit Majority-on. A major contribution is that human guidance is now unnecessary to determine the task learning order. Furthermore, the system automatically generates the curricula for learning the most difficult tasks.

Description

Keywords

Building blocks, code fragment (CF), continual learning, learning classifier systems (LCS), multitask learning (MTL)

Citation

Nguyen TB, Browne WN, Zhang M. (2023). ConCS: A Continual Classifier System for Continual Learning of Multiple Boolean Problems. IEEE Transactions on Evolutionary Computation. 27. 4. (pp. 1057-1071).

Collections

Endorsement

Review

Supplemented By

Referenced By

Creative Commons license

Except where otherwised noted, this item's license is described as (c) 2023 The Author/s