mlsanityData to 7 Oct 2026

Reinforcement Learning from Hierarchical Critics

arXiv 1902.03079 ↗First posted 8 Feb 2019cs.LG cs.MA stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

In this study, we investigate the use of global information to speed up the learning process and increase the cumulative rewards of reinforcement learning (RL) in competition tasks. Within the actor-critic RL, we introduce multiple cooperative critics from two levels of the hierarchy and propose a reinforcement learning from hierarchical critics (RLHC) algorithm. In our approach, each agent receives value information from local and global critics regarding a competition task and accesses multiple cooperative critics in a top-down hierarchy. Thus, each agent not only receives low-level details but also considers coordination from higher levels, thereby obtaining global information to improve the training performance. Then, we test the proposed RLHC algorithm against the benchmark algorithm, proximal policy optimisation (PPO), for two experimental scenarios performed in a Unity environment consisting of tennis and soccer agents' competitions. The results showed that RLHC outperforms the benchmark on both competition tasks.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 8 Feb 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 2.

3 papers.