# Explainable Information Processing in Particle Swarm Optimization through Landscape and Search Behavior Analysis

arXiv: https://arxiv.org/abs/2509.06272 · HTML: https://mlsanity.com/paper/2509.06272/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 12 of its 69 references that are in the map.
- First posted on arXiv 8 Sep 2025.

## Builds on (most cited first, 12 of 12)

- [A Unified Approach to Interpreting Model Predictions](https://mlsanity.com/paper/1705.07874/) (2017)
- [Explainable Artificial Intelligence (XAI): Concepts, Taxonomies, Opportunities and Challenges toward Responsible AI](https://mlsanity.com/paper/1910.10045/) (2019)
- [Towards A Rigorous Science of Interpretable Machine Learning](https://mlsanity.com/paper/1702.08608/) (2017)
- [COCO: A Platform for Comparing Continuous Optimizers in a Black-Box Setting](https://mlsanity.com/paper/1603.08785/) (2016)
- [Reliable Post hoc Explanations: Modeling Uncertainty in Explainability](https://mlsanity.com/paper/2008.05030/) (2020)
- [Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning](https://mlsanity.com/paper/1711.08921/) (2017)
- [Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-Package flacco](https://mlsanity.com/paper/1708.05258/) (2017)
- [BOAH: A Tool Suite for Multi-Fidelity Bayesian Optimization & Analysis of Hyperparameters](https://mlsanity.com/paper/1908.06756/) (2019)
- [Using the Empirical Attainment Function for Analyzing Single-objective Black-box Optimization Algorithms](https://mlsanity.com/paper/2404.02031/) (2024)
- [The Importance of Landscape Features for Performance Prediction of Modular CMA-ES Variants](https://mlsanity.com/paper/2204.07431/) (2022)
- [Improving Nevergrad's Algorithm Selection Wizard NGOpt through Automated Algorithm Configuration](https://mlsanity.com/paper/2209.04412/) (2022)
- [Enhancing Explainability and Reliable Decision-Making in Particle Swarm Optimization through Communication Topologies](https://mlsanity.com/paper/2504.12803/) (2025)

## Abstract (arXiv)

Swarm-based optimization algorithms have demonstrated remarkable success in solving complex problems, yet their widespread adoption remains limited due to poor transparency in how algorithmic components influence performance. This work presents a multi-faceted explainability framework for Particle Swarm Optimization (PSO) through two complementary perspectives: landscape-based and algorithmic explainability. From the landscape-based perspective, we develop a comprehensive characterization framework using Exploratory Landscape Analysis (ELA) to quantify problem difficulty, multimodality, and ruggedness, extracting ELA meta-features, dispersion measures, and information content statistics, while a machine learning approach employing Decision Tree and Random Forest classifiers enables prediction of optimal topology-specific hyperparameter configurations for unseen problems. From the algorithmic explainability perspective, we integrate IOHxplainer for temporal convergence profiling and Search Trajectory Networks (STN) for spatial navigation mapping, proposing three novel STN metrics-Connectivity Density, Fragmentation Score, and Search Efficiency-that enhance visual explainability by quantifying topology-specific search organization and transition effectiveness. Through systematic experimentation across 24 benchmark functions in multiple dimensions with Star, Ring, and Von Neumann topologies, we establish practical guidelines for topology selection and parameter configuration. Our findings uncover the black-box nature of PSO, providing greater transparency and interpretability to swarm intelligence systems. The source code is available at https://github.com/GitNitin02/ioh_pso.