Pith. sign in

REVIEW 1 cited by

Toward Interpretable Deep Reinforcement Learning with Linear Model U-Trees

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 1807.05887 v1 pith:5DOJVOWX submitted 2018-07-16 cs.LG stat.ML

classification cs.LGstat.ML
keywords networkneuralfunctionknowledgelearninglmutdeeplearned
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Deep Reinforcement Learning (DRL) has achieved impressive success in many applications. A key component of many DRL models is a neural network representing a Q function, to estimate the expected cumulative reward following a state-action pair. The Q function neural network contains a lot of implicit knowledge about the RL problems, but often remains unexamined and uninterpreted. To our knowledge, this work develops the first mimic learning framework for Q functions in DRL. We introduce Linear Model U-trees (LMUTs) to approximate neural network predictions. An LMUT is learned using a novel on-line algorithm that is well-suited for an active play setting, where the mimic learner observes an ongoing interaction between the neural net and the environment. Empirical evaluation shows that an LMUT mimics a Q function substantially better than five baseline methods. The transparent tree structure of an LMUT facilitates understanding the network's learned knowledge by analyzing feature influence, extracting rules, and highlighting the super-pixels in image inputs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. "So, Tell Me About Your Policy...": Distillation of interpretable policies from Deep Reinforcement Learning agents

    cs.LG 2025-07 conditional novelty 5.0 of 10

    EXPLAIN trains an interpretable linear policy from an expert's offline trajectories by combining advantage-weighted policy gradients with a behavioral cloning regularizer.

Pith tools