67 citations · 262 across the 30 of their papers we have counts for
16 papers · 1 filter
REFRESH: Responsible and Efficient Feature Reselection Guided by SHAP Values
Shubham Sharma, Sanghamitra Dutta, Emanuele Albini +3
Feature selection is a crucial step in building machine learning models. This process is often achieved with accuracy as an objective, and can be cumbersome and computationally exp…
SHAP@k:Efficient and Probably Approximately Correct (PAC) Identification of Top-k Features
Sanjay Kariyappa, Leonidas Tsepenekas, Freddy Lécué +1
The SHAP framework provides a principled method to explain the predictions of a model by computing feature importance. Motivated by applications in finance, we introduce the Top-k…
Accelerating Cutting-Plane Algorithms via Reinforcement Learning Surrogates
Kyle Mana, Fernando Acero, Stephen Mak +4
Discrete optimization belongs to the set of -hard problems, spanning fields such as mixed-integer programming and combinatorial optimization. A current standard appro…
GLOBE-CE: A Translation-Based Approach for Global Counterfactual Explanations
Dan Ley, Saumitra Mishra, Daniele Magazzeni
Counterfactual explanations have been widely studied in explainability, with a range of application dependent methods prominent in fairness, recourse and model understanding. The m…
Bayesian Hierarchical Models for Counterfactual Estimation
Natraj Raman, Daniele Magazzeni, Sameena Shah
Counterfactual explanations utilize feature perturbations to analyze the outcome of an original decision and recommend an actionable recourse. We argue that it is beneficial to pro…
Learn to explain yourself, when you can: Equipping Concept Bottleneck Models with the ability to abstain on their concept predictions
Joshua Lockhart, Daniele Magazzeni, Manuela Veloso
The Concept Bottleneck Models (CBMs) of Koh et al. [2020] provide a means to ensure that a neural network based classifier bases its predictions solely on human understandable conc…
Rethinking Log Odds: Linear Probability Modelling and Expert Advice in Interpretable Machine Learning
Danial Dervovic, Nicolas Marchesotti, Freddy Lecue +1
We introduce a family of interpretable machine learning models, with two broad additions: Linearised Additive Models (LAMs) which replace the ubiquitous logistic link function in G…
Towards learning to explain with concept bottleneck models: mitigating information leakage
Joshua Lockhart, Nicolas Marchesotti, Daniele Magazzeni +1
Concept bottleneck models perform classification by first predicting which of a list of human provided concepts are true about a datapoint. Then a downstream model uses these predi…
Feature Importance for Time Series Data: Improving KernelSHAP
Mattia Villani, Joshua Lockhart, Daniele Magazzeni
Feature importance techniques have enjoyed widespread attention in the explainable AI literature as a means of determining how trained machine learning models make their prediction…
Robust Counterfactual Explanations for Tree-Based Ensembles
Sanghamitra Dutta, Jason Long, Saumitra Mishra +2
Counterfactual explanations inform ways to achieve a desired outcome from a machine learning model. However, such explanations are not robust to certain real-world changes in the u…
Global Counterfactual Explanations: Investigations, Implementations and Improvements
Dan Ley, Saumitra Mishra, Daniele Magazzeni
Counterfactual explanations have been widely studied in explainability, with a range of application dependent methods emerging in fairness, recourse and model understanding. Howeve…
Asynchronous Collaborative Learning Across Data Silos
Tiffany Tuor, Joshua Lockhart, Daniele Magazzeni
Machine learning algorithms can perform well when trained on large datasets. While large organisations often have considerable data assets, it can be difficult for these assets to…
Optimal Admission Control for Multiclass Queues with Time-Varying Arrival Rates via State Abstraction
Marc Rigter, Danial Dervovic, Parisa Hassanzadeh +3
We consider a novel queuing problem where the decision-maker must choose to accept or reject randomly arriving tasks into a no buffer queue which are processed by identical ser…
A Survey on the Robustness of Feature Importance and Counterfactual Explanations
Saumitra Mishra, Sanghamitra Dutta, Jason Long +1
There exist several methods that aim to address the crucial task of understanding the behaviour of AI/ML models. Arguably, the most popular among them are local explanations that f…
Counterfactual Shapley Additive Explanations
Emanuele Albini, Jason Long, Danial Dervovic +1
Feature attributions are a common paradigm for model explanations due to their simplicity in assigning a single numeric score for each input feature to a model. In the actionable r…
Counterfactual Explanations for Arbitrary Regression Models
Thomas Spooner, Danial Dervovic, Jason Long +3
We present a new method for counterfactual explanations (CFEs) based on Bayesian optimisation that applies to both classification and regression models. Our method is a globally co…