Related Experiment Videos
Ant colony optimization and stochastic gradient descent
Nicolas Meuleau1, Marco Dorigo
1IRIDIA, Université Libre de Bruxelles, Avenue Franklin Roosevelt 50, CP 194/6, B-1050 Brussels, Belgium. nmeulau@iridia.ulb.ac.be
Abstract:
In this article, 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.
Related Concept Videos
Methods of Medium Optimization
Optimization Problems
Cluster Sampling Method
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
Maximizing the Directional Derivative
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Lagrange Multipliers: Problem Solving