← Search

Suryabhan Singh Hada

3 accepted papers

2023

Very Fast, Approximate Counterfactual Explanations for Decision Forests

AAAI 2023technical

We consider finding a counterfactual explanation for a classification or regression forest, such as a random forest. This requires solving an optimization problem to find the closest input instance to a given instance for which the forest outputs a desired value. Finding an exact solution has a cost…

Cited by 3SourcePDFScholar
2022

Interpretable Image Classification Using Sparse Oblique Decision Trees

ICASSP 2022accepted

Interpreting the image datasets is a difficult task, as each image contains a lot of irrelevant data. This paper presents a simple yet effective method to interpret the image datasets. We achieve this by using sparse oblique trees as a tool to select features from the dataset. These trees are not on…

Cited by 0SourceScholar
2021

Counterfactual Explanations for Oblique Decision Trees:Exact, Efficient Algorithms

AAAI 2021technical

We consider counterfactual explanations, the problem of minimally adjusting features in a source input instance so that it is classified as a target class under a given classifier. This has become a topic of recent interest as a way to query a trained model and suggest possible actions to overturn i…

Cited by 47SourcePDFScholar