Sarah Louise Thomson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Sarah Louise Thomson has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Gabriela Ochoa
University of Stirling
11 shared publications - Sébastien Verel
Université du Littoral Côte d'Opale, Calais, France
8 shared publications - Daan van Den Berg
Vrije Universiteit Amsterdam
6 shared publications - Nadarajen Veerapen
Univ. Lille, CNRS, Centrale Lille, UMR 9189 CRIStAL, Lille, France
6 shared publications - Emma Hart
Edinburgh Napier University
5 shared publications - Alexander Edward Ian Brownlee
University of Stirling, Stirling, United Kingdom
4 shared publications
Latest Publications
- 25 August 2026
- Published by Springer Nature
- p. 616-632
Untangling the Tapestry: k-Bounded Problems and Local Optima Networks
- 25 August 2026
- Published by Springer Nature
- p. 616-632
Untangling the Tapestry: k-Bounded Problems and Local Optima Networks
- 22 July 2025
- Published by Springer Nature
- p. 70-83
Factors Impacting Landscape Ruggedness in Control Problems: A Case Study
- 22 July 2025
- Published by Springer Nature
- p. 70-83
Factors Impacting Landscape Ruggedness in Control Problems: A Case Study
- Open Access
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2285-2293
Algorithm Explainability for Malware Evolution with Search Trajectory Networks
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2285-2293
Open AccessAlgorithm Explainability for Malware Evolution with Search Trajectory Networks
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 85-93
Subfunction Structure Matters: A New Perspective on Local Optima Networks
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 85-93
Open AccessSubfunction Structure Matters: A New Perspective on Local Optima Networks
- 3 May 2025
- Published by Springer Nature
- p. 117-148
XAI for Algorithm Configuration and Selection
- 17 April 2025
- Published by Springer Nature
- p. 20-35
Into the Black Box: Mining Variable Importance with XAI
- 17 April 2025
- Published by Springer Nature
- p. 20-35
Into the Black Box: Mining Variable Importance with XAI
- 17 April 2025
- Published by Springer Nature
- p. 510-526
Stalling in Space: Attractor Analysis for Any Algorithm
- 17 April 2025
- Published by Springer Nature
- p. 510-526
Stalling in Space: Attractor Analysis for Any Algorithm
- Open Access
Stalling in Space: Attractor Analysis for any Algorithm
Network-based representations of fitness landscapes have grown in popularity in the past decade; this is probably because of growing interest in explainability for optimisation algorithms. Local optima networks (LONs) have been especially dominant in the literature and capture an approximation of local optima and their connectivity in the landscape. However, thus far, LONs have been constructed according to a strict definition of what a local optimum is: the result of local search. Many evolutionary approaches do not include this, however. Popular algorithms such as CMA-ES have therefore never been subject to LON analysis. Search trajectory networks (STNs) offer a possible alternative: nodes can be any search space location. However, STNs are not typically modelled in such a way that models temporal stalls: that is, a region in the search space where an algorithm fails to find a better solution over a defined period of time. In this work, we approach this by systematically analysing a special case of STN which we name attractor networks. These offer a coarse-grained view of algorithm behaviour with a singular focus on stall locations. We construct attractor networks for CMA-ES, differential evolution, and random search for 24 noiseless black-box optimisation benchmark problems. The properties of attractor networks are systematically explored. They are also visualised and compared to traditional LONs and STN models. We find that attractor networks facilitate insights into algorithm behaviour which other models cannot, and we advocate for the consideration of attractor analysis even for algorithms which do not include local search.
Open AccessStalling in Space: Attractor Analysis for any Algorithm
Network-based representations of fitness landscapes have grown in popularity in the past decade; this is probably because of growing interest in explainability for optimisation algorithms. Local optima networks (LONs) have been especially dominant in the literature and capture an approximation of local optima and their connectivity in the landscape. However, thus far, LONs have been constructed according to a strict definition of what a local optimum is: the result of local search. Many evolutionary approaches do not include this, however. Popular algorithms such as CMA-ES have therefore never been subject to LON analysis. Search trajectory networks (STNs) offer a possible alternative: nodes can be any search space location. However, STNs are not typically modelled in such a way that models temporal stalls: that is, a region in the search space where an algorithm fails to find a better solution over a defined period of time. In this work, we approach this by systematically analysing a special case of STN which we name attractor networks. These offer a coarse-grained view of algorithm behaviour with a singular focus on stall locations. We construct attractor networks for CMA-ES, differential evolution, and random search for 24 noiseless black-box optimisation benchmark problems. The properties of attractor networks are systematically explored. They are also visualised and compared to traditional LONs and STN models. We find that attractor networks facilitate insights into algorithm behaviour which other models cannot, and we advocate for the consideration of attractor analysis even for algorithms which do not include local search.
- Open Access
- 7 September 2024
- Published by Springer Nature
- p. 36-50
A Deep Dive Into Effects of Structural Bias on CMA-ES Performance Along Affine Trajectories
To guide the design of better iterative optimisation heuristics, it is imperative to understand how inherent structural biases within algorithm components affect the performance on a wide variety of search landscapes. This study explores the impact of structural bias in the modular Covariance Matrix Adaptation Evolution Strategy (modCMA), focusing on the roles of various modulars within the algorithm. Through an extensive investigation involving $$435\,456$$ configurations of modCMA, we identified key modules that significantly influence structural bias of various classes. Our analysis utilized the Deep-BIAS toolbox for structural bias detection and classification, complemented by SHAP analysis for quantifying module contributions. The performance of these configurations was tested on a sequence of affine-recombined functions, maintaining fixed optimum locations while gradually varying the landscape features. Our results demonstrate an interplay between module-induced structural bias and algorithm performance across different landscape characteristics.- 7 September 2024
- Published by Springer Nature
- p. 36-50
Open AccessA Deep Dive Into Effects of Structural Bias on CMA-ES Performance Along Affine Trajectories
To guide the design of better iterative optimisation heuristics, it is imperative to understand how inherent structural biases within algorithm components affect the performance on a wide variety of search landscapes. This study explores the impact of structural bias in the modular Covariance Matrix Adaptation Evolution Strategy (modCMA), focusing on the roles of various modulars within the algorithm. Through an extensive investigation involving $$435\,456$$ configurations of modCMA, we identified key modules that significantly influence structural bias of various classes. Our analysis utilized the Deep-BIAS toolbox for structural bias detection and classification, complemented by SHAP analysis for quantifying module contributions. The performance of these configurations was tested on a sequence of affine-recombined functions, maintaining fixed optimum locations while gradually varying the landscape features. Our results demonstrate an interplay between module-induced structural bias and algorithm performance across different landscape characteristics. - 7 September 2024
- Published by Springer Nature
- p. 377-392
Entropy, Search Trajectories, and Explainability for Frequency Fitness Assignment
- 7 September 2024
- Published by Springer Nature
- p. 377-392
Entropy, Search Trajectories, and Explainability for Frequency Fitness Assignment