analiza aiqbench
This research addresses the "black-box" nature of Particle Swarm Optimization by introducing a dual-perspective explainability framework that combines landscape analysis with machine learning classifiers to predict optimal hyperparameters. By integrating temporal convergence profiling and novel spatial navigation metrics, the study provides actionable guidelines for improving transparency in swarm intelligence systems without relying on hype or marketing fluff.
Explainable Information Processing in Particle Swarm Optimization through Landscape and Search Behavior Analysis
arXiv:2505.15741v2 Announce Type: replace-cross Abstract: 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.
Abstract: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 this https URL.
Neural and Evolutionary Computing (cs.NE); Computation and Language (cs.CL); Multiagent Systems (cs.MA)
arXiv:2505.15741 [cs.NE]
(or arXiv:2505.15741v2 [cs.NE] for this version)
https://doi.org/10.48550/arXiv.2505.15741 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 297 cuvinte
Subiecte conexe
Explainable Information Processing in Particle Swarm Optimization through Landscape and Search Behavior Analysis
arXiv · 3 sept. 2026

Generalization and infinite width
LessWrong · 1 aug. 2026
Latent reasoning architectures would likely undermine CoT, our strongest oversight tool
AI Alignment Forum · 23 sept. 2026
Problems of Proliferation
LessWrong · 29 sept. 2026