Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Comparison-based algorithms are robust and randomized algorithms are anytime.

Sylvain Gelly1, Sylvie Ruette, Olivier Teytaud

  • 1Equipe TAO (INRIA Futurs), LRI, UMR 8623 (CNRS - Université Paris-Sud), bat. 490 Université Paris-Sud 91405 Orsay Cedex, France. gelly@lri.fr

Evolutionary Computation
|November 21, 2007
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

A newcomer's guide to deep learning for inverse design in nano-photonics.

Nanophotonics (Berlin, Germany)·2024
Same author

Inspirational Adversarial Image Generation.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2021
Same author

Investigating object compositionality in Generative Adversarial Networks.

Neural networks : the official journal of the International Neural Network Society·2020
Same author

Evolutionary algorithms converge towards evolved biological photonic structures.

Scientific reports·2020
Same author

Sparse Zero-Sum Games as Stable Functional Feature Selection.

PloS one·2015
Same author

On the hardness of offline multi-objective optimization.

Evolutionary computation·2007
Same journal

Computing Optimal Populations for Binary Problems using Logic Minimization.

Evolutionary computation·2026
Same journal

Enhancing Generalization and Scalability for Multi-Objective Optimization with Population Pre-Training.

Evolutionary computation·2026
Same journal

XCS for Sequential Perceptual Aliasing in Multi-Step Decision Making.

Evolutionary computation·2026
Same journal

A dynamic multi-objective evolutionary algorithm using dual-space prediction and surrogate-based sampling.

Evolutionary computation·2026
Same journal

Adapting MOEA/D to CMA-ES for Dealing with Ill-conditioned Multiobjective Problems.

Evolutionary computation·2026
Same journal

Editorial of the Special Issue: Parallel Problem Solving from Nature PPSN 2024 Extended Versions of Best Paper Candidates.

Evolutionary computation·2026
See all related articles

Randomized search heuristics offer good performance and are easy to implement. This study shows comparison-based methods enhance robustness, while offspring randomness improves anytime performance for optimization algorithms.

Area of Science:

  • Computer Science
  • Artificial Intelligence
  • Optimization

Background:

  • Randomized search heuristics, including evolutionary algorithms and simulated annealing, are widely used due to their practical implementation and effectiveness.
  • Theoretical analyses often concentrate on convergence rates, potentially overlooking other performance aspects.

Purpose of the Study:

  • To provide a mathematical analysis of randomized search heuristics employing comparison-based selection.
  • To investigate the impact of randomness in offspring selection on algorithm performance.
  • To develop and validate an improved algorithm based on these findings.

Main Methods:

  • Mathematical analysis of comparison-based selection mechanisms in randomized search.
  • Theoretical examination of the influence of randomness in offspring selection.

Related Experiment Videos

  • Development of a novel Estimation of Distribution Algorithm (EDA).

    • Main Results:

    • Comparison-based algorithms demonstrate superior performance according to specific robustness criteria.
    • Incorporating randomness in offspring selection enhances the anytime behavior of the algorithms.
    • The proposed EDA, integrating these principles, yielded successful experimental results.

    Conclusions:

    • Randomized search heuristics with comparison-based selection offer significant robustness advantages.
    • Strategic introduction of randomness in offspring selection is key to improving anytime performance.
    • The novel EDA provides a practical and effective approach for optimization tasks.