PubMed Health⌕ Search

Biomedical subjects

Hugues Bersini

Publications and source records attributed to Hugues Bersini.

7 recordsLinked to original sources

The road to chaos by time-asymmetric Hebbian learning in recurrent neural networks.

This letter aims at studying the impact of iterative Hebbian learning algorithms on the recurrent neural network's underlying dynamics. First, an iterative supervised learning algorithm is discussed. An essential improvement of this algorithm consists of indexing the attractor information items by means of external stimuli rather than by using only initial conditions, as Hopfield originally proposed. Modifying the stimuli mainly results in a change of the entire internal dynamics, leading to an enlargement of the set of attractors and potential memory bags. The impact of the learning on the network's dynamics is the following: the more information to be stored as limit cycle attractors of the neural network, the more chaos prevails as the background dynamical regime of the network. In fact, the background chaos spreads widely and adopts a very unstructured shape similar to white noise. Next, we introduce a new form of supervised learning that is more plausible from a biological point of view: the network has to learn to react to an external stimulus by cycling through a sequence that is no longer specified a priori. Based on its spontaneous dynamics, the network decides "on its own" the dynamical patterns to be associated with the stimuli. Compared with classical supervised learning, huge enhancements in storing capacity and computational cost have been observed. Moreover, this new form of supervised learning, by being more "respectful" of the network intrinsic dynamics, maintains much more structure in the obtained chaos. It is still possible to observe the traces of the learned attractors in the chaotic regime. This complex but still very informative regime is referred to as "frustrated chaos."

Algorithms↗

Growing biological networks: beyond the gene-duplication model.

In this paper we propose a generalized growth model for biological interaction networks, including a set of biological features which have been inspired by a long tradition of simulations of immune system and chemical reaction networks. In our models we include characteristics such as the heterogeneity of biological nodes, the existence of natural hubs, the nodes binding by mutual affinity and the significance of type-based networks as compared with instance-based networks. Under these assumptions, we analyse the importance of the nodes concentration with respect to the selection of incoming nodes. We show that networks with fat-tailed degree distribution and highly clustered structure naturally emerge in systems possessing certain properties: new instances need to be produced through an endogenous source and this source needs to provide a positive feedback favouring nodes with high concentration to receive new connections. Furthermore, we show that understanding the concentration dynamics of each node and the consequent correlation between connectivity and concentration is a more adequate way to capture the global properties of type-based biological networks.

Animals↗

Recycling Frank: Spontaneous emergence of homochirality in noncatalytic systems.

In this work, we introduce a prebiotically relevant protometabolic pattern corresponding to an engine of deracemization by using an external energy source. The spontaneous formation of a nonracemic mixture of chiral compounds can be observed in out-of-equilibrium systems via a symmetry-breaking phenomenon. This observation is possible thanks to chirally selective autocatalytic reactions (Frank's model) [Frank, F. C. (1953) Biochim. Biophys. Acta 11, 459-463]. We show that the use of a Frank-like model in a recycled system composed of reversible chemical reactions, rather than the classical irreversible system, allows for the emergence of a synergetic autoinduction from simple reactions, without any autocatalytic or even catalytic reaction. This model is described as a theoretical framework, based on the stereoselective reactivity of preexisting chiral monomeric building blocks (polymerization, epimerization, and depolymerization) maintained out of equilibrium by a continuous energy income, via an activation reaction. It permits the self-conversion of all monomeric subunits into a single chiral configuration. Real prebiotic systems of amino acid derivatives can be described on this basis. They are shown to be able to spontaneously reach a stable nonracemic state in a few centuries. In such systems, the presence of epimerization reactions is no more destructive, but in contrast is the central driving force of the unstabilization of the racemic state.

Journal Article↗

Integration and cross-validation of high-throughput gene expression data: comparing heterogeneous data sets.

Data analysis--not data production--is becoming the bottleneck in gene expression research. Data integration is necessary to cope with an ever increasing amount of data, to cross-validate noisy data sets, and to gain broad interdisciplinary views of large biological data sets. New Internet resources may help researchers to combine data sets across different gene expression platforms. However, noise and disparities in experimental protocols strongly limit data integration. A detailed review of four selected studies reveals how some of these limitations may be circumvented and illustrates what can be achieved through data integration.

Animals↗

The connections between the frustrated chaos and the intermittency chaos in small Hopfield networks.

In a previous paper we introduced the notion of frustrated chaos occurring in Hopfield networks [Neural Networks 11 (1998) 1017]. It is a dynamical regime which appears in a network when the global structure is such that local connectivity patterns responsible for stable oscillatory behaviors are intertwined, leading to mutually competing attractors and unpredictable itinerancy among brief appearance of these attractors. Frustration destabilizes the network and provokes an erratic 'wavering' among the orbits that characterize the same network when it is connected in a non-frustrated way. In this paper, through a detailed study of the bifurcation diagram given for some connection weights, we will show that this frustrated chaos belongs to the family of intermittency type of chaos, first described by Berge et al. [Order within chaos (1984)] and Pomeau and Manneville [Commun. Math. Phys. 74 (1980) 189]. Indeed, the transition to chaos is a critical one, and all along the bifurcation diagram, in any chaotic window, the duration of the intermittent cycles, between two chaotic bursts, grows as an invert ratio of the connection weight. Specific to this regime are the intermittent cycles easily identifiable as the non-frustrated regimes obtained by altering the values of these same connection weights. We will more specifically show that anywhere in the bifurcation diagram, a chaotic window always lies between two oscillatory regimes, and that the resulting chaos is a merging of, among others, the cycles at both ends. The strength (i.e. the duration of its oscillatory phase before the chaotic burst) of the first cycle decreases while the regime tends to stabilize into the second cycle (with the strength of this second cycle increasing) that will finally get the control. Since in our study, the bifurcation diagram concerns the same connection weights responsible for the learning mechanism of the Hopfield network, we will discuss the relations existing between bifurcation, learning and control of chaos. We will show that, in some cases, the addition of a slower Hebbian learning mechanism onto the Hopfield networks makes the resulting global dynamics to drive the network into a stable oscillatory regime, through a succession of intermittent and quasiperiodic regimes. Finally, we will present a series of possible logical steps to manually construct a frustrated network.

Computer Simulation↗

Detection of obstructive apnea events in sleeping infants from thoracoabdominal movements.

The aim of the study was to determine whether in infants, the evaluation of thoracoabdominal movements alone, with no measurement of airflow, could be used to identify obstructive sleep apnea events (OA). Two different methods were used: first, we initially quantified thoracoabdominal asynchrony. Although 79.3% of OAs showed a significant increase of thoracoabdominal asynchrony, only 10.9% of the events scored by the identification of phase opposition were true OAs. Next, we developed two artificial neural networks (ANNs) as classifiers for the study of the thoracoabdominal signals. The first network was trained to locate obstructive and central apnea events. It correctly detected 75% of the OAs; however, only 6.2% of the detected events were true OAs. When a second network was used, OAs could not be discriminated from other portions of the signals showing similar phase characteristics. It was concluded that the information available in uncalibrated signals of thoracic and abdominal respiratory movements was insufficient to unambiguously detect OA events in sleeping infants.

Abdomen↗

The frustrated and compositional nature of chaos in small Hopfield networks.

Frustration in a network described by a set of ordinary differential equations induces chaos when the global structure is such that local connectivity patterns responsible for stable oscillatory behaviours are intertwined, leading to mutually competing attractors and unpredictable itinerancy among brief appearance of these attractors. Frustration destabilizes the network and provokes an erratic 'wavering' among the periodic saddle orbits which characterize the same network when it is connected in a non-frustrated way. The characterization of chaos as some form of unpredictable 'wavering' among repelling oscillators is rather classical but the originality here lies in the identification of these oscillators as the stable regimes of the 'non-frustrated' network. In this paper, a simple and small 6-neuron Hopfield network is treated, observed and analyzed in its chaotic regime. Given a certain choice of the network parameters, chaos occurs when connecting the network in a specific way (said to be 'frustrated') and gives place to oscillatory regimes by suppressing whatever connection between two neurons. The compositional nature of the chaotic attractor as a succession of brief appearances of orbits (or parts of orbits) associated with the non-frustrated networks is evidenced by relying on symbolic dynamics, through the computation of Lyapunov exponents, and by computing the autocorrelation coefficients and the spectrum.

Journal Article↗