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, which lack guarantees about their explanation quality. We propose an alternative to these approaches by directly r…
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,695 papers · 148 categories
Trend · papers per month
48 results for “interpretable explanations”
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…
This research improves interpretability in sequential explanations using mental models.
problem Improving interpretability in sequential explanations between two parties.
method A reinforcement learning framework that selects explanations based on the explainee's mental model.
result Mental model-based policies increase interpretability over random selection in multiple sequential explanations.
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…
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.
Novel framework explains machine learning models using ontology-based sampling.
problem Generating precise and insightful explanations for machine learning models.
method Ontology-based sampling technique and learnable anchor algorithm.
result Our approach generates more precise and insightful explanations.
CRITS improves time series classification with interpretable local explanations.
problem Lack of detailed explanations in time series classification models.
method CRITS uses convolutional kernels, max-pooling, and rectified linear units to extract feature weights.
result CRITS provides intrinsically interpretable local explanations without requiring gradients or random perturbations.
New framework evaluates model explanations based on decision task improvement.
problem Evaluation of model explanations often misses practical value.
method Decision-theoretic framework quantifying three key values.
result Provides benchmarks and interprets human-AI decision support.
Recently, interpretable models called self-explaining models (SEMs) have been proposed with the goal of providing interpretability robustness. We evaluate the interpretability robustness of SEMs and show that explanations provided by SEMs as currently proposed are not robust to adversarial inputs. Specifically, we succ…
We introduce a method, KL-LIME, for explaining predictions of Bayesian predictive models by projecting the information in the predictive distribution locally to a simpler, interpretable explanation model. The proposed approach combines the recent Local Interpretable Model-agnostic Explanations (LIME) method with ideas …
Improved interpretability methods for ML models using local regressions and variable importance.
problem Inability of existing interpretability methods to provide reliable explanations for ML models, especially in high-dimensional problems with irrelevant features and non-linear relationships.
method Introduces VarImp and SupClus methods using local regressions with weighted distance considering variable importance.
result VarImp and SupClus methods yield better explanations than state-of-the-art approaches, especially in high-dimensional problems with irrelevant features and non-linear relationships.
Study evaluates local explanation methods for time series forecasting.
problem Lack of local interpretability methods for multivariate time series forecasting.
method Proposed two novel evaluation metrics: Area Over the Perturbation Curve for Regression and Ablation Percentage Threshold.
result Comprehensive comparison of local explanation models on two datasets.
New method evaluates visual explanations of deep models using adversarial perturbations.
problem Lack of objective evaluation of visual explanations of deep models.
method Proposes an adversarial perturbation approach to evaluate visual explanations of deep models.
result Demonstrates the effectiveness of the proposed approach through comparisons with existing methods.
A new method explains RNNs by decision lists over skipgrams, improving explanation fidelity and interpretability.
problem Lack of understanding how input segments combine to form patterns in neural network outputs.
method Proposes a pipeline to explain RNNs using decision lists over skipgrams, creating synthetic and real-world datasets for evaluation.
result Persistently achieves high explanation fidelity and interpretable rules.
Transparency, user trust, and human comprehension are popular ethical motivations for interpretable machine learning. In support of these goals, researchers evaluate model explanation performance using humans and real world applications. This alone presents a challenge in many areas of artificial intelligence. In this …
The paper tackles inconsistency in removal-based explanations and proposes methods to reduce it.
problem Inconsistency in removal-based explanations.
method Established the Impossible Trinity Theorem and proposed two novel algorithms to minimize interpretation error.
result The proposed methods achieve a substantial reduction in interpretation error, up to 31.8 times lower.
Mapping chemical performance on molecular structures using locally interpretable explanationsstat.ML
In this work, we present an application of Locally Interpretable Machine-Agnostic Explanations to 2-D chemical structures. Using this framework we are able to provide a structural interpretation for an existing black-box model for classifying biologically produced fuel compounds with regard to Research Octane Number. T…
GRANITE: A Generalized Regional Framework for Identifying Agreement in Feature-Based Explanationsstat.ML
GRANITE unifies feature-based explanation methods to reduce disagreement.
problem Disagreement among feature-based explanation methods.
method GRANITE partitions feature space into regions minimizing interaction and distribution influences.
result Unified and consistent feature explanations.
Method finds counterfactual explanations for random forest models.
problem Limited interpretability of random forest models in regulated industries.
method Similarity learning exploiting random forest's feature representation.
result Generated explanations are sparser and more useful than Shapley values.
Local Interpretable Model-Agnostic Explanations (LIME) is a popular technique used to increase the interpretability and explainability of black box Machine Learning (ML) algorithms. LIME typically generates an explanation for a single prediction by any ML model by learning a simpler interpretable model (e.g. linear cla…
Interpretability is an elusive but highly sought-after characteristic of modern machine learning methods. Recent work has focused on interpretability via , which justify individual model predictions. In this work, we take a step towards reconciling machine explanations with those that humans prod…
Bayesian explanations are more resilient to adversarial attacks than deterministic ones.
problem Stability of saliency-based explanations under adversarial attacks in Neural Networks.
method Empirical and theoretical analysis of Bayesian vs deterministic Neural Networks.
result Bayesian explanations are more stable under adversarial perturbations and direct attacks.
The paper connects machine learning interpretability with learning theory.
problem Performance and explanation generalization in local machine learning models.
method Theoretical analysis and empirical validation of local approximation explanations.
result Theoretical bounds on test-time accuracy and explanation generalization.
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…
BRACE generates efficient counterfactual explanations by integrating causal reasoning.
problem Challenges in traditional counterfactual explanations, especially neglecting causal relationships.
method Backtracking counterfactuals with causal reasoning.
result Our method provides deeper insights into model outputs and is computationally efficient.
Visual Explanation by Interpretation: Improving Visual Feedback Capabilities of Deep Neural Networkscs.CV
Interpretation and explanation of deep models is critical towards wide adoption of systems that rely on them. In this paper, we propose a novel scheme for both interpretation as well as explanation in which, given a pretrained model, we automatically identify internal features relevant for the set of classes considered…
The paper proposes new interpretability paradigms to improve model faithfulness.
problem Improving the accuracy of explanations for complex models.
method Examining and evolving existing paradigms, proposing new models.
result Three new paradigms for interpretability are presented.
We argue that robustness of explanations---i.e., that similar inputs should give rise to similar explanations---is a key desideratum for interpretability. We introduce metrics to quantify robustness and demonstrate that current methods do not perform well according to these metrics. Finally, we propose ways that robust…
Proposes new methods for interpreting document classification models.
problem Interpretation fragility of attention-based neural networks.
method Corpus-level and concept-based explanation methods using attention weights.
result Extracts semantically meaningful keywords and concepts for model predictions.
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 …
ExpBERT uses natural language explanations to improve text interpretation.
problem Improving text interpretation for relation extraction tasks.
method Fine-tuning BERT on MultiNLI to interpret natural language explanations.
result ExpBERT matches a BERT baseline but requires less labeled data and improves performance.
Proposes GPR with local explanation for feature interpretation.
problem Lack of feature interpretation in Gaussian process regression.
method Introduces a locally linear model to explain feature contributions in GPR predictions.
result Achieves comparable predictive performance to GPR and superior interpretability.
RAW-Explainer generates interpretable subgraph explanations for link predictions in knowledge graphs.
problem Interpreting GNN predictions for link prediction in heterogeneous settings is challenging.
method RAW-Explainer uses random walk objective and neural network to generate connected, concise subgraph explanations.
result RAW-Explainer strikes a balance between explanation quality and computational efficiency.
δ-CLUE generates diverse explanations for model uncertainty.
problem Lack of constraints in generating explanations for uncertainty estimates.
method Augmenting CLUE approach to provide a set of plausible explanations.
result Returns a set of diverse inputs that yield confident predictions.
Recent years have seen a boom in interest in machine learning systems that can provide a human-understandable rationale for their predictions or decisions. However, exactly what kinds of explanation are truly human-interpretable remains poorly understood. This work advances our understanding of what makes explanations …
The paper uses SHAP for interpreting machine learning models in hospital data.
problem Interpreting machine learning models in healthcare.
method SHAP for feature importance and feature packing techniques.
result SHAP provides better interpretability of machine learning models in healthcare.
Graph structured data has wide applicability in various domains such as physics, chemistry, biology, computer vision, and social networks, to name a few. Recently, graph neural networks (GNN) were shown to be successful in effectively representing graph structured data because of their good performance and generalizati…
PiNets provide faithful explanations for neural networks.
problem Lack of true explanations for neural network predictions.
method Pointwise-interpretable Networks (PiNets) that form linear models instance-wise.
result PiNets offer explanations that are meaningful, aligned, robust, and sufficient.
Interpretable machine learning has gained much attention recently. Briefness and comprehensiveness are necessary in order to provide a large amount of information concisely when explaining a black-box decision system. However, existing interpretable machine learning methods fail to consider briefness and comprehensiven…
Active learning has long been a topic of study in machine learning. However, as increasingly complex and opaque models have become standard practice, the process of active learning, too, has become more opaque. There has been little investigation into interpreting what specific trends and patterns an active learning st…
Develops transparent global models consistent with local explanations.
problem Creating globally interpretable models that align with local explanations from black-box models.
method Custom boolean features from sparse local contrastive explanations are used to train a globally transparent model.
result Custom transparent models have higher local consistency compared to other strategies.
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…
As machine learning systems become ubiquitous, there has been a surge of interest in interpretable machine learning: systems that provide explanation for their outputs. These explanations are often used to qualitatively assess other criteria such as safety or non-discrimination. However, despite the interest in interpr…
A new method improves LIME for better model explanation.
problem Current LIME explanations are not faithful and weak in understanding.
method Proposes a novel Modified Perturbed Sampling (MPS) for LIME.
result MPS-LIME achieves better performance in understandability, fidelity, and efficiency.
Methods for interpreting machine learning black-box models increase the outcomes' transparency and in turn generates insight into the reliability and fairness of the algorithms. However, the interpretations themselves could contain significant uncertainty that undermines the trust in the outcomes and raises concern abo…
The paper introduces a method to learn models with built-in explanations.
problem Lack of interpretability in deep learning models.
method Formalizes learning with explanation constraints and provides a learning theoretic framework.
result Models that satisfy these constraints have reduced Rademacher complexities, improving their performance.
S-LIME stabilizes LIME for more reliable model explanations.
problem Instability of post hoc explanation methods like LIME.
method Uses hypothesis testing based on central limit theorem to stabilize explanations.
result Demonstrates effectiveness of S-LIME on simulated and real-world data.
SurvFD and SurvSHAP-IQ provide interpretable survival models by analyzing feature interactions.
problem Non-additivity of hazard and survival functions limits standard additive explanation methods.
method SurvFD decomposes higher-order effects into time-dependent and time-independent components, extending Shapley interactions to time-indexed functions.
result SurvFD and SurvSHAP-IQ offer a new perspective on survival explanations, explicitly characterizing feature interactions.