scholarly journals Persistent Memory in Single Node Delay-Coupled Reservoir Computing

PLoS ONE ◽  
2016 ◽  
Vol 11 (10) ◽  
pp. e0165170 ◽  
Author(s):  
André David Kovac ◽  
Maximilian Koall ◽  
Gordon Pipa ◽  
Hazem Toutounji
2021 ◽  
Vol 31 (11) ◽  
pp. 2150161
Author(s):  
Uladzislau Sychou

The study lies in the field of physical reservoir computing and aims to develop a classifier using Fisher Iris dataset for benchmark tasks. Single Chua chaotic oscillator acts as a physical reservoir. The study was performed using computer simulation. The features of Iris flowers are represented as the consequence of short pulses at a constant level of a control parameter, which is fed to the oscillator, changing its dynamics. During the classification of flowers, the oscillator works without being reset, so each pulse on the input changes the phase trajectory and makes it unique for each Iris flower. Finally, the estimation of the symmetry of an attractor makes it possible to connect each species of Iris with the properties of the attractor. The resulting architecture of the classifier includes a single-node externally-driven Chua oscillator with time-delayed input. The classifier shows two mistakes in classifying the dataset with 75 samples working in chaotic mode.


2015 ◽  
Vol 27 (6) ◽  
pp. 1159-1185 ◽  
Author(s):  
Hazem Toutounji ◽  
Johannes Schumacher ◽  
Gordon Pipa

Supplementing a differential equation with delays results in an infinite-dimensional dynamical system. This property provides the basis for a reservoir computing architecture, where the recurrent neural network is replaced by a single nonlinear node, delay-coupled to itself. Instead of the spatial topology of a network, subunits in the delay-coupled reservoir are multiplexed in time along one delay span of the system. The computational power of the reservoir is contingent on this temporal multiplexing. Here, we learn optimal temporal multiplexing by means of a biologically inspired homeostatic plasticity mechanism. Plasticity acts locally and changes the distances between the subunits along the delay, depending on how responsive these subunits are to the input. After analytically deriving the learning mechanism, we illustrate its role in improving the reservoir’s computational power. To this end, we investigate, first, the increase of the reservoir’s memory capacity. Second, we predict a NARMA-10 time series, showing that plasticity reduces the normalized root-mean-square error by more than 20%. Third, we discuss plasticity’s influence on the reservoir’s input-information capacity, the coupling strength between subunits, and the distribution of the readout coefficients.


2021 ◽  
Vol 46 (4) ◽  
pp. 47-52
Author(s):  
Aya N. Elbedwehy ◽  
Mohy Eldin Abo-Elsoud ◽  
Ahmed Elnakib

2019 ◽  
Vol 53 (5) ◽  
pp. 1763-1773
Author(s):  
Meziane Aider ◽  
Lamia Aoudia ◽  
Mourad Baïou ◽  
A. Ridha Mahjoub ◽  
Viet Hung Nguyen

Let G = (V, E) be an undirected graph where the edges in E have non-negative weights. A star in G is either a single node of G or a subgraph of G where all the edges share one common end-node. A star forest is a collection of vertex-disjoint stars in G. The weight of a star forest is the sum of the weights of its edges. This paper deals with the problem of finding a Maximum Weight Spanning Star Forest (MWSFP) in G. This problem is NP-hard but can be solved in polynomial time when G is a cactus [Nguyen, Discrete Math. Algorithms App. 7 (2015) 1550018]. In this paper, we present a polyhedral investigation of the MWSFP. More precisely, we study the facial structure of the star forest polytope, denoted by SFP(G), which is the convex hull of the incidence vectors of the star forests of G. First, we prove several basic properties of SFP(G) and propose an integer programming formulation for MWSFP. Then, we give a class of facet-defining inequalities, called M-tree inequalities, for SFP(G). We show that for the case when G is a tree, the M-tree and the nonnegativity inequalities give a complete characterization of SFP(G). Finally, based on the description of the dominating set polytope on cycles given by Bouchakour et al. [Eur. J. Combin. 29 (2008) 652–661], we give a complete linear description of SFP(G) when G is a cycle.


2019 ◽  
Vol 31 (01) ◽  
pp. 2050017
Author(s):  
Liang Wang ◽  
Xuhui Meng ◽  
Hao-Chi Wu ◽  
Tian-Hu Wang ◽  
Gui Lu

The discrete effect on the boundary condition has been a fundamental topic for the lattice Boltzmann method (LBM) in simulating heat and mass transfer problems. In previous works based on the anti-bounce-back (ABB) boundary condition for convection-diffusion equations (CDEs), it is indicated that the discrete effect cannot be commonly removed in the Bhatnagar–Gross–Krook (BGK) model except for a special value of relaxation time. Targeting this point in this paper, we still proceed within the framework of BGK model for two-dimensional CDEs, and analyze the discrete effect on a non-halfway single-node boundary condition which incorporates the effect of the distance ratio. By analyzing an unidirectional diffusion problem with a parabolic distribution, the theoretical derivations with three different discrete velocity models show that the numerical slip is a combined function of the relaxation time and the distance ratio. Different from previous works, we definitely find that the relaxation time can be freely adjusted by the distance ratio in a proper range to eliminate the numerical slip. Some numerical simulations are carried out to validate the theoretical derivations, and the numerical results for the cases of straight and curved boundaries confirm our theoretical analysis. Finally, it should be noted that the present analysis can be extended from the BGK model to other lattice Boltzmann (LB) collision models for CDEs, which can broaden the parameter range of the relaxation time to approach 0.5.


Sign in / Sign up

Export Citation Format

Share Document