IAI Colloquia Series at ISR: Armand Makowski, "Ants, urns and stochastic approximations"
Wednesday, March 7, 2012
1146 A.V. Williams Building
301 405 6602
Intelligent Automation, Inc. Colloquia Series
@ The Institute for Systems Research
Ants, urns and stochastic approximations
| video |
Institute for Systems Research and Department of Electrical and Computer Engineering
Ant-based algorithms are proposed for the binary bridge selection problem, and a number of issues concerning their convergence properties discussed. For the simplest algorithm, with bridges of equal length, we identify the range of parameter values which yield reinforcement learningAll ants go on the same bridge!
The presentation will emphasize connections with urn models and the theory of stochastic approximations. In the second half of the talk we touch on implementation issues (e.g., finite memory) and the case of bridges with unequal lengths.