activity
20152026
most citedDeep Recurrent Q-Learning for Partially Observable MDPs

687 citations · 1.4k across the 25 of their papers we have counts for

collaborators
Showing cs.LGShow all

12 papers · 1 filter

cs.LG2022★ 2 cited

UniMASK: Unified Inference in Sequential Decision Problems

Micah Carroll, Orr Paradise, Jessy Lin +8

Randomly masking and predicting word tokens has been a successful approach in pre-training language models for a variety of downstream tasks. In this work, we observe that the same…

cs.LG2022★ 1 cited

Towards Flexible Inference in Sequential Decision Problems via Bidirectional Transformers

Micah Carroll, Jessy Lin, Orr Paradise +8

Randomly masking and predicting word tokens has been a successful approach in pre-training language models for a variety of downstream tasks. In this work, we observe that the same…

cs.LG2022★ 2 cited

Consistent Dropout for Policy Gradient Reinforcement Learning

Matthew Hausknecht, Nolan Wagener

Dropout has long been a staple of supervised learning, but is rarely used in reinforcement learning. We analyze why naive application of dropout is problematic for policy-gradient…

cs.LG2021★ 7 cited

Measuring Sample Efficiency and Generalization in Reinforcement Learning Benchmarks: NeurIPS 2020 Procgen Benchmark

Sharada Mohanty, Jyotish Poonganam, Adrien Gaidon +20

The NeurIPS 2020 Procgen Competition was designed as a centralized benchmark with clearly defined tasks for measuring Sample Efficiency and Generalization in Reinforcement Learning…

cs.LG2020★ 36 cited

Graph Constrained Reinforcement Learning for Natural Language Action Spaces

Prithviraj Ammanabrolu, Matthew Hausknecht

Interactive Fiction games are text-based simulations in which an agent interacts with the world purely through natural language. They are ideal environments for studying how to ext…

cs.LG2019★ 1 cited

Working Memory Graphs

Ricky Loynd, Roland Fernandez, Asli Celikyilmaz +2

Transformers have increasingly outperformed gated RNNs in obtaining new state-of-the-art results on supervised tasks involving text sequences. Inspired by this trend, we study the…

cs.LG2019★ 1 cited

Learning Calibratable Policies using Programmatic Style-Consistency

Eric Zhan, Albert Tseng, Yisong Yue +2

We study the problem of controllable generation of long-term sequential behaviors, where the goal is to calibrate to multiple behavior styles simultaneously. In contrast to the wel…

cs.LG2019

Multi-Preference Actor Critic

Ishan Durugkar, Matthew Hausknecht, Adith Swaminathan +1

Policy gradient algorithms typically combine discounted future rewards with an estimated value function, to compute the direction and magnitude of parameter updates. However, for m…

cs.LG2018★ 93 cited

TextWorld: A Learning Environment for Text-based Games

Marc-Alexandre Côté, Ákos Kádár, Xingdi Yuan +10

We introduce TextWorld, a sandbox learning environment for the training and evaluation of RL agents on text-based games. TextWorld is a Python library that handles interactive play…

cs.LG2018★ 43 cited

Leveraging Grammar and Reinforcement Learning for Neural Program Synthesis

Rudy Bunel, Matthew Hausknecht, Jacob Devlin +2

Program synthesis is the task of automatically generating a program consistent with a specification. Recent years have seen proposal of a number of neural approaches for program sy…

cs.LG2017

Revisiting the Arcade Learning Environment: Evaluation Protocols and Open Problems for General Agents

Marlos C. Machado, Marc G. Bellemare, Erik Talvitie +3

The Arcade Learning Environment (ALE) is an evaluation platform that poses the challenge of building AI agents with general competency across dozens of Atari 2600 games. It support…

cs.LG2015★ 687 cited

Deep Recurrent Q-Learning for Partially Observable MDPs

Matthew Hausknecht, Peter Stone

Deep Reinforcement Learning has yielded proficient controllers for complex tasks. However, these controllers have limited memory and rely on being able to perceive the complete gam…