Dynamic Observation Policies in Observation Cost-Sensitive Reinforcement Learning

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Bellinger, Colin, Crowley, Mark, Tamblyn, Isaac
Formato: Preprint
Publicado: 2023
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866907872258949120
author Bellinger, Colin
Crowley, Mark
Tamblyn, Isaac
author_facet Bellinger, Colin
Crowley, Mark
Tamblyn, Isaac
contents Reinforcement learning (RL) has been shown to learn sophisticated control policies for complex tasks including games, robotics, heating and cooling systems and text generation. The action-perception cycle in RL, however, generally assumes that a measurement of the state of the environment is available at each time step without a cost. In applications such as materials design, deep-sea and planetary robot exploration and medicine, however, there can be a high cost associated with measuring, or even approximating, the state of the environment. In this paper, we survey the recently growing literature that adopts the perspective that an RL agent might not need, or even want, a costly measurement at each time step. Within this context, we propose the Deep Dynamic Multi-Step Observationless Agent (DMSOA), contrast it with the literature and empirically evaluate it on OpenAI gym and Atari Pong environments. Our results, show that DMSOA learns a better policy with fewer decision steps and measurements than the considered alternative from the literature.
format Preprint
id arxiv_https___arxiv_org_abs_2307_02620
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Dynamic Observation Policies in Observation Cost-Sensitive Reinforcement Learning
Bellinger, Colin
Crowley, Mark
Tamblyn, Isaac
Machine Learning
Artificial Intelligence
68T01
I.2.0
Reinforcement learning (RL) has been shown to learn sophisticated control policies for complex tasks including games, robotics, heating and cooling systems and text generation. The action-perception cycle in RL, however, generally assumes that a measurement of the state of the environment is available at each time step without a cost. In applications such as materials design, deep-sea and planetary robot exploration and medicine, however, there can be a high cost associated with measuring, or even approximating, the state of the environment. In this paper, we survey the recently growing literature that adopts the perspective that an RL agent might not need, or even want, a costly measurement at each time step. Within this context, we propose the Deep Dynamic Multi-Step Observationless Agent (DMSOA), contrast it with the literature and empirically evaluate it on OpenAI gym and Atari Pong environments. Our results, show that DMSOA learns a better policy with fewer decision steps and measurements than the considered alternative from the literature.
title Dynamic Observation Policies in Observation Cost-Sensitive Reinforcement Learning
topic Machine Learning
Artificial Intelligence
68T01
I.2.0
url https://arxiv.org/abs/2307.02620