IAI Colloquia Series at ISR: Armand Makowski, "Ants, urns and stochastic approximations"

Wednesday, March 7, 2012
4:00 p.m.
1146 A.V. Williams Building
Rebecca Copeland
301 405 6602
rebeccac@umd.edu

Intelligent Automation, Inc. Colloquia Series
@ The Institute for Systems Research

Ants, urns and stochastic approximations

| video |

Armand Makowski
Institute for Systems Research and Department of Electrical and Computer Engineering

Abstract
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 learning—All 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.

Audience: Graduate  Undergraduate  Faculty  Post-Docs  Alumni  Corporate 

 

May 2020

SU MO TU WE TH FR SA
26 27 28 29 30 1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30
31 1 2 3 4 5 6
Submit an Event