paper-with-me

Papers

Batch Active Preference-Based Learning of Reward Functions

2018-10-10 · Erdem Biyik, Dorsa Sadigh

Data generation and labeling are usually an expensive part of learning for robotics. While active learning methods are commonly used to tackle the former problem, preference-based learning is a concept that attempts to solve the latter by querying users with preference questions. In this paper, we will develop a new algorithm, batch active preference-based learning, that enables efficient learning of reward functions using as few data samples as possible while still having short query generation times. We introduce several approximations to the batch active learning problem, and provide theoretical guarantees for the convergence of our algorithms. Finally, we present our experimental results for a variety of robotics tasks in simulation. Our results suggest that our batch active learning algorithm requires only a few queries that are computed in a short amount of time. We then showcase our algorithm in a study to learn human users' preferences.

📄 PDF Abstract BibTeX arXiv:1810.04303

Code (1)

Stanford-ILIAD/batch-active-preference-based-learning 공식 구현

Tasks

Active Learning

Similar Papers 제목 키워드 기반

Batch Active Learning of Reward Functions from Human Preferences

2024-02-24 · Erdem Biyik, Nima Anari, Dorsa Sadigh

Data generation and labeling are often expensive in robot learning. Preference-based learning is a concept that enables reliable labeling by querying users with preference questions. Active querying methods are commonly …

Active LearningPoint Processes

Batch Reinforcement Learning from Crowds

2021-11-08 · Guoxi Zhang, Hisashi Kashima

A shortcoming of batch reinforcement learning is its requirement for rewards in data, thus not applicable to tasks without reward functions. Existing settings for lack of reward, such as behavioral cloning, rely on optim…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Active Preference-Based Gaussian Process Regression for Reward Learning

2020-05-06 · Erdem Biyik, Nicolas Huynh, Mykel J. Kochenderfer, Dorsa Sadigh

Designing reward functions is a challenging problem in AI and robotics. Humans usually have a difficult time directly specifying all the desirable behaviors that a robot needs to optimize. One common approach is to learn…

regression

Learning Reward Functions from Diverse Sources of Human Feedback: Optimally Integrating Demonstrations and Preferences

2020-06-24 · Erdem Biyik, Dylan P. Losey, Malayandi Palan, Nicholas C. Landolfi 외

Reward functions are a common way to specify the objective of a robot. As designing reward functions can be extremely challenging, a more promising approach is to directly learn reward functions from human teachers. Impo…

Risk-averse Batch Active Inverse Reward Design

2023-11-20 · Panagiotis Liampas

Designing a perfect reward function that depicts all the aspects of the intended behavior is almost impossible, especially generalizing it outside of the training environments. Active Inverse Reward Design (AIRD) propose…