Pith. sign in

REVIEW 2 cited by

Advantage Actor-Critic with Reasoner: Explaining the Agent's Behavior from an Exploratory Perspective

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 2309.04707 v1 pith:4EZT76WG submitted 2023-09-09 cs.AI cs.LG

classification cs.AIcs.LG
keywords a2crnetworkreasoneractor-criticadvantageagentdecision-makinginterpretable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Reinforcement learning (RL) is a powerful tool for solving complex decision-making problems, but its lack of transparency and interpretability has been a major challenge in domains where decisions have significant real-world consequences. In this paper, we propose a novel Advantage Actor-Critic with Reasoner (A2CR), which can be easily applied to Actor-Critic-based RL models and make them interpretable. A2CR consists of three interconnected networks: the Policy Network, the Value Network, and the Reasoner Network. By predefining and classifying the underlying purpose of the actor's actions, A2CR automatically generates a more comprehensive and interpretable paradigm for understanding the agent's decision-making process. It offers a range of functionalities such as purpose-based saliency, early failure detection, and model supervision, thereby promoting responsible and trustworthy RL. Evaluations conducted in action-rich Super Mario Bros environments yield intriguing findings: Reasoner-predicted label proportions decrease for ``Breakout" and increase for ``Hovering" as the exploration level of the RL algorithm intensifies. Additionally, purpose-based saliencies are more focused and comprehensible.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Tail-Risk-Safe Monte Carlo Tree Search under PAC-Level Guarantees

    cs.LG 2025-08 unverdicted novelty 5.0 of 10

    Two new Monte Carlo tree search algorithms, CVaR-MCTS and W-MCTS, give provable PAC-level tail-risk controls and regret bounds for worst-case outcome scenarios.

  2. Perception Graph for Cognitive Attack Reasoning in Augmented Reality

    cs.AI 2025-08 reject novelty 3.0 of 10

    The Perception Graph paper proposes detecting cognitive attacks in AR by measuring cosine distance between vision-language descriptions of scenes, demonstrated on three attacks in one scene.

Pith tools