Pith. sign in

REVIEW 3 cited by

Adversarially Guided Actor-Critic

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 2102.04376 v1 pith:MMWBSR7X submitted 2021-02-08 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords actoractor-criticadversarytasksadversariallyagacexplorationguided
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Despite definite success in deep reinforcement learning problems, actor-critic algorithms are still confronted with sample inefficiency in complex environments, particularly in tasks where efficient exploration is a bottleneck. These methods consider a policy (the actor) and a value function (the critic) whose respective losses are built using different motivations and approaches. This paper introduces a third protagonist: the adversary. While the adversary mimics the actor by minimizing the KL-divergence between their respective action distributions, the actor, in addition to learning to solve the task, tries to differentiate itself from the adversary predictions. This novel objective stimulates the actor to follow strategies that could not have been correctly predicted from previous trajectories, making its behavior innovative in tasks where the reward is extremely rare. Our experimental analysis shows that the resulting Adversarially Guided Actor-Critic (AGAC) algorithm leads to more exhaustive exploration. Notably, AGAC outperforms current state-of-the-art methods on a set of various hard-exploration and procedurally-generated tasks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Episodic Novelty Through Temporal Distance

    cs.LG 2025-01 conditional novelty 6.0 of 10

    An episodic intrinsic reward based on a contrastively learned temporal distance quasimetric improves exploration in sparse-reward Contextual MDPs.

  2. The impact of intrinsic rewards on exploration in Reinforcement Learning

    cs.AI 2025-01 conditional novelty 5.0 of 10

    An empirical MiniGrid study shows state-counting is best for low-dimensional observations, maximum entropy is more robust with images, and DIAYN skill learning does not aid exploration.

  3. CSAOT: Cooperative Multi-Agent System for Active Object Tracking

    cs.CV 2025-01 reject novelty 4.0 of 10

    A role-based multi-agent reinforcement learning system with mixture-of-expert policies improves simulated active object tracking episode length over a single-agent baseline, though only modestly and without ablation or code.

Pith tools