# Discrete dynamical genetic programming in XCS

@article{Preen2009DiscreteDG, title={Discrete dynamical genetic programming in XCS}, author={Richard John Preen and Larry Bull}, journal={Proceedings of the 11th Annual conference on Genetic and evolutionary computation}, year={2009} }

A number of representation schemes have been presented for use within Learning Classifier Systems, ranging from binary encodings to neural networks. This paper presents results from an investigation into using a discrete dynamical system representation within the XCS Learning Classifier System. In particular, asynchronous random Boolean networks are used to represent the traditional condition-action production system rules. It is shown possible to use self-adaptive, open-ended evolution to… Expand

#### Figures and Topics from this paper

#### 18 Citations

Dynamical Genetic Programming in XCSF

- Computer Science, Medicine
- Evolutionary Computation
- 2013

Results are presented from an investigation into using a temporally dynamic symbolic representation within the XCSF learning classifier system, finding competitive performance with traditional genetic programming on a number of composite polynomial tasks. Expand

Fuzzy dynamical genetic programming in XCSF

- Computer Science
- GECCO
- 2011

Results are presented from an investigation into using a fuzzy DGP representation within the XCSF Learning Classifier System, where asynchronous Fuzzy Logic Networks are used to represent the traditional condition-action production system rules. Expand

Discrete and fuzzy dynamical genetic programming in the XCSF learning classifier system

- Mathematics, Computer Science
- Soft Comput.
- 2014

Results are presented from an investigation into using discrete and fuzzy dynamical system representations within the XCSF learning classifier system, where asynchronous random Boolean networks are used to represent the traditional condition-action production system rules in the discrete case and asynchronous fuzzy logic networks in the continuous-valued case. Expand

Arithmetic dynamical genetic programming in the XCSF Learning Classifier System

- Mathematics, Computer Science
- 2011 IEEE Congress of Evolutionary Computation (CEC)
- 2011

The results presented herein show that the collective emergent behaviour of the evolved systems exhibits competitive performance with those previously reported on a non-linear continuous-valued reinforcement learning problem. Expand

Evolution of control with learning classifier systems

- Computer Science, Medicine
- Appl. Netw. Sci.
- 2018

The proposed approach builds on learning and discovery and therefore the series of interventions for controlling the network are determined but are not fixed, so system control rules evolve in such a way that they mirror both the structure and dynamics of the system, without having ‘direct’ access to either. Expand

Imitation Programming

- Computer Science
- ICES
- 2010

Initial results suggest the imitation computation approach presented is competitive with evolutionary computation, i.e., another class of stochastic population-based search, to design circuits from such recurrent NAND gate networks. Expand

A spiking neural representation for XCSF

- Computer Science
- IEEE Congress on Evolutionary Computation
- 2010

A Learning Classifier System where each traditional rule is represented by a spiking neural network, a type of network with dynamic internal state, allowing for the evolution of networks of appropriate complexity to emerge whilst solving a continuous maze environment. Expand

A Spiking Neural Repesentation for XCSF

- 2009

This paper presents a Learning Classifier System (LCS) where each classifier condition is represented by a spiking neural network. Adaptive behavior is realized through the use of self-adaptive… Expand

Imitation Programming Unorganised Machines

- Computer Science
- Artificial Intelligence, Evolutionary Computing and Metaheuristics
- 2013

This chapter presents results from an investigation into using Turing’s dynamical network representation designed by a new imitation-based, i.e., cultural, approach. Expand

Evolving Boolean Networks on Tunable Fitness Landscapes

- Computer Science
- IEEE Transactions on Evolutionary Computation
- 2012

An abstract, tunable model by which to explore aspects of artificial genetic regulatory networks and their design by simulated evolution by combining the random Boolean network formalism with the NK and NKCS models of fitness landscapes. Expand

#### References

SHOWING 1-10 OF 63 REFERENCES

XCS with stack-based genetic programming

- Computer Science
- The 2003 Congress on Evolutionary Computation, 2003. CEC '03.
- 2003

We present an extension of the learning classifier system XCS in which classifier conditions are represented by RPN expressions and stack-based genetic programming is used to recombine and mutate… Expand

A Demonstration of Neural Programming Applied to Non-Markovian Problems

- Computer Science
- GECCO
- 2004

This paper shows a successful application of neural programming to various partially observable Markov decision processes, originally developed for the learning classifier system community, and which require the use of internal state and iteration. Expand

An empirical study of the efficiency of learning boolean functions using a Cartesian Genetic Programming approach

- Mathematics
- 1999

A new form of Genetic Programming (GP) called Cartesian Genetic Programming (CGP) is proposed in which programs are represented by linear integer chromosomes in the form of connections and… Expand

Efficient Evolution of Asymmetric Recurrent Neural Networks Using a PDGP-inspired Two-Dimensional Representation

- Computer Science
- EuroGP
- 1998

A new method to build recurrent neural networks based on evolutionary computation is presented, which combines a linear chromosome with a two-dimensional representation inspired by Parallel Distributed Genetic Programming to evolve the architecture and the weights simultaneously. Expand

Neural Programming and an Internal Reinforcement Policy

- Computer Science
- 1996

A connectionist model of Neural Programming allows for a regression credit-blame procedure in an evolutionary learning system, and a general method for an informed feedback mechanism for Neural Programming, Internal Reinforcement is described. Expand

Classifier Fitness Based on Accuracy

- Mathematics, Computer Science
- Evolutionary Computation
- 1995

A classifier system, XCS, is investigated, in which each classifier maintains a prediction of expected payoff, but the classifier's fitness is given by a measure of the prediction's accuracy, making it suitable for a wide range of reinforcement learning situations where generalization over states is desirable. Expand

Parallel Problem Solving from Nature — PPSN VII

- Computer Science
- Lecture Notes in Computer Science
- 2002

With relatively little effort, scaling laws that quite accurately describe the behavior of the strategy and that greatly contribute to its understanding are derived and their implications are discussed. Expand

A neural learning classifier system with self-adaptive constructivism

- Computer Science
- The 2003 Congress on Evolutionary Computation, 2003. CEC '03.
- 2003

It is shown that appropriate internal rule complexity emerges during learning at a rate controlled by the learner and that the structure indicates underlying features of the task. Expand

Toward Optimal Classifier System Performance in Non-Markov Environments

- Computer Science, Medicine
- Evolutionary Computation
- 2000

Wilson's (1994) bit-register memory scheme was incorporated into the XCS classifier system and investigated in a series of non-Markov environments, where use of a register having more bit-positions than were strictly necessary to resolve environmental aliasing was used. Expand

Self-adaptive constructivism in Neural XCS and XCSF

- Computer Science
- GECCO '08
- 2008

This paper presents the use of constructivism-inspired mechanisms within a neural learning classifier system which exploits parameter self-adaptation as an approach to realize such behaviour. Expand