← Search

Gerald Tesauro

9 accepted papers

2022

Context-Specific Representation Abstraction for Deep Option Learning

AAAI 2022technical

Hierarchical reinforcement learning has focused on discovering temporally extended actions, such as options, that can provide benefits in problems requiring extensive exploration. One promising approach that learns these options end-to-end is the option-critic (OC) framework. We examine and show in…

2022

Influencing Long-Term Behavior in Multiagent Reinforcement Learning

NeurIPS 2022accept

The main challenge of multiagent reinforcement learning is the difficulty of learning useful policies in the presence of other simultaneously learning agents whose changing behaviors jointly affect the environment's transition and reward dynamics. An effective approach that has recently emerged for…

2021

A Policy Gradient Algorithm for Learning to Learn in Multiagent Reinforcement Learning

ICML 2021spotlight

A fundamental challenge in multiagent reinforcement learning is to learn beneficial behaviors in a shared environment with other simultaneously learning agents. In particular, each agent perceives the environment as effectively non-stationary due to the changing policies of other agents. Moreover, e…

2021

Efficient Black-Box Planning Using Macro-Actions with Focused Effects

IJCAI 2021poster

The difficulty of deterministic planning increases exponentially with search-tree depth. Black-box planning presents an even greater challenge, since planners must operate without an explicit model of the domain. Heuristics can make search more efficient, but goal-aware heuristics for black-box plan…

2021

Text-based RL Agents with Commonsense Knowledge: New Challenges, Environments and Baselines

AAAI 2021technical

Text-based games have emerged as an important test-bed for Reinforcement Learning (RL) research, requiring RL agents to combine grounded language understanding with sequential decision making. In this paper, we examine the problem of infusing RL agents with commonsense knowledge. Such knowledge woul…

2020

Decentralized TD Tracking with Linear Function Approximation and its Finite-Time Analysis

NeurIPS 2020poster

The present contribution deals with decentralized policy evaluation in multi-agent Markov decision processes using temporal-difference (TD) methods with linear function approximation for scalability. The agents cooperate to estimate the value function of such a process by observing continual state t…

Cited by 40SourcePDFScholar
2018

Dialog-based Interactive Image Retrieval

NeurIPS 2018poster

Existing methods for interactive image retrieval have demonstrated the merit of integrating user feedback, improving retrieval results. However, most current systems rely on restricted forms of user feedback, such as binary relevance responses, or feedback based on a fixed set of relative attributes…

2018

Eigenoption Discovery through the Deep Successor Representation

ICLR 2018poster

Options in reinforcement learning allow agents to hierarchically decompose a task into subtasks, having the potential to speed up learning and planning. However, autonomously learning effective sets of options is still a major challenge in the field. In this paper we focus on the recently introduced…

Cited by 194SourcePDFScholar
2018

Evidence Aggregation for Answer Re-Ranking in Open-Domain Question Answering

ICLR 2018poster

Very recently, it comes to be a popular approach for answering open-domain questions by first searching question-related passages, then applying reading comprehension models to extract answers. Existing works usually extract answers from single passages independently, thus not fully make use of the…