Characterization of the convergence of stationary Fokker-Planck learning

Details Characterization of the convergence of stationary Fokker-Planck learning Characterization of the convergence of stationary Fokker-Planck learning

2008-02-21

arxiv.org/abs/0802.3235v3

Computer Science

Neural and Evolutionary Computing

Scientific paper

10.1016/j.neucom.2008.12.042

The convergence properties of the stationary Fokker-Planck algorithm for the estimation of the asymptotic density of stochastic search processes is studied. Theoretical and empirical arguments for the characterization of convergence of the estimation in the case of separable and nonseparable nonlinear optimization problems are given. Some implications of the convergence of stationary Fokker-Planck learning for the inference of parameters in artificial neural network models are outlined.

Affiliated with

Also associated with

No associations

Rating

Characterization of the convergence of stationary Fokker-Planck learning 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 Characterization of the convergence of stationary Fokker-Planck learning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Characterization of the convergence of stationary Fokker-Planck learning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-303059