Get our free extension to see links to code for papers anywhere online!

Chrome logo Add to Chrome

Firefox logo Add to Firefox
Picture for Himabindu Lakkaraju

Himabindu Lakkaraju

Feature Attributions and Counterfactual Explanations Can Be Manipulated


Jun 25, 2021
Dylan Slack, Sophie Hilgard, Sameer Singh, Himabindu Lakkaraju

Figure 1 for Feature Attributions and Counterfactual Explanations Can Be Manipulated
Figure 2 for Feature Attributions and Counterfactual Explanations Can Be Manipulated
Figure 3 for Feature Attributions and Counterfactual Explanations Can Be Manipulated
Figure 4 for Feature Attributions and Counterfactual Explanations Can Be Manipulated
* arXiv admin note: text overlap with arXiv:2106.02666 
  Access Paper or Ask Questions

What will it take to generate fairness-preserving explanations?


Jun 24, 2021
Jessica Dai, Sohini Upadhyay, Stephen H. Bach, Himabindu Lakkaraju

Figure 1 for What will it take to generate fairness-preserving explanations?
Figure 2 for What will it take to generate fairness-preserving explanations?
* Presented at ICML 2021 Workshop on Theoretic Foundation, Criticism, and Application Trend of Explainable AI 
  Access Paper or Ask Questions

On the Connections between Counterfactual Explanations and Adversarial Examples


Jun 18, 2021
Martin Pawelczyk, Shalmali Joshi, Chirag Agarwal, Sohini Upadhyay, Himabindu Lakkaraju

Figure 1 for On the Connections between Counterfactual Explanations and Adversarial Examples
Figure 2 for On the Connections between Counterfactual Explanations and Adversarial Examples
Figure 3 for On the Connections between Counterfactual Explanations and Adversarial Examples
Figure 4 for On the Connections between Counterfactual Explanations and Adversarial Examples

  Access Paper or Ask Questions

Towards a Rigorous Theoretical Analysis and Evaluation of GNN Explanations


Jun 16, 2021
Chirag Agarwal, Marinka Zitnik, Himabindu Lakkaraju

Figure 1 for Towards a Rigorous Theoretical Analysis and Evaluation of GNN Explanations
Figure 2 for Towards a Rigorous Theoretical Analysis and Evaluation of GNN Explanations
Figure 3 for Towards a Rigorous Theoretical Analysis and Evaluation of GNN Explanations
Figure 4 for Towards a Rigorous Theoretical Analysis and Evaluation of GNN Explanations

  Access Paper or Ask Questions

Counterfactual Explanations Can Be Manipulated


Jun 04, 2021
Dylan Slack, Sophie Hilgard, Himabindu Lakkaraju, Sameer Singh

Figure 1 for Counterfactual Explanations Can Be Manipulated
Figure 2 for Counterfactual Explanations Can Be Manipulated
Figure 3 for Counterfactual Explanations Can Be Manipulated
Figure 4 for Counterfactual Explanations Can Be Manipulated

  Access Paper or Ask Questions

Learning Under Adversarial and Interventional Shifts


Mar 29, 2021
Harvineet Singh, Shalmali Joshi, Finale Doshi-Velez, Himabindu Lakkaraju

Figure 1 for Learning Under Adversarial and Interventional Shifts
Figure 2 for Learning Under Adversarial and Interventional Shifts
Figure 3 for Learning Under Adversarial and Interventional Shifts
Figure 4 for Learning Under Adversarial and Interventional Shifts
* 19 pages including 5 pages appendix, 6 figures, 2 tables. Preliminary version presented at Causal Discovery & Causality-Inspired Machine Learning Workshop 2020 
  Access Paper or Ask Questions

Towards a Unified Framework for Fair and Stable Graph Representation Learning


Mar 01, 2021
Chirag Agarwal, Himabindu Lakkaraju, Marinka Zitnik

Figure 1 for Towards a Unified Framework for Fair and Stable Graph Representation Learning
Figure 2 for Towards a Unified Framework for Fair and Stable Graph Representation Learning
Figure 3 for Towards a Unified Framework for Fair and Stable Graph Representation Learning
Figure 4 for Towards a Unified Framework for Fair and Stable Graph Representation Learning

  Access Paper or Ask Questions

Towards Robust and Reliable Algorithmic Recourse


Feb 26, 2021
Sohini Upadhyay, Shalmali Joshi, Himabindu Lakkaraju

Figure 1 for Towards Robust and Reliable Algorithmic Recourse
Figure 2 for Towards Robust and Reliable Algorithmic Recourse
Figure 3 for Towards Robust and Reliable Algorithmic Recourse
Figure 4 for Towards Robust and Reliable Algorithmic Recourse

  Access Paper or Ask Questions

Towards the Unification and Robustness of Perturbation and Gradient Based Explanations


Feb 21, 2021
Sushant Agarwal, Shahin Jabbari, Chirag Agarwal, Sohini Upadhyay, Zhiwei Steven Wu, Himabindu Lakkaraju

Figure 1 for Towards the Unification and Robustness of Perturbation and Gradient Based Explanations
Figure 2 for Towards the Unification and Robustness of Perturbation and Gradient Based Explanations
Figure 3 for Towards the Unification and Robustness of Perturbation and Gradient Based Explanations
Figure 4 for Towards the Unification and Robustness of Perturbation and Gradient Based Explanations

  Access Paper or Ask Questions

Can I Still Trust You?: Understanding the Impact of Distribution Shifts on Algorithmic Recourses


Dec 22, 2020
Kaivalya Rawal, Ece Kamar, Himabindu Lakkaraju

Figure 1 for Can I Still Trust You?: Understanding the Impact of Distribution Shifts on Algorithmic Recourses
Figure 2 for Can I Still Trust You?: Understanding the Impact of Distribution Shifts on Algorithmic Recourses
Figure 3 for Can I Still Trust You?: Understanding the Impact of Distribution Shifts on Algorithmic Recourses
Figure 4 for Can I Still Trust You?: Understanding the Impact of Distribution Shifts on Algorithmic Recourses

  Access Paper or Ask Questions

Does Fair Ranking Improve Minority Outcomes? Understanding the Interplay of Human and Algorithmic Biases in Online Hiring


Dec 01, 2020
Tom Sühr, Sophie Hilgard, Himabindu Lakkaraju

Figure 1 for Does Fair Ranking Improve Minority Outcomes? Understanding the Interplay of Human and Algorithmic Biases in Online Hiring
Figure 2 for Does Fair Ranking Improve Minority Outcomes? Understanding the Interplay of Human and Algorithmic Biases in Online Hiring
Figure 3 for Does Fair Ranking Improve Minority Outcomes? Understanding the Interplay of Human and Algorithmic Biases in Online Hiring
Figure 4 for Does Fair Ranking Improve Minority Outcomes? Understanding the Interplay of Human and Algorithmic Biases in Online Hiring

  Access Paper or Ask Questions

When Does Uncertainty Matter?: Understanding the Impact of Predictive Uncertainty in ML Assisted Decision Making


Nov 13, 2020
Sean McGrath, Parth Mehta, Alexandra Zytek, Isaac Lage, Himabindu Lakkaraju

Figure 1 for When Does Uncertainty Matter?: Understanding the Impact of Predictive Uncertainty in ML Assisted Decision Making
Figure 2 for When Does Uncertainty Matter?: Understanding the Impact of Predictive Uncertainty in ML Assisted Decision Making
Figure 3 for When Does Uncertainty Matter?: Understanding the Impact of Predictive Uncertainty in ML Assisted Decision Making
Figure 4 for When Does Uncertainty Matter?: Understanding the Impact of Predictive Uncertainty in ML Assisted Decision Making

  Access Paper or Ask Questions

Robust and Stable Black Box Explanations


Nov 12, 2020
Himabindu Lakkaraju, Nino Arsov, Osbert Bastani

Figure 1 for Robust and Stable Black Box Explanations
Figure 2 for Robust and Stable Black Box Explanations
Figure 3 for Robust and Stable Black Box Explanations

  Access Paper or Ask Questions

Ensuring Actionable Recourse via Adversarial Training


Nov 12, 2020
Alexis Ross, Himabindu Lakkaraju, Osbert Bastani

Figure 1 for Ensuring Actionable Recourse via Adversarial Training
Figure 2 for Ensuring Actionable Recourse via Adversarial Training
Figure 3 for Ensuring Actionable Recourse via Adversarial Training
Figure 4 for Ensuring Actionable Recourse via Adversarial Training

  Access Paper or Ask Questions

Incorporating Interpretable Output Constraints in Bayesian Neural Networks


Oct 21, 2020
Wanqian Yang, Lars Lorch, Moritz A. Graule, Himabindu Lakkaraju, Finale Doshi-Velez

Figure 1 for Incorporating Interpretable Output Constraints in Bayesian Neural Networks
Figure 2 for Incorporating Interpretable Output Constraints in Bayesian Neural Networks
Figure 3 for Incorporating Interpretable Output Constraints in Bayesian Neural Networks
Figure 4 for Incorporating Interpretable Output Constraints in Bayesian Neural Networks
* 34th Conference on Neural Information Processing Systems (NeurIPS 2020), Vancouver, Canada. Code available at: https://github.com/dtak/ocbnn-public 
  Access Paper or Ask Questions

Interpretable and Interactive Summaries of Actionable Recourses


Sep 16, 2020
Kaivalya Rawal, Himabindu Lakkaraju

Figure 1 for Interpretable and Interactive Summaries of Actionable Recourses
Figure 2 for Interpretable and Interactive Summaries of Actionable Recourses
Figure 3 for Interpretable and Interactive Summaries of Actionable Recourses
Figure 4 for Interpretable and Interactive Summaries of Actionable Recourses

  Access Paper or Ask Questions

How Much Should I Trust You? Modeling Uncertainty of Black Box Explanations


Aug 11, 2020
Dylan Slack, Sophie Hilgard, Sameer Singh, Himabindu Lakkaraju

Figure 1 for How Much Should I Trust You? Modeling Uncertainty of Black Box Explanations
Figure 2 for How Much Should I Trust You? Modeling Uncertainty of Black Box Explanations
Figure 3 for How Much Should I Trust You? Modeling Uncertainty of Black Box Explanations
Figure 4 for How Much Should I Trust You? Modeling Uncertainty of Black Box Explanations

  Access Paper or Ask Questions

Fair Influence Maximization: A Welfare Optimization Approach


Jun 14, 2020
Aida Rahmattalabi, Shahin Jabbari, Himabindu Lakkaraju, Phebe Vayanos, Eric Rice, Milind Tambe

Figure 1 for Fair Influence Maximization: A Welfare Optimization Approach
Figure 2 for Fair Influence Maximization: A Welfare Optimization Approach
Figure 3 for Fair Influence Maximization: A Welfare Optimization Approach
Figure 4 for Fair Influence Maximization: A Welfare Optimization Approach

  Access Paper or Ask Questions

"How do I fool you?": Manipulating User Trust via Misleading Black Box Explanations


Nov 15, 2019
Himabindu Lakkaraju, Osbert Bastani

Figure 1 for "How do I fool you?": Manipulating User Trust via Misleading Black Box Explanations
Figure 2 for "How do I fool you?": Manipulating User Trust via Misleading Black Box Explanations
Figure 3 for "How do I fool you?": Manipulating User Trust via Misleading Black Box Explanations
Figure 4 for "How do I fool you?": Manipulating User Trust via Misleading Black Box Explanations

  Access Paper or Ask Questions

How can we fool LIME and SHAP? Adversarial Attacks on Post hoc Explanation Methods


Nov 06, 2019
Dylan Slack, Sophie Hilgard, Emily Jia, Sameer Singh, Himabindu Lakkaraju

Figure 1 for How can we fool LIME and SHAP? Adversarial Attacks on Post hoc Explanation Methods
Figure 2 for How can we fool LIME and SHAP? Adversarial Attacks on Post hoc Explanation Methods
Figure 3 for How can we fool LIME and SHAP? Adversarial Attacks on Post hoc Explanation Methods
Figure 4 for How can we fool LIME and SHAP? Adversarial Attacks on Post hoc Explanation Methods

  Access Paper or Ask Questions

Interpretable & Explorable Approximations of Black Box Models


Jul 04, 2017
Himabindu Lakkaraju, Ece Kamar, Rich Caruana, Jure Leskovec

Figure 1 for Interpretable & Explorable Approximations of Black Box Models
Figure 2 for Interpretable & Explorable Approximations of Black Box Models
Figure 3 for Interpretable & Explorable Approximations of Black Box Models
Figure 4 for Interpretable & Explorable Approximations of Black Box Models
* Presented as a poster at the 2017 Workshop on Fairness, Accountability, and Transparency in Machine Learning 
  Access Paper or Ask Questions

Identifying Unknown Unknowns in the Open World: Representations and Policies for Guided Exploration


Dec 10, 2016
Himabindu Lakkaraju, Ece Kamar, Rich Caruana, Eric Horvitz

Figure 1 for Identifying Unknown Unknowns in the Open World: Representations and Policies for Guided Exploration
Figure 2 for Identifying Unknown Unknowns in the Open World: Representations and Policies for Guided Exploration
Figure 3 for Identifying Unknown Unknowns in the Open World: Representations and Policies for Guided Exploration
Figure 4 for Identifying Unknown Unknowns in the Open World: Representations and Policies for Guided Exploration
* To appear in AAAI 2017; Presented at NIPS Workshop on Reliability in ML, 2016 
  Access Paper or Ask Questions

Learning Cost-Effective and Interpretable Regimes for Treatment Recommendation


Nov 23, 2016
Himabindu Lakkaraju, Cynthia Rudin

Figure 1 for Learning Cost-Effective and Interpretable Regimes for Treatment Recommendation
Figure 2 for Learning Cost-Effective and Interpretable Regimes for Treatment Recommendation
Figure 3 for Learning Cost-Effective and Interpretable Regimes for Treatment Recommendation
* Presented at NIPS 2016 Workshop on Interpretable Machine Learning in Complex Systems 
  Access Paper or Ask Questions

Learning Cost-Effective Treatment Regimes using Markov Decision Processes


Oct 21, 2016
Himabindu Lakkaraju, Cynthia Rudin

Figure 1 for Learning Cost-Effective Treatment Regimes using Markov Decision Processes
Figure 2 for Learning Cost-Effective Treatment Regimes using Markov Decision Processes
Figure 3 for Learning Cost-Effective Treatment Regimes using Markov Decision Processes
Figure 4 for Learning Cost-Effective Treatment Regimes using Markov Decision Processes

  Access Paper or Ask Questions

Dynamic Multi-Relational Chinese Restaurant Process for Analyzing Influences on Users in Social Media


May 07, 2012
Himabindu Lakkaraju, Indrajit Bhattacharya, Chiranjib Bhattacharyya

Figure 1 for Dynamic Multi-Relational Chinese Restaurant Process for Analyzing Influences on Users in Social Media
Figure 2 for Dynamic Multi-Relational Chinese Restaurant Process for Analyzing Influences on Users in Social Media
Figure 3 for Dynamic Multi-Relational Chinese Restaurant Process for Analyzing Influences on Users in Social Media
Figure 4 for Dynamic Multi-Relational Chinese Restaurant Process for Analyzing Influences on Users in Social Media
* 9 pages 
  Access Paper or Ask Questions