cs.NENov 12, 2026

A Finite Markov Chain Analysis of the Simplified Swarm Optimisation Update Rule

Authors: Wei-Chang Yeh

Organizations: Department of Industrial Engineering and Engineering Management, National Tsing Hua University, No. 101, Section 2, Kuang-Fu Road, Hsinchu 30013, Taiwan

Abstract

Simplified swarm optimisation (SSO) updates each variable by one draw that copies the global or personal best, keeps the current value or redraws uniformly, with probabilities cgc_g, cpc_p, cwc_w and crc_r. As a finite Markov chain under frozen memory, its coordinate kernel cwI+(1−cw)Πc_w I + (1 - c_w)Π has an explicit stationary law and exact convergence rate cwtc_w^t. The elitist chain has a geometric hitting-time bound, from a non-optimal start a fixed crc_r needs at least exp⁡(ncr/2)\exp(nc_r/2) expected evaluations to reach a unique optimum, and a coupling under changing memories gives O(nlog⁡n)O(n\log n) and O(n2)O(n^2) expected generations on OneMax and LeadingOnes for every population size with redraw share of order 1/n1/n and no inertia, and within a log⁡n\log n factor for fixed inertia. With a frozen memory, inertia cannot speed up first entry into any set from stationary positions, though it can from others. Where the three reference values agree, only crc_r acts; where they disagree, copy branches recombine the memories, forcing a redraw only where no active branch holds the target value. Branch logging and checkpoint replay show inertia slowed the tested OneMax and LeadingOnes runs and suggest memory-mediated gains on wider gaps. On Jump functions SSO needed 3.8--8.9 times fewer evaluations than the (1+1) evolutionary algorithm with rate 1/n1/n, but no consistent advantage over rate-adjusted mutation or a (μ+1)(μ+1) genetic algorithm with uniform crossover was established. The analytical redraw rule improved six of eight benchmark--setting pairs and redundancy allocation, but was slower than cr=0.1c_r = 0.1 on Jump2_2.

Explore similar work

CardsList
  1. Linear Proposal Operators and Stochastic Search Geometry in SOMA and Differential Evolution

    Jul 31, 2026Vojtěch Novák, Ivan ZelinkaDifferential EvolutionEvolutionary Optimization

  2. Stochastic simultaneous optimistic optimization

    Apr 27, 2026Michal Valko, Alexandra Carpentier, Rémi MunosStochastic OptimizationMulti-Armed Bandits

  3. On the Impact of Crossover in Many-Objective Optimization: A Runtime Analysis of NSGA-III

    May 11, 2026Andre OprisEvolutionary OptimizationMulti-Objective Evolutionary Optimization