Take the 2-minute tour ×
Computational Science Stack Exchange is a question and answer site for scientists using computers to solve scientific problems. It's 100% free, no registration required.

Does anyone know of a variant of the CMA algorithm that is suitable for an asynchronous parallel implementation?

The conventional version of the algorithm allows one to evaluate the fitness function at different points in parallel, but one has to wait until all computations are finished before starting the next iteration. If the computational cost of the fitness function is heterogeneous, the parallel efficiency quickly degrades. Ideally an asynchronous version should be such that parameters are not disadvantaged when the fitness function takes longer to compute.

share|improve this question
add comment

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.