PubMed Health⌕ Search

Biomedical subjects

S Risau-Gusman

Publications and source records attributed to S Risau-Gusman.

4 recordsLinked to original sources

A model for the emergence of adaptive subsystems.

We investigate the interaction of learning and evolution in a changing environment. A stable learning capability is regarded as an emergent adaptive system evolved by natural selection of genetic variants. We consider the evolution of an asexual population. Each genotype can have 'fixed' and 'flexible' alleles. The former express themselves as synaptic connections that remain unchanged during ontogeny and the latter as synapses that can be adjusted through a learning algorithm. Evolution is modelled using genetic algorithms and the changing environment is represented by two optimal synaptic patterns that alternate a fixed number of times during the 'life' of the individuals. The amplitude of the change is related to the Hamming distance between the two optimal patterns and the rate of change to the frequency with which both exchange roles. This model is an extension of that of Hinton and Nowlan in which the fitness is given by a probabilistic measure of the Hamming distance to the optimum. We find that two types of evolutionary pathways are possible depending upon how difficult (costly) it is to cope with the changes of the environment. In one case the population loses the learning ability, and the individuals inherit fixed synapses that are optimal in only one of the environmental states. In the other case a flexible subsystem emerges that allows the individuals to adapt to the changes of the environment. The model helps us to understand how an adaptive subsystem can emerge as the result of the tradeoff between the exploitation of a congenital structure and the exploration of the adaptive capabilities practised by learning.

Adaptation, Biological↗

Statistical mechanics of learning with soft margin classifiers.

We study the typical learning properties of the recently introduced soft margin classifiers (SMCs), learning realizable and unrealizable tasks, with the tools of statistical mechanics. We derive analytically the behavior of the learning curves in the regime of very large training sets. We obtain exponential and power laws for the decay of the generalization error towards the asymptotic value, depending on the task and on general characteristics of the distribution of stabilities of the patterns to be learned. The optimal learning curves of the SMCs, which give the minimal generalization error, are obtained by tuning the coefficient controlling the trade-off between the error and the regularization terms in the cost function. If the task is realizable by the SMC, the optimal performance is better than that of a hard margin support vector machine and is very close to that of a Bayesian classifier.

Algorithms↗

A model for the interaction of learning and evolution.

We present a simple model in order to discuss the interaction of the genetic and behavioral systems throughout evolution. This considers a set of adaptive perceptrons in which some of their synapses can be updated through a learning process. This framework provides an extension of the well-known Hinton and Nowlan model by blending together some learning capability and other (rigid) genetic effects that contribute to the fitness. We find a halting effect in the evolutionary dynamics, in which the transcription of environmental data into genetic information is hindered by learning, instead of stimulated as is usually understood by the so-called Baldwin effect. The present results are discussed and compared with those reported in the literature. An interpretation is provided of the halting effect.

Algorithms↗

Generalization properties of finite-size polynomial support vector machines

The learning properties of finite-size polynomial support vector machines are analyzed in the case of realizable classification tasks. The normalization of the high-order features acts as a squeezing factor, introducing a strong anisotropy in the patterns distribution in feature space. As a function of the training set size, the corresponding generalization error presents a crossover, more or less abrupt depending on the distribution's anisotropy and on the task to be learned, between a fast-decreasing and a slowly decreasing regime. This behavior corresponds to the stepwise decrease found by Dietrich et al. [Phys. Rev. Lett. 82, 2975 (1999)] in the thermodynamic limit. The theoretical results are in excellent agreement with the numerical simulations.

Journal Article↗