Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

21426283 · Jun 202019922001200920172026
48 results for Model-Agnostic Explanation

WISCA generates consensus explanations from conflicting model-agnostic interpretability methods.

problem Conflicting explanations from diverse interpretability algorithms.
method WISCA integrates class probability and normalized attributions to generate consistent explanations.
result WISCA consistently aligns with the most reliable individual method, improving explanation reliability.

ARFs generate plausible counterfactuals for models, improving model understanding.

problem Creating realistic counterfactuals for model analysis.
method Adversarial Random Forests (ARFs) for generating plausible counterfactuals.
result ARFs efficiently generate plausible counterfactuals in a model-agnostic way.

Recent work in model-agnostic explanations of black-box machine learning has demonstrated that interpretability of complex models does not have to come at the cost of accuracy or model flexibility. However, it is not clear what kind of explanations, such as linear models, decision trees, and rule lists, are the appropr…

2016-11-22abs ↗pdf ↗

Interactions such as double negation in sentences and scene interactions in images are common forms of complex dependencies captured by state-of-the-art machine learning models. We propose Mahé, a novel approach to provide Model-agnostic hierarchical éxplanations of how powerful machine learning models, such as deep ne…

2018-12-12abs ↗pdf ↗

Local surrogate explainers vary in objectives, leading to incomparable explanations.

problem Variability in objectives among local surrogate explainers.
method Review of multiple local surrogate explainers, focusing on extracted information.
result Diverse explanations from similar methods due to differing objectives.

Proposes MOC method for better counterfactual explanations in ML models.

problem Difficulties in balancing multiple objectives for counterfactual explanations.
method Translates counterfactual search into a multi-objective optimization problem.
result Returns diverse counterfactuals with different trade-offs and maintains feature diversity.

A new method for generating counterfactual explanations in high-dimensional datasets.

problem Creating realistic counterfactual explanations in complex, high-dimensional data.
method A discretized approach using binary search and boundary approximation.
result Our method reduces the distance between counterfactuals by 5% to 50% in terms of the L2 norm.

We introduce a new model-agnostic explanation technique which explains the prediction of any classifier called CLE. CLE gives an faithful and interpretable explanation to the prediction, by approximating the model locally using an interpretable model. We demonstrate the flexibility of CLE by explaining different models…

2019-10-02abs ↗pdf ↗

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 work, we propose a method, Model Agnostic Contrastive Explanations Method (MACEM), to generate contrastive explanations for \emph{any} clas…

2019-05-31abs ↗pdf ↗

SurvSHAP(t) explains time-dependent survival predictions from machine learning models.

problem Interpreting complex survival models for time-dependent effects.
method SHapley Additive exPlanations (SHAP) adapted for time-dependent survival predictions.
result SurvSHAP(t) detects time-dependent effects and improves variable importance detection.

Explainable Artificial Intelligence (XAI)has received a great deal of attention recently. Explainability is being presented as a remedy for the distrust of complex and opaque models. Model agnostic methods such as LIME, SHAP, or Break Down promise instance-level interpretability for any complex machine learning model. …

2019-03-27abs ↗pdf ↗

Most of the work on interpretable machine learning has focused on designing either inherently interpretable models, which typically trade-off accuracy for interpretability, or post-hoc explanation systems, whose explanation quality can be unpredictable. Our method, ExpO, is a hybridization of these approaches that regu…

2019-02-18abs ↗pdf ↗

With the advent of GDPR, the domain of explainable AI and model interpretability has gained added impetus. Methods to extract and communicate visibility into decision-making models have become legal requirement. Two specific types of explanations, contrastive and counterfactual have been identified as suitable for huma…

2019-06-21abs ↗pdf ↗

We provide a unified view of additive explanations for dependent inputs.

problem Challenges in obtaining a tractable representation and estimating the decomposition for dependent inputs.
method Combining Hilbert space methods with generalized functional ANOVA, we build an explicit decomposition Riesz Basis.
result Proposed a simple yet powerful algorithm to estimate the decomposition from data.

Understanding why machine learning models behave the way they do empowers both system designers and end-users in many ways: in model selection, feature engineering, in order to trust and act upon the predictions, and in more intuitive user interfaces. Thus, interpretability has become a vital concern in machine learnin…

2016-06-16abs ↗pdf ↗

EAGLE improves reproducibility and stability of model explanations.

problem Creating reliable explanations for opaque machine learning models.
method Formulates perturbation selection as an information-theoretic active learning problem.
result EAGLE learns a linear surrogate model with feature importance scores and uncertainty estimates.

A deep RL approach generates counterfactual instances efficiently.

problem Efficient generation of counterfactual instances for large datasets and diverse models.
method Deep reinforcement learning to optimize counterfactual instances in a single forward pass.
result Model-agnostic and scalable counterfactual generation.

Surrogate explainers of black-box machine learning predictions are of paramount importance in the field of eXplainable Artificial Intelligence since they can be applied to any type of data (images, text and tabular), are model-agnostic and are post-hoc (i.e., can be retrofitted). The Local Interpretable Model-agnostic …

2019-10-29abs ↗pdf ↗

This text discusses several popular explanatory methods that go beyond the error measurements and plots traditionally used to assess machine learning models. Some of the explanatory methods are accepted tools of the trade while others are rigorously derived and backed by long-standing theory. The methods, decision tree…

2018-10-05abs ↗pdf ↗

Complex models are commonly used in predictive modeling. In this paper we present R packages that can be used to explain predictions from complex black box models and attribute parts of these predictions to input features. We introduce two new approaches and corresponding packages for such attribution, namely live and …

2018-04-05abs ↗pdf ↗

We propose a fast, model agnostic method for finding interpretable counterfactual explanations of classifier predictions by using class prototypes. We show that class prototypes, obtained using either an encoder or through class specific k-d trees, significantly speed up the the search for counterfactual instances and …

2019-07-03abs ↗pdf ↗

Predictive models are being increasingly used to support consequential decision making at the individual level in contexts such as pretrial bail and loan approval. As a result, there is increasing social and legal pressure to provide explanations that help the affected individuals not only to understand why a predictio…

2019-05-27abs ↗pdf ↗

Model interpretability is an increasingly important component of practical machine learning. Some of the most common forms of interpretability systems are example-based, local, and global explanations. One of the main challenges in interpretability is designing explanation systems that can capture aspects of each of th…

2018-07-09abs ↗pdf ↗

Evaluates explanations of LTR models using decision paths and compares their accuracy.

problem Challenges in evaluating local explanations of LTR models due to lack of ground truth feature importance scores.
method Focuses on tree-based LTR models, extracts ground truth feature importance scores using decision paths, and compares them with explanation techniques.
result Explanation accuracy varies depending on the model and data point.

ManifoldShap improves model explanations by restricting evaluations to the data manifold.

problem Inaccurate and misleading model explanations due to reliance on out-of-distribution data.
method Restricts model evaluations to the data manifold to avoid off-manifold perturbations.
result ManifoldShap provides more accurate and intuitive explanations than existing methods.

New method provides calibrated feature importance explanations for regression models.

problem Lack of uncertainty quantification in existing local explanation methods.
method Extension of Calibrated Explanations method to support regression and probabilistic regression.
result Calibrated Explanations for regression provides quantified uncertainty and robust explanations.

Researchers show how to manipulate Partial Dependence plots to deceive explanations of predictive models.

problem The robustness and trustworthiness of Partial Dependence (PD) explanations are compromised.
method Data poisoning using genetic and gradient algorithms to manipulate PD plots.
result PD explanations can be fooled and manipulated to mislead understanding of predictive models.

TaylorPODA uses Taylor expansions to improve feature attributions for opaque models.

problem Lack of systematic framework for quantifying feature contributions in opaque models.
method Taylor expansion framework with postulates (precision, federation, zero-discrepancy, adaptation).
result TaylorPODA achieves competitive results and provides principled explanations.

LIMEtree offers faithful explanations for multiple classes in predictive models.

problem Generating explanations for several classes can be difficult due to conflicting evidence.
method LIMEtree uses multi-output regression trees for consistent and faithful explanations of multiple classes.
result LIMEtree provides diverse explanation types and outperforms LIME in evaluations.

Modern instance-based model-agnostic explanation methods (LIME, SHAP, L2X) are of great use in data-heavy industries for model diagnostics, and for end-user explanations. These methods generally return either a weighting or subset of input features as an explanation of the classification of an instance. An alternative …

2019-12-02abs ↗pdf ↗