paper-with-me

홈 › Papers

A Reduction from Apprenticeship Learning to Classification

2010-12-01 · NeurIPS 2010 12 · Umar Syed, Robert E. Schapire

We provide new theoretical results for apprenticeship learning, a variant of reinforcement learning in which the true reward function is unknown, and the goal is to perform well relative to an observed expert. We study a common approach to learning from expert demonstrations: using a classification algorithm to learn to imitate the expert's behavior. Although this straightforward learning strategy is widely-used in practice, it has been subject to very little formal analysis. We prove that, if the learned classifier has error rate $\eps$, the difference between the value of the apprentice's policy and the expert's policy is $O(\sqrt{\eps})$. Further, we prove that this difference is only $O(\eps)$ when the expert's policy is close to optimal. This latter result has an important practical consequence: Not only does imitating a near-optimal expert result in a better policy, but far fewer demonstrations are required to successfully imitate such an expert. This suggests an opportunity for substantial savings whenever the expert is known to be good, but demonstrations are expensive or difficult to obtain.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

ClassificationGeneral ClassificationReinforcement Learning

Similar Papers 제목 키워드 기반

Blending Autonomous Exploration and Apprenticeship Learning

2011-12-01 · NeurIPS 2011 12 · Thomas J. Walsh, Daniel K. Hewlett, Clayton T. Morrison

We present theoretical and empirical results for a framework that combines the benefits of apprenticeship and autonomous reinforcement learning. Our approach modifies an existing apprenticeship learning framework that …

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Interpretable and Personalized Apprenticeship Scheduling: Learning Interpretable Scheduling Policies from Heterogeneous User Demonstrations

2019-06-14 · NeurIPS 2020 12 · Rohan Paleja, Andrew Silva, Letian Chen, Matthew Gombolay

Resource scheduling and coordination is an NP-hard optimization requiring an efficient allocation of agents to a set of tasks with upper- and lower bound temporal and resource constraints. Due to the large-scale and dyna…

Decision MakingScheduling

Unknown mixing times in apprenticeship and reinforcement learning

2019-05-23 · Tom Zahavy, Alon Cohen, Haim Kaplan, Yishay Mansour

We derive and analyze learning algorithms for apprenticeship learning, policy evaluation, and policy gradient for average reward criteria. Existing algorithms explicitly require an upper bound on the mixing time. In cont…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Sequence-based Multimodal Apprenticeship Learning For Robot Perception and Decision Making

2017-02-24 · Fei Han, Xue Yang, Yu Zhang, Hao Zhang

Apprenticeship learning has recently attracted a wide attention due to its capability of allowing robots to learn physical tasks directly from demonstrations provided by human experts. Most previous techniques assumed th…

Decision Making

Cross apprenticeship learning framework: Properties and solution approaches

2022-09-06 · Ashwin Aravind, Debasish Chatterjee, Ashish Cherukuri

Apprenticeship learning is a framework in which an agent learns a policy to perform a given task in an environment using example trajectories provided by an expert. In the real world, one might have access to expert traj…