Search arXiv⌕ Search

arXiv · 2610.33421

Freezing Mechanism and Topology Dependence of Information Flow Structure in Small-Scale Particle Swarm Optimization

Abstract

The neighborhood topology of particle swarm optimization (PSO) determines information propagation and regulates the exploration-exploitation balance. However, existing evaluation methods based on fitness and spatial diversity fail to characterize the dynamic evolution internal interaction structure of the population. To address this gap, this paper focuses on small-scale PSO (20-50 particles) with regular topologies and models the iterative process as a dynamic weighted influence graph. We construct a multi-scale information-flow evaluation framework covering micro-, meso-, and macro-level metrics, and propose a freeze-point detection method based on effective nodes, a macro-level distributional metric. Experiments on CEC2017 benchmark functions show that the information flow structure freezes early in the search (3 percent - 22 percent for representative configurations and 15 percent-49 percent for global medians) and remains unchanged thereafter. The freeze time follows the order Gbest$<$ Von Neumann $<$Ring, consistent across standard, LDIW, and TVAC variants. Parameter-adaptive variants delay freezing without altering the topological order, and the freeze point is significantly negatively correlated with final solution quality. Intervention experiments under Gbest show that weakening hub nodes delays freezing and improves performance on multimodal functions, while strengthening hubs produces no additional deterioration due to saturation, revealing a decoupling between structural and performance effects. Among the three metric levels, only macro-level distributional metrics effectively capture freezing under regular topologies, because micro- and meso-level structures are predetermined by the topology. These findings reveal the freezing mechanism of information flow in small-scale PSO and provide structural prior signals for adaptive topology control.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhenglong Xiang, Hongrun Wu, Yu Xue, Fei Yu, Yuanxiang Li. 2026-10-24. Freezing Mechanism and Topology Dependence of Information Flow Structure in Small-Scale Particle Swarm Optimization. https://arxiv.org/abs/2610.33421

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reconstruction differences rival individual differences in the fly compass connectome and break trained circuit models

Neural network models are increasingly constructed from synapse-resolution connectomes, and the same circuit is now available in reconstructions from other animals and pipelines. We do not know whether such models are dependent on the reconstruction they are built from, and whether connectome differences are biological or measurement errors. We studied the Drosophila head-direction circuit in nine versions: four flies (male CNS, hemibrain, FlyWire, BANC) and five variants of the same fly varying only by thresholds, proofreading or synapse detection. Using wiring-based correspondences validated by anatomical labels, we place all differences on one scale. A change of synapse detection within one fly changed the circuit more than halfway to the smallest between-fly difference on four distance measures; proofreading differences were smaller but depended on the metric, and left and right halves of one fly differed no more than random halves. Networks trained on each wiring to hold a cued heading developed near-perfect ring attractors, but their error increased from below 1 degree to 10-28 degrees when all weights changed by 1%. Training on each wiring did not transfer to any other connectome, including other versions of the same fly; refitting thirty cell-type gains, we repaired filtering-level differences but remaining error depended on wiring distance. Training with noise lowered precision and gave only partial transfer. In imaging data, the fly compass drifted gradually in darkness. Connectome-constrained models should report the reconstruction they were built on and be tested for robustness across reconstructions.

cs.NE↗

A Dynamic Decomposition Strategy for the MOEA/D With Proven Performance Guarantees

The MOEA/D is one of the most successful multi-objective evolutionary algorithms. It operates by decomposing the optimization problem into single-objective subproblems, which are then solved in a co-evolutionary manner. The performance of the MOEA/D depends critically on this decomposition. In this work, we propose a novel way to adjust this decomposition on the fly, for the case of discrete bi-objective optimization. Different from all previous works in this direction, we support our new algorithm with a proven performance guarantee. This is the first work that rigorously proves the runtime of a dynamic multi-objective evolutionary algorithm. For monotonic distortions of the simple LOTZ benchmark, it is known that classic decompositions leave large holes in the Pareto front, making it very hard for the MOEA/D to cover the entire Pareto front. In contrast, we prove that our self-adjusting MOEA/D solves all these LOTZ problems in an expected number of $O(n^4)$ function evaluations. This relatively low runtime as well as the details of our mathematical proof show that the dynamic decomposition strategy indeed evolves a decomposition adjusted to each of these problem instances.

cs.NE↗

Understanding the Co-evolutionary Solution Exchange of the MOEA/D: Already the Smallest Communication Radius Gives the Best-Possible Speed-Up

Besides domination-based algorithms such as the NSGA-II, the decomposition-based MOEA/D is one of the most popular and successful optimization heuristic for multi-objective problems. It decomposes the problem into several, single-objective subproblems. By solving these in a co-evolutionary manner and archiving non-dominated solutions, it approximates or computes the Pareto front. Interestingly, so far no advantages from the co-evolutionary communication of subproblem solutions were proven. In this first mathematical runtime analysis addressing this research question, we investigate how the mutation-based MOEA/D solves the classic OneMinMax benchmark when solutions are exchanged among subproblems in different distances $r$. We show, for the first time, that the MOEA/D profits from an exchange of solutions, and that already very small communication radii $r$ are sufficient to maximally profit from this feature of the algorithm. More precisely, for all values $r \ge 1$ we prove a tight runtime guarantee of $Θ(n^2)$, where $n$ is the problem size. This is asymptotically faster than the known bound of $O(n^2 \log n)$ guarantee for $r=0$, which we complement with a matching bound of $Ω(n^2 \log n)$.

cs.NE↗