12,853 research outputs found
Closure in artificial cell signalling networks - investigating the emergence of cognition in collectively autocatalytic reaction networks
Cell Signalling Networks (CSNs) are complex biochemical networks responsible for the coordination of cellular
activities in response to internal and external stimuli. We hypothesize that CSNs are subsets of collectively autocatalytic reaction networks. The signal processing or cognitive abilities of CSNs would originate from the closure properties of these systems. We investigate how Artificial CSNs, regarded as minimal cognitive systems, could emerge and evolve under this condition where closure may interact with evolution. To assist this research, we employ a multi-level concurrent Artificial Chemistry based on the Molecular Classifier Systems and the Holland broadcast language. A critical issue for the evolvability of such undirected and autonomous evolutionary systems is to identify the conditions that would ensure evolutionary stability. In this
paper we present some key features of our system which permitted stable cooperation to occur between the different molecular species through evolution. Following this, we present an experiment in which we evolved a simple closed reaction network to accomplish a pre-specified task. In this experiment we show that the signal-processing ability (signal amplification) directly resulted from the evolved systems closure properties
Exploring evolutionary stability in a concurrent artificial chemistry
Multi-level selection has proven to be an affective mean to
provide resistance against parasites for catalytic networks
(Cronhjort and Blomberg, 1997). One way to implement these multi-level systems is to group molecules into several
distinct compartments (cells) which are capable of cellular
division (where an offspring cell replaces another cell). In
such systems parasitized cells decay and are ultimately displaced by neighboring healthy cells. However in relatively small cellular populations, it is also possible that infected cells may rapidly spread parasites throughout the entire cellular population. In which case, group selection may fail to provide resistance to parasites. In this paper, we propose a concurrent artificial chemistry (AC) which has been implemented on a cluster of computers where each cell is running on a single CPU. This multi-level selectional artificial chemistry called the Molecular Classifier Systems was based on the Holland broadcast language. An attribute inherent to such a concurrent
system is that the computational complexity of the
molecular species contained in a reactor may now affect the
fitness of the cell. This molecular computational cost may
be regarded as the chemical activation energy necessary for
a reaction to occur. Such a property is often not considered
in typical Artificial Life models. Our experimental results
obtained with this system suggest that this activation energy property may improve the resistance to parasites for catalytic networks. This work highlights some of the benefits that could be obtained using a concurrent architecture on top of computational efficiency. We first briefly present the Molecular Classifier Systems, this is then followed by a description of the multi-level concurrent model. Finally we discuss the benefits of using this multi-level concurrent model to enhance evolutionary stability for catalytic networks in our AC
Increasing pattern recognition accuracy for chemical sensing by evolutionary based drift compensation
Artificial olfaction systems, which mimic human olfaction by using arrays of gas chemical sensors combined with pattern recognition methods, represent a potentially low-cost tool in many areas of industry such as perfumery, food and drink production, clinical diagnosis, health and safety, environmental monitoring and process control. However, successful applications of these systems are still largely limited to specialized laboratories. Sensor drift, i.e., the lack of a sensor's stability over time, still limits real in dustrial setups. This paper presents and discusses an evolutionary based adaptive drift-correction method designed to work with state-of-the-art classification systems. The proposed approach exploits a cutting-edge evolutionary strategy to iteratively tweak the coefficients of a linear transformation which can transparently correct raw sensors' measures thus mitigating the negative effects of the drift. The method learns the optimal correction strategy without the use of models or other hypotheses on the behavior of the physical chemical sensors
Ensemble Learning for Free with Evolutionary Algorithms ?
Evolutionary Learning proceeds by evolving a population of classifiers, from
which it generally returns (with some notable exceptions) the single
best-of-run classifier as final result. In the meanwhile, Ensemble Learning,
one of the most efficient approaches in supervised Machine Learning for the
last decade, proceeds by building a population of diverse classifiers. Ensemble
Learning with Evolutionary Computation thus receives increasing attention. The
Evolutionary Ensemble Learning (EEL) approach presented in this paper features
two contributions. First, a new fitness function, inspired by co-evolution and
enforcing the classifier diversity, is presented. Further, a new selection
criterion based on the classification margin is proposed. This criterion is
used to extract the classifier ensemble from the final population only
(Off-line) or incrementally along evolution (On-line). Experiments on a set of
benchmark problems show that Off-line outperforms single-hypothesis
evolutionary learning and state-of-art Boosting and generates smaller
classifier ensembles
Local Rule-Based Explanations of Black Box Decision Systems
The recent years have witnessed the rise of accurate but obscure decision
systems which hide the logic of their internal decision processes to the users.
The lack of explanations for the decisions of black box systems is a key
ethical issue, and a limitation to the adoption of machine learning components
in socially sensitive and safety-critical contexts. %Therefore, we need
explanations that reveals the reasons why a predictor takes a certain decision.
In this paper we focus on the problem of black box outcome explanation, i.e.,
explaining the reasons of the decision taken on a specific instance. We propose
LORE, an agnostic method able to provide interpretable and faithful
explanations. LORE first leans a local interpretable predictor on a synthetic
neighborhood generated by a genetic algorithm. Then it derives from the logic
of the local interpretable predictor a meaningful explanation consisting of: a
decision rule, which explains the reasons of the decision; and a set of
counterfactual rules, suggesting the changes in the instance's features that
lead to a different outcome. Wide experiments show that LORE outperforms
existing methods and baselines both in the quality of explanations and in the
accuracy in mimicking the black box
A comparison between the Pittsburgh and Michigan approaches for the binary PSO algorithm
IEEE Congress on Evolutionary Computation. Edimburgo, 5 september 2005This paper shows the performance of the binary PSO algorithm as a classification system. These systems are classified in two different perspectives: the Pittsburgh and the Michigan approaches. In order to implement the Michigan approach binary PSO algorithm, the standard PSO dynamic equations are modified, introducing a repulsive force to favor particle competition. A dynamic neighborhood, adapted to classification problems, is also defined. Both classifiers are tested using a reference set of problems, where both classifiers achieve better performance than many classification techniques. The Michigan PSO classifier shows clear advantages over the Pittsburgh one both in terms of success rate and speed. The Michigan PSO can also be generalized to the continuous version of the PSO
- …