Pith. sign in

REVIEW 1 cited by

Learning Hierarchical Teaching Policies for Cooperative Agents

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1903.03216 v6 pith:OV555GOF submitted 2019-03-07 cs.LG cs.AIcs.MA

Learning Hierarchical Teaching Policies for Cooperative Agents

classification cs.LG cs.AIcs.MA
keywords learningadvisingpoliciesteachingactionagentscomplexhmat
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Collective learning can be greatly enhanced when agents effectively exchange knowledge with their peers. In particular, recent work studying agents that learn to teach other teammates has demonstrated that action advising accelerates team-wide learning. However, the prior work has simplified the learning of advising policies by using simple function approximations and only considered advising with primitive (low-level) actions, limiting the scalability of learning and teaching to complex domains. This paper introduces a novel learning-to-teach framework, called hierarchical multiagent teaching (HMAT), that improves scalability to complex environments by using the deep representation for student policies and by advising with more expressive extended action sequences over multiple levels of temporal abstraction. Our empirical evaluations demonstrate that HMAT improves team-wide learning progress in large, complex domains where previous approaches fail. HMAT also learns teaching policies that can effectively transfer knowledge to different teammates with knowledge of different tasks, even when the teammates have heterogeneous action spaces.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. CCKS: Consensus-based Communication and Knowledge Sharing

    cs.MA 2026-06 unverdicted novelty 6.0

    CCKS adds consensus constraints built by contrastive learning on local observations to action-advising in DTDE MARL, yielding faster learning and higher performance on football and StarCraft benchmarks.