Ant Colony Optimization and Stochastic Gradient Descent

In this paper, we study the relationship between the two techniques known as ant colony optimization (aco) and stochastic gradient descent. More precisely, we show that some empirical aco algorithms approximate stochastic gradient descent in the space of pheromones, and we propose an implementation of stochastic gradient descent that belongs to the family of aco algorithms. We then use this insight to explore the mutual contributions of the two techniques. Keywords Heuristic; Ant System; Ant colony optimization; Combinatorial optimization; Stochastic gradient descent; Reinforcement learning.

• Type: Journal
• Year: 2002
• Where: ALIFE
• Authors: Nicolas Meuleau, Marco Dorigo
• Keywords: ALIFE 2002, ALIFE 2007, Ant Colony Optimization, Empirical Aco, Stochastic Gradient Descent