Pith. sign in

REVIEW 1 cited by

Learning Decision Trees Recurrently Through Communication

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 1902.01780 v3 pith:TLTFCKSU submitted 2019-02-05 cs.LG cs.AI

classification cs.LGcs.AI
keywords decisionbinarymodelaccuracyimagemakingnetworksemantic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Integrated interpretability without sacrificing the prediction accuracy of decision making algorithms has the potential of greatly improving their value to the user. Instead of assigning a label to an image directly, we propose to learn iterative binary sub-decisions, inducing sparsity and transparency in the decision making process. The key aspect of our model is its ability to build a decision tree whose structure is encoded into the memory representation of a Recurrent Neural Network jointly learned by two models communicating through message passing. In addition, our model assigns a semantic meaning to each decision in the form of binary attributes, providing concise, semantic and relevant rationalizations to the user. On three benchmark image classification datasets, including the large-scale ImageNet, our model generates human interpretable binary decision sequences explaining the predictions of the network while maintaining state-of-the-art accuracy.

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. Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory

    cs.LG 2025-02 conditional novelty 6.0 of 10

    ReMeDe Trees are hard, axis-aligned decision trees with a learned internal memory, trained by backpropagation through time, achieving perfect accuracy on synthetic delayed-sign and sign-memory tasks.

Pith tools