← Search

Daniel J Mankowitz

14 accepted papers

2024

Nash Learning from Human Feedback

ICML 2024spotlight

Reinforcement learning from human feedback (RLHF) has emerged as the main paradigm for aligning large language models (LLMs) with human preferences. Traditionally, RLHF involves the initial step of learning a reward model from pairwise human feedback, i.e., expressed as preferences between pairs of…

Cited by 129SourcePDFScholar
2023

Transformers Meet Directed Graphs

ICML 2023poster

Transformers were originally proposed as a sequence-to-sequence model for text but have become vital for a wide range of modalities, including images, audio, video, and undirected graphs. However, transformers for directed graphs are a surprisingly underexplored topic, despite their applicability to…

2022

COptiDICE: Offline Constrained Reinforcement Learning via Stationary Distribution Correction Estimation

ICLR 2022spotlight

We consider the offline constrained reinforcement learning (RL) problem, in which the agent aims to compute a policy that maximizes expected return while satisfying given cost constraints, learning only from a pre-collected dataset. This problem setting is appealing in many real-world scenarios, whe…

2021

A Constrained Multi-Objective Reinforcement Learning Framework

CoRL 2021poster

Many real-world problems, especially in robotics, require that reinforcement learning (RL) agents learn policies that not only maximize an environment reward, but also satisfy constraints. We propose a high-level framework for solving such problems, that treats the environment reward and costs as se…

Cited by 34SourceScholar
2021

Active Offline Policy Selection

NeurIPS 2021poster

This paper addresses the problem of policy selection in domains with abundant logged data, but with a restricted interaction budget. Solving this problem would enable safe evaluation and deployment of offline reinforcement learning policies in industry, robotics, and recommendation domains among oth…

2021

Balancing Constraints and Rewards with Meta-Gradient D4PG

ICLR 2021poster

Deploying Reinforcement Learning (RL) agents to solve real-world applications often requires satisfying complex system constraints. Often the constraint thresholds are incorrectly set due to the complex nature of a system or the inability to verify the thresholds offline (e.g, no simulator or reason…

Cited by 26SourcePDFScholar
2021

Discovering a set of policies for the worst case reward

ICLR 2021spotlight

We study the problem of how to construct a set of policies that can be composed together to solve a collection of reinforcement learning tasks. Each task is a different reward function defined as a linear combination of known features. We consider a specific class of policy compositions which we ca…

Cited by 29SourcePDFScholar
2020

RL Unplugged: A Suite of Benchmarks for Offline Reinforcement Learning

NeurIPS 2020poster

Offline methods for reinforcement learning have a potential to help bridge the gap between reinforcement learning research and real-world applications. They make it possible to learn policies from offline datasets, thus overcoming concerns associated with online data collection in the real-world, in…

2020

Robust Reinforcement Learning for Continuous Control with Model Misspecification

ICLR 2020poster

We provide a framework for incorporating robustness -- to perturbations in the transition dynamics which we refer to as model misspecification -- into continuous control Reinforcement Learning (RL) algorithms. We specifically focus on incorporating robustness into a state-of-the-art continuous contr…

Cited by 135SourceScholar
2019

Universal Successor Features Approximators

ICLR 2019poster

The ability of a reinforcement learning (RL) agent to learn about many reward functions at the same time has many potential benefits, such as the decomposition of complex tasks into simpler ones, the exchange of information between tasks, and the reuse of skills. We focus on one aspect in particular…

Cited by 160SourcePDFScholar
2018

Learn What Not to Learn: Action Elimination with Deep Reinforcement Learning

NeurIPS 2018poster

Learning how to act when there are many available actions in each state is a challenging task for Reinforcement Learning (RL) agents, especially when many of the actions are redundant or irrelevant. In such cases, it is easier to learn which actions not to take. In this work, we propose the Action-E…

2017

Shallow Updates for Deep Reinforcement Learning

NeurIPS 2017poster

Deep reinforcement learning (DRL) methods such as the Deep Q-Network (DQN) have achieved state-of-the-art results in a variety of challenging, high-dimensional domains. This success is mainly attributed to the power of deep neural networks to learn rich domain representations for approximating the v…

Cited by 54SourcePDFScholar