Abstract: During the initial phase of cognitive development,
infants exhibit amazing abilities to generate novel behaviors in
unfamiliar situations, and explore actively to learn the best while
lacking extrinsic rewards from the environment. These abilities
set them apart from even the most advanced autonomous robots.
This work seeks to contribute to understand and replicate some of
these abilities. We propose the Bottom-up hiErarchical sequential
Learning algorithm with Constructivist pAradigm (BEL-CA) to
design agents capable of learning autonomously and continuously
through interactions. The algorithm implements no assumption about
the semantics of input and output data. It does not rely upon a
model of the world given a priori in the form of a set of states
and transitions as well. Besides, we propose a toolkit to analyze the
learning process at run time called GAIT (Generating and Analyzing
Interaction Traces). We use GAIT to report and explain the detailed
learning process and the structured behaviors that the agent has
learned on each decision making. We report an experiment in which
the agent learned to successfully interact with its environment and to
avoid unfavorable interactions using regularities discovered through
interaction.
Abstract: Evolutionary Programming (EP) represents a
methodology of Evolutionary Algorithms (EA) in which mutation is
considered as a main reproduction operator. This paper presents a
novel EP approach for Artificial Neural Networks (ANN) learning.
The proposed strategy consists of two components: the self-adaptive,
which contains phenotype information and the dynamic, which is
described by genotype. Self-adaptation is achieved by the addition of
a value, called the network weight, which depends on a total number
of hidden layers and an average number of neurons in hidden layers.
The dynamic component changes its value depending on the fitness
of a chromosome, exposed to mutation. Thus, the mutation step size
is controlled by two components, encapsulated in the algorithm,
which adjust it according to the characteristics of a predefined ANN
architecture and the fitness of a particular chromosome. The
comparative analysis of the proposed approach and the classical EP
(Gaussian mutation) showed, that that the significant acceleration of
the evolution process is achieved by using both phenotype and
genotype information in the mutation strategy.