Swarm-based gradient descent meets simulated annealing
Zhiyan Ding, Martin Guerra, Qin Li, Eitan Tadmor

TL;DR
This paper introduces Swarm-based Simulated Annealing (SSA), a novel non-convex optimization method combining swarm exploration with adaptive cooling, showing promising convergence and performance on benchmark problems.
Contribution
The paper presents SSA, a new optimization algorithm that integrates swarm dynamics with adaptive annealing based on agent mass, advancing beyond traditional SBGD and SA methods.
Findings
SSA effectively balances exploration and exploitation.
Convergence analysis supports the method's theoretical robustness.
Benchmark tests demonstrate superior optimization performance.
Abstract
We introduce a novel method for non-convex optimization, called Swarm-based Simulated Annealing (SSA), which is at the interface between the swarm-based gradient-descent (SBGD) [J. Lu et. al., ArXiv:2211.17157; E.Tadmor and A. Zenginoglu, Acta Applicandae Math., 190, 2024] and Simulated Annealing (SA) [V. Cerny, J. optimization theory and appl., 45:41-51, 1985; S.Kirkpatrick et. al., Science, 220(4598):671-680, 1983; S. Geman and C.-R. Hwang, SIAM J. Control and Optimization, 24(5):1031-1043, 1986]. Similar to SBGD, we introduce a swarm of agents, each identified with a position, and mass , to explore the ambient space. Similar to SA, the agents proceed in the gradient descent direction, and are subject to Brownian motion. The annealing rate, however, is dictated by a decreasing function of their mass. As a consequence, instead of the SA protocol for time-decreasing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMetaheuristic Optimization Algorithms Research
