Leslie Pack Kaelbling
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Leslie Pack Kaelbling has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Andrew W. Moore
Carnegie Mellon University
1 shared publication - Dana Angluin
Yale University
1 shared publication Evangelos Kokkevis
Brown University
1 shared publication- Kenneth Basye
Brown University
1 shared publication - Leonid Peshkin
Brown University, Providence, RI 02912, USA
1 shared publication - Michael L. Littman
Brown University, Providence, Rhode Island, USA
1 shared publication
Latest Publications
- 21 August 2007
- Published by Springer Nature
- p. 7-9
Introduction
- Open Access
Learning Policies with External Memory
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(\lambda), 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.
Open AccessLearning Policies with External Memory
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(\lambda), 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.
- Open Access
Reinforcement Learning: A Survey
This paper surveys the field of reinforcement learning from a computer-science perspective. It is written to be accessible to researchers familiar with machine learning. Both the historical basis of the field and a broad selection of current work are summarized. Reinforcement learning is the problem faced by an agent that learns behavior through trial-and-error interactions with a dynamic environment. The work described here has a resemblance to work in psychology, but differs considerably in the details and in the use of the word ``reinforcement.'' The paper discusses central issues of reinforcement learning, including trading off exploration and exploitation, establishing the foundations of the field via Markov decision theory, learning from delayed reinforcement, constructing empirical models to accelerate learning, making use of generalization and hierarchy, and coping with hidden state. It concludes with a survey of some implemented systems and an assessment of the practical utility of current methods for reinforcement learning.
Open AccessReinforcement Learning: A Survey
This paper surveys the field of reinforcement learning from a computer-science perspective. It is written to be accessible to researchers familiar with machine learning. Both the historical basis of the field and a broad selection of current work are summarized. Reinforcement learning is the problem faced by an agent that learns behavior through trial-and-error interactions with a dynamic environment. The work described here has a resemblance to work in psychology, but differs considerably in the details and in the use of the word ``reinforcement.'' The paper discusses central issues of reinforcement learning, including trading off exploration and exploitation, establishing the foundations of the field via Markov decision theory, learning from delayed reinforcement, constructing empirical models to accelerate learning, making use of generalization and hierarchy, and coping with hidden state. It concludes with a survey of some implemented systems and an assessment of the practical utility of current methods for reinforcement learning.
- Open Access
- 1 January 1996
- Published by Springer Nature in Machine Learning
- Vol. 22 (1) , 7-9
Introduction
- 1 January 1996
- Published by Springer Nature in Machine Learning
- Vol. 22 (1) , 7-9
Open AccessIntroduction
- 1 January 1995
- Published by Springer Nature in Machine Learning
- Vol. 18 (1) , 81-108
Inferring finite automata with stochastic output functions and an application to map learning
- 1 January 1995
- Published by Springer Nature in Machine Learning
- Vol. 18 (1) , 81-108
Inferring finite automata with stochastic output functions and an application to map learning
- 1 June 1994
- Published by Springer Nature in Machine Learning
- Vol. 15 (3) , 279-298
Associative reinforcement learning: Functions ink-DNF
- 1 June 1994
- Published by Springer Nature in Machine Learning
- Vol. 15 (3) , 279-298
Associative reinforcement learning: Functions ink-DNF