Browse Articles

In their paper, Kreiman et al. examined what it takes for an artificial neural network to be able to perform well on a new task without forgetting its previous knowledge. By comparing methods that stop task forgetting, they found that longer training times and maintenance of the most important connections in a particular task while training on a new one helped the neural network maintain its performance on both tasks. The authors hope that this proof-of-principle research will someday contribute to artificial intelligence that better mimics natural human intelligence.

Ant colony optimization algorithms simulate ants moving from point to point on a graph and coordinate their actions, similar to ants laying down pheromones to strengthen a path as it is used more frequently. These ACO algorithms can be applied to the classic traveling salesman problem, which aims to determine the lowest-cost path through a given set of points on a graph. In this study, a novel multiple-colony system was developed that uses multiple simulated ant colonies to generate improved solutions to the traveling salesman problem.