Learning Policies with External Memory
| dc.creator | Peshkin, Leonid | |
| dc.creator | Meuleau, Nicolas | |
| dc.creator | Kaelbling, Leslie | |
| dc.date | 2001-03-02 | |
| dc.date.accessioned | 2026-07-07T03:16:59Z | |
| dc.date.available | 2026-07-07T03:16:59Z | |
| dc.description | In order for an agent to perform well in partially observable domains, it is usually necessary for actions to depend on the history of observations. In this paper, we explore a {\it stigmergic} approach, in which the agent's actions include the ability to set and clear bits in an external memory, and the external memory is included as part of the input to the agent. In this case, we need to learn a reactive policy in a highly non-Markovian domain. We explore two algorithms: SARSA(λ), which has had empirical success in partially observable domains, and VAPS, a new algorithm due to Baird and Moore, with convergence guarantees in partially observable domains. We compare the performance of these two algorithms on benchmark problems. | |
| dc.description | 8 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0103003 | |
| dc.identifier | http://arxiv.org/abs/cs/0103003 | |
| dc.identifier | In Bratko, I., and Dzeroski, S., eds., Machine Learning: Proceedings of the Sixteenth International Conference, pp. 307-314. Morgan Kaufmann, San Francisco, CA | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30561 | |
| dc.subject | Machine Learning | |
| dc.subject | I.2.8;I.2.6;I.2.11;I.2;I.2.3 | |
| dc.title | Learning Policies with External Memory | |
| dc.type | text |