activity
20142026
most citedOne Explanation Does Not Fit All: A Toolkit and Taxonomy of AI Explainability Techniques

270 citations · 669 across the 40 of their papers we have counts for

collaborators
Showing cs.LGShow all

25 papers · 1 filter

cs.LG2025★ 2 cited

CoFrNets: Interpretable Neural Architecture Inspired by Continued Fractions

Isha Puri, Amit Dhurandhar, Tejaswini Pedapati +3

In recent years there has been a considerable amount of research on local post hoc explanations for neural networks. However, work on building interpretable neural architectures ha…

cs.LG2022★ 6 cited

On the Safety of Interpretable Machine Learning: A Maximum Deviation Approach

Dennis Wei, Rahul Nair, Amit Dhurandhar +3

Interpretable and explainable machine learning has seen a recent surge of interest. We focus on safety as a key motivation behind the surge and make the relationship between interp…

cs.LG2022★ 6 cited

Anomaly Attribution with Likelihood Compensation

Tsuyoshi Idé, Amit Dhurandhar, Jiří Navrátil +2

This paper addresses the task of explaining anomalous predictions of a black-box regression model. When using a black-box model, such as one to predict building energy consumption…

cs.LG2022★ 1 cited

Auto-Transfer: Learning to Route Transferrable Representations

Keerthiram Murugesan, Vijay Sadashivaiah, Ronny Luss +3

Knowledge transfer between heterogeneous source and target networks and tasks has received a lot of attention in recent times as large amounts of quality labeled data can be diffic…

cs.LG2022

Analogies and Feature Attributions for Model Agnostic Explanation of Similarity Learners

Karthikeyan Natesan Ramamurthy, Amit Dhurandhar, Dennis Wei +1

Post-hoc explanations for black box models have been studied extensively in classification and regression settings. However, explanations for models that output similarity between…

cs.LG2022

Local Explanations for Reinforcement Learning

Ronny Luss, Amit Dhurandhar, Miao Liu

Many works in explainable AI have focused on explaining black-box classification models. Explaining deep reinforcement learning (RL) policies in a manner that could be understood b…

cs.LG2022★ 2 cited

Locally Invariant Explanations: Towards Stable and Unidirectional Explanations through Local Invariant Learning

Amit Dhurandhar, Karthikeyan Ramamurthy, Kartik Ahuja +1

Locally interpretable model agnostic explanations (LIME) method is one of the most popular methods used to explain black-box models at a per example level. Although many variants h…

cs.LG2021★ 1 cited

AI Explainability 360: Impact and Design

Vijay Arya, Rachel K. E. Bellamy, Pin-Yu Chen +17

As artificial intelligence and machine learning algorithms become increasingly prevalent in society, multiple stakeholders are calling for these algorithms to provide explanations.…

cs.LG2021★ 1 cited

Multihop: Leveraging Complex Models to Learn Accurate Simple Models

Amit Dhurandhar, Tejaswini Pedapati

Knowledge transfer from a complex high performing model to a simpler and potentially low performing one in order to enhance its performance has been of great interest over the last…

cs.LG2021

When Stability meets Sufficiency: Informative Explanations that do not Overwhelm

Ronny Luss, Amit Dhurandhar

Recent studies evaluating various criteria for explainable artificial intelligence (XAI) suggest that fidelity, stability, and comprehensibility are among the most important metric…

cs.LG2021

Treatment Effect Estimation using Invariant Risk Minimization

Abhin Shah, Kartik Ahuja, Karthikeyan Shanmugam +3

Inferring causal individual treatment effect (ITE) from observational data is a challenging problem whose difficulty is exacerbated by the presence of treatment assignment bias. In…

cs.LG2020

Learning to Initialize Gradient Descent Using Gradient Descent

Kartik Ahuja, Amit Dhurandhar, Kush R. Varshney

Non-convex optimization problems are challenging to solve; the success and computational expense of a gradient descent algorithm or variant depend heavily on the initialization str…

cs.LG2020★ 4 cited

Linear Regression Games: Convergence Guarantees to Approximate Out-of-Distribution Solutions

Kartik Ahuja, Karthikeyan Shanmugam, Amit Dhurandhar

Recently, invariant risk minimization (IRM) (Arjovsky et al.) was proposed as a promising solution to address out-of-distribution (OOD) generalization. In Ahuja et al., it was show…

cs.LG2020★ 15 cited

Empirical or Invariant Risk Minimization? A Sample Complexity Perspective

Kartik Ahuja, Jun Wang, Amit Dhurandhar +2

Recently, invariant risk minimization (IRM) was proposed as a promising solution to address out-of-distribution (OOD) generalization. However, it is unclear when IRM should be pref…

cs.LG2020★ 31 cited

Invariant Risk Minimization Games

Kartik Ahuja, Karthikeyan Shanmugam, Kush R. Varshney +1

The standard risk minimization paradigm of machine learning is brittle when operating in environments whose test distributions are different from the training distribution due to s…

cs.LG2020★ 20 cited

Model Agnostic Multilevel Explanations

Karthikeyan Natesan Ramamurthy, Bhanukiran Vinzamuri, Yunfeng Zhang +1

In recent years, post-hoc local instance-level and global dataset-level explainability of black-box models has received a lot of attention. Much less attention has been given to ob…

cs.LG2020★ 9 cited

Learning Global Transparent Models Consistent with Local Contrastive Explanations

Tejaswini Pedapati, Avinash Balakrishnan, Karthikeyan Shanmugam +1

There is a rich and growing literature on producing local contrastive/counterfactual explanations for black-box models (e.g. neural networks). In these methods, for an input, an ex…

cs.LG2019★ 2 cited

Teaching AI to Explain its Decisions Using Embeddings and Multi-Task Learning

Noel C. F. Codella, Michael Hind, Karthikeyan Natesan Ramamurthy +5

Using machine learning in high-stakes applications often requires predictions to be accompanied by explanations comprehensible to the domain user, who has ultimate responsibility f…

cs.LG2019★ 29 cited

Model Agnostic Contrastive Explanations for Structured Data

Amit Dhurandhar, Tejaswini Pedapati, Avinash Balakrishnan +3

Recently, a method [7] was proposed to generate contrastive explanations for differentiable models such as deep neural networks, where one has complete access to the model. In this…

cs.LG2019★ 3 cited

Enhancing Simple Models by Exploiting What They Already Know

Amit Dhurandhar, Karthikeyan Shanmugam, Ronny Luss

There has been recent interest in improving performance of simple models for multiple reasons such as interpretability, robust learning from small data, deployment in memory constr…

cs.LG2019

Leveraging Latent Features for Local Explanations

Ronny Luss, Pin-Yu Chen, Amit Dhurandhar +4

As the application of deep neural networks proliferates in numerous areas such as medical imaging, video surveillance, and self driving cars, the need for explaining the decisions…

cs.LG2018★ 1 cited

Streaming Methods for Restricted Strongly Convex Functions with Applications to Prototype Selection

Karthik S. Gurumoorthy, Amit Dhurandhar

In this paper, we show that if the optimization function is restricted-strongly-convex (RSC) and restricted-smooth (RSM) -- a rich subclass of weakly submodular functions -- then a…

cs.LG2018★ 17 cited

Improving Simple Models with Confidence Profiles

Amit Dhurandhar, Karthikeyan Shanmugam, Ronny Luss +1

In this paper, we propose a new method called ProfWeight for transferring information from a pre-trained deep neural network that has a high test accuracy to a simpler interpretabl…

cs.LG2017★ 1 cited

Learning with Changing Features

Amit Dhurandhar, Steve Hanneke, Liu Yang

In this paper we study the setting where features are added or change interpretation over time, which has applications in multiple domains such as retail, manufacturing, finance. I…