1 citations · 1 across the 1 of their papers we have counts for
4 papers
Counterfactual Explanations for Oblique Decision Trees: Exact, Efficient Algorithms
Miguel Á. Carreira-Perpiñán, Suryabhan Singh Hada
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.…
An Experimental Comparison of Old and New Decision Tree Algorithms
Arman Zharmagambetov, Suryabhan Singh Hada, Miguel Á. Carreira-Perpiñán +1
This paper presents a detailed comparison of a recently proposed algorithm for optimizing decision trees, tree alternating optimization (TAO), with other popular, established algor…
Sampling the "Inverse Set" of a Neuron: An Approach to Understanding Neural Nets
Suryabhan Singh Hada, Miguel Á. Carreira-Perpiñán
With the recent success of deep neural networks in computer vision, it is important to understand the internal working of these networks. What does a given neuron represent? The co…
Style Transfer by Rigid Alignment in Neural Net Feature Space
Suryabhan Singh Hada, Miguel Á. Carreira-Perpiñán
Arbitrary style transfer is an important problem in computer vision that aims to transfer style patterns from an arbitrary style image to a given content image. However, current me…