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

Jul 31, 2026

Linear Proposal Operators and Stochastic Search Geometry in SOMA and Differential Evolution

Swarm and evolutionary algorithms are usually analyzed as complete procedural systems in which nonlinear selection, replacement, and adaptation obscure simpler structure within candidate generation. This paper introduces an operator--selection factorization that separates objective-independent variation from boundary repair and fitness-dependent selection, and uses it to study the proposal geometry of the Self-Organizing Migrating Algorithm (SOMA) and Differential Evolution (DE). The canonical SOMA proposal is shown to be affine in the search space and exactly linear in an augmented migrant--leader state. In leader-relative coordinates, the resulting operator provides a direct interpretation of interpolation, projection, overshooting, and coordinate masking. Under Bernoulli perturbation masks, we derive closed-form expressions for the proposal mean, covariance, expected squared step length, expected squared distance from the leader, active dimensionality, and coordinate coverage. For canonical DE/rand/1/bin, we derive the finite-population moments of differential mutation and characterize the additional covariance and coordinate dependence induced by forced-coordinate binomial crossover. Exact enumeration and Monte Carlo experiments verify the analytical identities and quantify the effects of mask conditioning, boundary repair, and fitness-based selection. The analysis further motivates geometry-controlled and rotation-aware SOMA variants, together with an adaptive population-reducing extension of iSOMA. Experiments on the complete noiseless BBOB benchmark show that these operator-guided variants substantially improve upon canonical SOMA and are competitive with established DE methods in several dimension--budget regimes. The results demonstrate how proposal-level operator analysis can support both the interpretation and design of population-based optimizers.
Apr 27, 2026

Stochastic simultaneous optimistic optimization

We study the problem of global maximization of a function f given a finite number of evaluations perturbed by noise. We consider a very weak assumption on the function, namely that it is locally smooth (in some precise sense) with respect to some semi-metric, around one of its global maxima. Compared to previous works on bandits in general spaces (Kleinberg et al., 2008; Bubeck et al., 2011a) our algorithm does not require the knowledge of this semi-metric. Our algorithm, StoSOO, follows an optimistic strategy to iteratively construct upper confidence bounds over the hierarchical partitions of the function domain to decide which point to sample next. A finite-time analysis of StoSOO shows that it performs almost as well as the best specifically-tuned algorithms even though the local smoothness of the function is not known.
May 11, 2026

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

In recent years, a theoretical understanding has rapidly advanced regarding how popular multi-objective evolutionary algorithms (MOEAs) can optimize many-objective problems. However, the benefits of using crossover in many-objective optimization are theoretically not understood, except for specifically designed benchmark functions tuned to particular crossover operators, and still lag significantly behind its practical use. In this paper, we build upon this line of research and present a theoretical runtime analysis of the widely used NSGA-III algorithm on the classical mm-objective mm-OneJumpZeroJump function (mm-OJZJ for short). Our results demonstrate that NSGA-III with crossover optimizes mm-OJZJ asymptotically faster than NSGA-III without crossover for any number mm of objectives for huge parameter regimes. We complement our analysis by providing a lower runtime bound on 44-OJZJ when crossover is turned off.