Why Flow Matching is Particle Swarm Optimization?
It provides a theoretical link between generative models and evolutionary computation, which is incremental but could inspire new algorithms.
This paper investigates the duality between flow matching in generative models and particle swarm optimization (PSO) in evolutionary computation, revealing intrinsic connections in their mathematical formulations and optimization mechanisms, and establishes a theoretical foundation for developing hybrid algorithms.
This paper preliminarily investigates the duality between flow matching in generative models and particle swarm optimization (PSO) in evolutionary computation. Through theoretical analysis, we reveal the intrinsic connections between these two approaches in terms of their mathematical formulations and optimization mechanisms: the vector field learning in flow matching shares similar mathematical expressions with the velocity update rules in PSO; both methods follow the fundamental framework of progressive evolution from initial to target distributions; and both can be formulated as dynamical systems governed by ordinary differential equations. Our study demonstrates that flow matching can be viewed as a continuous generalization of PSO, while PSO provides a discrete implementation of swarm intelligence principles. This duality understanding establishes a theoretical foundation for developing novel hybrid algorithms and creates a unified framework for analyzing both methods. Although this paper only presents preliminary discussions, the revealed correspondences suggest several promising research directions, including improving swarm intelligence algorithms based on flow matching principles and enhancing generative models using swarm intelligence concepts.