The current source text is the original text and can be switched to the Chinese translation.
SaveShare
Overview
arXiv:2610.33421v1 Announce Type: new 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.
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 .
READ THE ORIGINAL
Read the original for the full context.
The content of this article comes from arXiv cs.NE,Copyright belongs to the original author and publisher.
arXiv:2610.33358v1 Announce Type: new Abstract: Hardware-aware neural architecture search (NAS) requires jointly optimizing predictive accuracy and device-specific latency over discrete search spaces. While multi-objective swarm optimizers show promise, continuous formulations such as the Multi-Objective White Shark Optimizer (MOWSO) can suffer from quantization noise when rounded to integer-encoded architecture vectors.
arXiv:2610.31716v1 Announce Type: new Abstract: We examine how closely pretrained LeWorldModel (LeWM) reproduces the effects of small action changes. Using matched simulator and model responses, we measure action sensitivity with Gram matrices at three perturbation scales.
arXiv:2610.33712v1 Announce Type: new Abstract: Federated learning trains a shared model across clients without exchanging their data, yet the updates they transmit still leak information about individual records. Enforcing differential privacy is harder still when the model parameters lie on a Riemannian manifold.
Loading comments…