Noisy time series generation by feed-forward networks

Details Noisy time series generation by feed-forward networks Noisy time series generation by feed-forward networks

1998-03-22

arxiv.org/abs/cond-mat/9803267v1

J. Phys. A 31 (1998) 1189-1209

Physics

Condensed Matter

Disordered Systems and Neural Networks

13 Latex pages including 16 figures

Scientific paper

10.1088/0305-4470/31/4/009

We study the properties of a noisy time series generated by a continuous-valued feed-forward network in which the next input vector is determined from past output values. Numerical simulations of a perceptron-type network exhibit the expected broadening of the noise-free attractor, without changing the attractor dimension. We show that the broadening of the attractor due to the noise scales inversely with the size of the system ,$N$, as $1/ \sqrt{N}$. We show both analytically and numerically that the diffusion constant for the phase along the attractor scales inversely with $N$. Hence, phase coherence holds up to a time that scales linearly with the size of the system. We find that the mean first passage time, $t$, to switch between attractors depends on $N$, and the reduced distance from bifurcation $\tau$ as $t = a {N \over \tau} \exp(b \tau N^{1/2})$, where $b$ is a constant which depends on the amplitude of the external noise. This result is obtained analytically for small $\tau$ and confirmed by numerical simulations.

Affiliated with

Also associated with

No associations

Rating

Noisy time series generation by feed-forward networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Noisy time series generation by feed-forward networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Noisy time series generation by feed-forward networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-49762