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

Population-based continuous optimization, probabilistic modelling and mean shift.

Marcus Gallagher1, Marcus Frean

  • 1School of Information Technology and Electrical Engineering, University of Queensland, Brisbane, QLD 4072, Australia. marcusg@itee.uq.edu.au

Evolutionary Computation
|May 20, 2005
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

Tokens enable cooperation without identification or memory.

Proceedings. Biological sciences·2026
Same author

Adaptive sensing for NMR measurements.

Journal of magnetic resonance (San Diego, Calif. : 1997)·2026
Same author

Score-mediated mutual consent and indirect reciprocity.

Proceedings of the National Academy of Sciences of the United States of America·2023
Same author

Opioid dispensing 2008-18: a Queensland perspective.

Australian health review : a publication of the Australian Hospital Association·2023
Same author

Holds enable one-shot reciprocal exchange.

Proceedings. Biological sciences·2022
Same author

Network Analysis and Visualisation of Opioid Prescribing Data.

IEEE journal of biomedical and health informatics·2019
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

This study introduces a novel approach to continuous optimization by viewing evolutionary algorithms as evolving probabilistic models. It formalizes this using stochastic gradient descent, offering a new perspective on search space exploration.

Area of Science:

  • Computational intelligence
  • Optimization algorithms
  • Machine learning

Background:

  • Evolutionary algorithms (EAs) utilize populations for optimization.
  • Viewing EAs as evolving probabilistic models is an emerging area.
  • A formal basis for continuous, population-based optimization is needed.

Purpose of the Study:

  • To investigate a formal basis for continuous, population-based optimization.
  • To connect probabilistic model evolution with stochastic gradient descent.
  • To develop a new update rule for optimization algorithms.

Main Methods:

  • Formulating population-based optimization as stochastic gradient descent on Kullback-Leibler divergence.
  • Comparing the derived update rule with existing methods like Population-Based Incremental Learning (PBIL) and Generalized Mean Shift (GMS).

Related Experiment Videos

  • Conducting experiments on simple test problems to analyze algorithm dynamics.

    • Main Results:

    • A novel theoretical framework for continuous, population-based optimization was established.
    • The new update rule shows relationships to PBIL and GMS.
    • Experimental results demonstrate the dynamics of the proposed algorithm.

    Conclusions:

    • The study provides a formal, gradient-descent-based perspective on evolving probabilistic models for optimization.
    • The findings offer a theoretical link between different population-based optimization and clustering techniques.
    • The proposed method shows potential for advancing continuous optimization research.