Indecision Trees: Learning Argument-Based Reasoning under Quantified Uncertainty
Jonathan S. Kent, David H. Menager

TL;DR
Indecision Trees are an extension of decision trees that handle uncertainty, produce probabilistic outputs, and generate logical arguments for reasoning systems, addressing real-world machine learning challenges.
Contribution
This paper introduces Indecision Trees, a novel decision tree variant that learns and infers under uncertainty while providing interpretable argument-based reasoning.
Findings
Supports inference under uncertainty
Provides a distribution over labels
Can be integrated into reasoning systems
Abstract
Using Machine Learning systems in the real world can often be problematic, with inexplicable black-box models, the assumed certainty of imperfect measurements, or providing a single classification instead of a probability distribution. This paper introduces Indecision Trees, a modification to Decision Trees which learn under uncertainty, can perform inference under uncertainty, provide a robust distribution over the possible labels, and can be disassembled into a set of logical arguments for use in other reasoning systems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsExplainable Artificial Intelligence (XAI) · Bayesian Modeling and Causal Inference · Statistical and Computational Modeling
