We present a novel interactive learning protocol that enables training request-fulfilling agents by verbally describing their activities. Our protocol gives rise to a new family of interactive learning algorithms that offer complementary advantages against traditional algorithms like imitation learning (IL) and reinforcement learning (RL)  . We develop  an algorithm that practically implements this protocoland employ it to train agents in two challenging request-fulfilling problems using purely language-description feedback. Empirical results demonstrate the strengths of our algorithm: compared to RL baselines, it is more sample-efficient; compared to IL baselines, it achieves competitive success rates while not requiring feedback providers to have agent-specific expertise. We also provide theoretical guarantees of the algorithm under certain assumptions on the teacher and the environment.
We present a novel interactive learning protocol that enables training request-fulfilling agents by verbally describing their activities. Unlike imitation learning (IL) , our protocol allows the teaching agent to provide feedback in a language that is most appropriate for them. Compared with reward in reinforcement learning (RL) , the description feedback is richer and allows for improved sample complexity . We develop a probabilistic framework and an algorithm that practically implements our protocol. Empirical results in two challenging request-fulfilling problems demonstrate the strengths of our approach: compared with RL baselines, it is more sample-efficient; compared with IL baselines, it achieves competitive success rates without requiring the teaching agent to be able to demonstrate the desired behavior using the learning agent's actions. Apart from empirical evaluation, we also provide theoretical guarantees for our algorithm under certain assumptions about the teacher and the environment.
R
Our protocol gives rise to a new family of interactive learning algorithms that offer complementary advantages against traditional algorithms like
Unlike
R
and
, our protocol allows the teaching agent to provide feedback in a language that is most appropriate for them. Compared with reward in
A
, the description feedback is richer and allows for improved sample complexity
A
a probabilistic framework and
R
this protocoland employ it to train agents
our protocol. Empirical results
D
using purely language-description feedback. Empirical results
R
algorithm: compared to
approach: compared with
R
to
with
R
while not requiring feedback providers to have agent-specific expertise. We
without requiring the teaching agent to be able to demonstrate the desired behavior using the learning agent's actions. Apart from empirical evaluation, we
R
of the
for our
R
on
about