This paper presents an unsupervised method to learn a neural network, namely an explainer, to interpret a pre-trained convolutional neural network (CNN), i.e., the explainer uses interpretable visual concepts to explain features in middle conv-layers of a CNN. Given feature maps of a conv-layer of the CNN, the explaine…
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 “explainable features”
New feature mapping approach improves recommendation accuracy and explainability.
problem Balancing recommendation accuracy and explainability using metadata.
method Maps uninterpretable features to interpretable aspect features, minimizing both prediction and interpretation losses.
result Strong performance in recommendation and explainability, eliminating metadata need.
New method explains feature interactions in neural networks.
problem Understanding feature interactions in deep networks.
method Integrated Hessians, an extension of Integrated Gradients.
result Integrated Hessians explains pairwise feature interactions efficiently and accurately.
Defines globalness measure for explainers using optimal transport.
problem Challenges in evaluating and comparing explainability methods.
method Axiomatic definition and proof of Wasserstein Globalness measure.
result Wasserstein Globalness measure facilitates meaningful comparison and selection of explainers.
A new method explains mixed features for predictive models using conditional inference trees.
problem Explaining complex machine learning models with mixed features.
method Proposes a method to explain mixed features (continuous, discrete, ordinal, categorical) using conditional inference trees.
result Our method often outperforms current industry standards in various simulation studies and real-world financial data.
Study evaluates feature ranking methods' faithfulness in ML models, improving with dimensionality reduction.
problem Quantifying and improving the faithfulness of feature ranking methods in ML models.
method Evaluation of multiple feature ranking methods, including SHAP, LIME, ALE variance, and LR coefficients, using permutation importance as a baseline.
result Dimensionality reduction improves the faithfulness of feature ranking methods, making permutation importance the most faithful method.
Proposes a method for explaining tabular data using copulas.
problem Lack of ground truth for explainability in complex datasets.
method Uses copulas to specify statistical properties and build intuition.
result Demonstrates improved explainability on logistic regression and correlation use cases.
This study compares feature importance and explainability in quantum vs classical ML models.
problem Lack of transparency in ML models, especially in sensitive fields.
method Comparison of classical ML (SVM, Random Forest) and hybrid quantum ML (VQC, QSVC) models using feature importance and explainability methods.
result Quantum ML models provide insights similar to classical models but with unique quantum features.
TIME explains temporal models by analyzing feature importance.
problem Existing methods struggle with temporal models and feature importance.
method Model-agnostic permutation-based approach, temporal feature importance, hypothesis testing.
result TIME provides statistical rigor for explaining temporal models.
A method to improve clustering explainability using bagging and feature dropout.
problem Lack of explainability in clustering methods.
method Bagging and feature dropout to generate feature importance scores.
result Improved stability and robustness of cluster definition, especially in small-sample or noisy settings.
Self-explaining models are models that reveal decision making parameters in an interpretable manner so that the model reasoning process can be directly understood by human beings. General Linear Models (GLMs) are self-explaining because the model weights directly show how each feature contributes to the output value. H…
This paper uses XAI techniques to explain meta-learning models.
problem Lack of understanding how meta-features contribute to model performance.
method XAI techniques applied to explain black-box surrogate models.
result Improved understanding of meta-features' importance and effect.
Unified framework for model explanation methods based on feature removal.
problem Unclear relationships and preferences among various model explanation methods.
method Characterizes removal-based explanations along three dimensions.
result Unified 26 existing methods, including widely used approaches.
We develop a theory of higher-order feature attribution for complex models.
problem Interpreting feature contributions in models with interactions is challenging.
method We extend Integrated Gradients (IG) to higher-order feature attributions.
result We establish natural connections to statistics and topological signal processing.
Study compares and contrasts various ML explanation methods, highlighting their disagreements and similarities.
problem Understanding and quantifying the differences between various machine learning explanation methods.
method Synthesized and visualized various explanation methods for global and local aspects of ML models.
result There is substantial agreement on the top features but less on specific rankings, and tree interpreter is comparable to SHAP for feature effects.
We adapt Shapley values to explain model uncertainty, connecting it to information theory.
problem Explaining uncertainty in model predictions.
method Adapted Shapley value framework to quantify feature contributions to predictive uncertainty.
result Deep connections between Shapley values and information theory quantities.
P-SE explains model decisions with minimal feature subsets and fast estimators.
problem Explain model decisions in regression and classification.
method Probabilistic Sufficient Explanations (P-SE) with random Forests for conditional probability estimation.
result Consistent and efficient explanations for regression and classification models.
New statistical methods improve explainability of boosting models.
problem Uncertainty quantification for boosting models is computationally intensive and hard to interpret.
method Derive methods for statistical inference using gradient boosting and Boulevard regularization.
result Achieve asymptotically normal predictions with theoretical guarantees and runtime independent of data size.
XAI-Bench releases synthetic datasets for evaluating feature attribution methods.
problem Evaluating and comparing feature attribution methods is challenging.
method Released synthetic datasets and benchmarking library.
result Efficiently evaluates feature attribution methods across various metrics.
RIG extends IG to Riemannian manifolds for explainable AI.
problem Lack of explainability in AI models.
method Extension of Integrated Gradients to Riemannian manifolds.
result RIG restricts to IG in Euclidean space.
New framework for explainable AI on high-dimensional data.
problem Challenges in explainability with high-dimensional data.
method Two modules: latent representation and Shapley paradigm adaptation.
result Interpretable model explanations for high-dimensional data.
The AdaBoost algorithm has the superiority of resisting overfitting. Understanding the mysteries of this phenomena is a very fascinating fundamental theoretical problem. Many studies are devoted to explaining it from statistical view and margin theory. In this paper, we illustrate it from feature learning viewpoint, an…
Unified framework for explaining models by removing features.
problem Unclear relationships and preferences among existing model explanation methods.
method Removal-based explanations characterized by three dimensions.
result Unified framework unifies 26 existing methods.
Develops Shapley explainability solutions respecting data manifold.
problem Tenable assumption of uncorrelated features in Shapley explainability.
method Two solutions: generative modelling and direct learning of Shapley value-function.
result On-manifold Shapley explainability overcomes drawbacks of 'off-manifold' values.
This paper evaluates and improves metrics for identifying important features in machine learning models.
problem Evaluation metrics for explainable AI are limited by multicollinearity and model accuracy.
method Proposes Expected Accuracy Interval (EAI) to predict model accuracy with multicollinearity.
result EAI is a useful metric for identifying important features in models with multicollinearity.
What's Wrong with Your Synthetic Tabular Data? Using Explainable AI to Evaluate Generative Modelscs.LG
AI techniques explain synthetic tabular data weaknesses.
problem Challenges in evaluating synthetic tabular data quality.
method Apply explainable AI to a binary detection classifier.
result Reveals inconsistencies, unrealistic dependencies, or missing patterns in synthetic data.
ExCIR provides efficient, consistent, and scalable explainability for complex models.
problem Complex models lack transparency and require efficient, stable, and scalable explainability methods.
method ExCIR uses correlation-aware feature attribution with robust centering and groupwise aggregation.
result ExCIR delivers trustworthy agreement with global baselines and full model rankings, reduces runtime, and scales to large datasets.
STOOD-X detects out-of-distribution samples without distributional assumptions and provides explainable visualizations.
problem Challenges in OOD detection, including restrictive assumptions, scalability issues, and lack of interpretability.
method Two-stage methodology combining statistical nonparametric test and explainability enhancements.
result Achieves competitive performance in high-dimensional and complex settings, with explainability framework enabling human oversight.
The paper compares LOCO and Shapley values for feature importance, highlighting their limitations and suggesting improvements.
problem Quantifying feature importance in the presence of feature correlation.
method LOCO and Shapley Values, critiquing their axioms and proposing new measures.
result Shapley values do not eliminate feature correlation, and a modified LOCO is recommended.
Unified view of improving tree model interpretability and debiasing feature importance.
problem Improving interpretability and debiasing feature importance in tree-based models.
method Demonstrates a common thread among bias correction methods and local explanations for trees.
result Points out a bias in explainable AI for trees algorithms due to inbag data inclusion.
Predictive modeling applications increasingly use data representing people's behavior, opinions, and interactions. Fine-grained behavior data often has different structure from traditional data, being very high-dimensional and sparse. Models built from these data are quite difficult to interpret, since they contain man…
Machine learning predicts homicide clearance rates with SHAP explaining key features.
problem Predicting and explaining homicide clearance rates in the US.
method Nine algorithmic approaches compared; XGBoost selected. SHAP used for feature importance.
result XGBoost best predicts national homicide clearance rates; SHAP reveals key features.
SHAP clustering explains model predictions by grouping similar feature contributions.
problem Lack of explainability in black-box models.
method SHAP values for feature contributions, supervised clustering of SHAP values.
result Insight into pathways leading to similar predictions.
In many modern image-classification applications, understanding the cause of model's prediction can be as critical as the prediction's accuracy itself. Various feature-based local explanations generation methods have been designed to give us more insights on the decision of complex classifiers. Nevertheless, there is n…
MACQ method explains deep learning models by analyzing feature contributions across prediction levels.
problem Explaining deep learning model predictions.
method Global gradient-based, model-agnostic approach focusing on marginal attribution.
result MACQ separates feature contributions from interaction effects and visualizes 3-way relationships.
Machine Learning algorithms are increasingly being used in recent years due to their flexibility in model fitting and increased predictive performance. However, the complexity of the models makes them hard for the data analyst to interpret the results and explain them without additional tools. This has led to much rese…
Proposes a new method to explain model predictions for consumer recourse.
problem Current explanation methods fail to provide meaningful recourse to decision subjects.
method Develops feature responsiveness scores to highlight actionable features.
result Standard practices can undermine decision subjects by highlighting unresponsive features.
Machine learning is used more and more often for sensitive applications, sometimes replacing humans in critical decision-making processes. As such, interpretability of these algorithms is a pressing need. One popular algorithm to provide interpretability is LIME (Local Interpretable Model-Agnostic Explanation). In this…
Explaining complex or seemingly simple machine learning models is an important practical problem. We want to explain individual predictions from a complex machine learning model by learning simple, interpretable explanations. Shapley values is a game theoretic concept that can be used for this purpose. The Shapley valu…
New method explains predictive uncertainty by focusing on second-order effects.
problem Explaining predictive uncertainty in machine learning models.
method CovLRP, CovGI, etc., based on second-order effects.
result Predictive uncertainty is dominated by second-order effects.
New method improves model explainability.
problem Improper model explanations fail to reflect true data-generating process.
method Shapley Marginal Surplus for Strong Models
result Significant outperformance in inferential capabilities.
Method extracts features from signals for classification with explainability.
problem Lack of interpretability in signal classification models.
method Combining scattering transform and multiclass logistic regression with zeroth-order optimization.
result Uncovered the meaning of scattering transform coefficients.
A new method reduces the computational cost of KernelSHAP for explaining predictions.
problem Efficiently approximating Shapley values for complex models with many features.
method Replacing stochastic weights with deterministic ones in KernelSHAP.
result Reduces the number of contribution function evaluations by 5% to 50%.
RAMs improve GAMs' accuracy by fitting components to subregions of feature space.
problem Subpar accuracy in GAMs due to inability to capture feature interactions.
method Identify subregions of feature space where interactions are minimized, fitting one component per subregion.
result RAMs offer improved expressiveness compared to GAMs while maintaining interpretability.
ECSEL learns signomial equations for explainable classification.
problem Creating interpretable models for classification.
method ECSEL constructs signomial equations directly for classification and explanation.
result ECSEL outperforms state-of-the-art methods in interpretability and efficiency.
XGBoost fails to accurately identify relevant features, while interpretable methods do.
problem Accurately identifying relevant features in black-box models like XGBoost.
method Comparison of variable importance methods (CART, Optimal Trees, XGBoost, SHAP) across various experiments.
result Interpretable methods outperform black-box models in feature selection accuracy.
This review explores XAI in finance, highlighting common techniques and areas needing improvement.
problem Balancing accuracy and transparency in financial AI models.
method Bibliometric and content analysis of XAI applications in finance.
result Post-hoc interpretability techniques are most used in financial XAI.
AEC method improves XAI for models with collinear features.
problem Collinearity issues in machine learning models.
method Divides multivariate models into univariate models to examine feature effects.
result AEC method is more robust and stable against collinearity.