paper-with-me

Papers

Interactive Teaching Algorithms for Inverse Reinforcement Learning

2019-05-28 · Parameswaran Kamalaruban, Rati Devidze, Volkan Cevher, Adish Singla

We study the problem of inverse reinforcement learning (IRL) with the added twist that the learner is assisted by a helpful teacher. More formally, we tackle the following algorithmic question: How could a teacher provide an informative sequence of demonstrations to an IRL learner to speed up the learning process? We present an interactive teaching framework where a teacher adaptively chooses the next demonstration based on learner's current policy. In particular, we design teaching algorithms for two concrete settings: an omniscient setting where a teacher has full knowledge about the learner's dynamics and a blackbox setting where the teacher has minimal knowledge. Then, we study a sequential variant of the popular MCE-IRL learner and prove convergence guarantees of our teaching algorithm in the omniscient setting. Extensive experiments with a car driving simulator environment show that the learning progress can be speeded up drastically as compared to an uninformative teacher.

📄 PDF Abstract BibTeX arXiv:1905.11867

Code (0)

등록된 구현이 없습니다.

Tasks

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

Interactively Teaching an Inverse Reinforcement Learner with Limited Feedback

2023-09-16 · Rustam Zayanov, Francisco S. Melo, Manuel Lopes

We study the problem of teaching via demonstrations in sequential decision-making tasks. In particular, we focus on the situation when the teacher has no access to the learner's model and policy, and the feedback from th…

Active LearningDecision MakingSequential Decision Making

Learner-aware Teaching: Inverse Reinforcement Learning with Preferences and Constraints

2019-06-02 · NeurIPS 2019 12 · Sebastian Tschiatschek, Ahana Ghosh, Luis Haug, Rati Devidze 외

Inverse reinforcement learning (IRL) enables an agent to learn complex behavior by observing demonstrations from a (near-)optimal policy. The typical assumption is that the learner's goal is to match the teacher's demons…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Teaching Inverse Reinforcement Learners via Features and Demonstrations

2018-10-21 · NeurIPS 2018 12 · Luis Haug, Sebastian Tschiatschek, Adish Singla

Learning near-optimal behaviour from an expert's demonstrations typically relies on the assumption that the learner knows the features that the true reward function depends on. In this paper, we study the problem of lear…

Reinforcement Learning

Showing versus doing: Teaching by demonstration

2016-12-01 · NeurIPS 2016 12 · Mark K. Ho, Michael Littman, James Macglashan, Fiery Cushman 외

People often learn from others' demonstrations, and classic inverse reinforcement learning (IRL) algorithms have brought us closer to realizing this capacity in machines. In contrast, teaching by demonstration has been l…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Machine Teaching for Inverse Reinforcement Learning: Algorithms and Applications

2018-05-20 · Daniel S. Brown, Scott Niekum

Inverse reinforcement learning (IRL) infers a reward function from demonstrations, allowing for policy improvement and generalization. However, despite much recent interest in IRL, little work has been done to understand…

Decision Makingreinforcement-learningReinforcement LearningReinforcement Learning (RL)+1