LoRMIkA finds k-optimal association rules for local model interpretability.
problem Ensuring trust in machine learning predictions.
method Model-agnostic approach using k-optimal association rules from a neighbourhood.
result Achieves competitive results in local accuracy and interpretability.
This paper proposes a framework to learn explainable rules from knowledge graphs for better recommendation.
problem Combining side information with explainability in recommendation systems.
method Joint learning framework integrating rule induction from knowledge graphs with a rule-guided neural recommendation model.
result Significant improvements in item recommendation performance over baselines.
A new score function improves explainability and reliability of AI systems.
problem Designing AI systems that are explainable, robust, and trustworthy.
method Integrates conformal prediction with explainable machine learning using a novel score function.
result The method achieves improved performance on target classes and satisfies conformal guarantees.
New method improves model explainability and accuracy with low computational cost.
problem Improving model explainability and accuracy in classification models.
method Distributionally robust optimization to learn sparse ensembles of rule sets.
result Improves model performance on various metrics compared to competing methods.
Meta decision trees explain user ratings in recommendation systems.
problem Building explainable recommendation systems with clear user explanations.
method Learned regression functions and sparse decision rules based on user embeddings.
result The method provides accurate and interpretable ratings.
DTOR explains anomalies with rule-based explanations.
problem Need to explain anomalies in data effectively.
method Applies Decision Tree Regressor to estimate anomaly scores and generate rule-based explanations.
result DTOR produces robust and consistent rule-based explanations.
S-SIRUS explains RF for spatial data, improving accuracy and interpretability.
problem Non-interpretable nature of Random Forest in spatially dependent data.
method Proposes S-SIRUS, a spatial extension of SIRUS for extracting interpretable rules.
result S-SIRUS outperforms SIRUS in spatially dependent data, offering higher predictive accuracy and shorter rule lists.
Understanding the behavior of a trained network and finding explanations for its outputs is important for improving the network's performance and generalization ability, and for ensuring trust in automated systems. Several approaches have previously been proposed to identify and visualize the most important features by…
Many leading classification algorithms output a classifier that is a weighted average of kernel evaluations. Optimizing these weights is a nontrivial problem that still attracts much research effort. Furthermore, explaining these methods to the uninitiated is a difficult task. Letting all the weights be equal leads to …
RIPE is a novel deterministic and easily understandable prediction algorithm developed for continuous and discrete ordered data. It infers a model, from a sample, to predict and to explain a real variable Y given an input variable X∈X (features). The algorithm extracts a sparse set of hyperrectangles $…
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.
The Widrow-Hoff rule simplifies language data simulation.
problem Simulating language phenomena computationally.
method Implementation and application of the Widrow-Hoff rule.
result The Widrow-Hoff rule offers new perspectives on language simulation.
This survey article discusses three aspects of knot colorings. Fox colorings are assignments of labels to arcs, Dehn colorings are assignments of labels to regions, and Alexander-Briggs colorings assign labels to vertices. The labels are found among the integers modulo n. The choice of n depends upon the knot. Each typ…
Proposes PRMs for interpreting financial risk concept drift.
problem Concept drift in high-stakes predictions like credit risk.
method Probabilistic Rule Models (PRMs) using Markov Logic Networks.
result Interpretable rules explain borrower risk changes.
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.
The study enhances financial rule matching using NLP without datasets.
problem Performing semantic matching between financial rules and policies.
method Outperforming pre-trained models with NLP techniques using free resources.
result Improved semantic matching between financial rules and policies.
New framework learns interpretable rule ensembles without sacrificing accuracy.
problem Trade-off between accuracy and interpretability in rule ensembles.
method Introduces local interpretability and a regularizer to promote it, using coordinate descent with local search.
result Learns rule ensembles with fewer rules to explain individual predictions, maintaining comparable accuracy.
DRUM discovers interpretable rules from knowledge graphs for unseen entities.
problem Inductive link prediction on unseen entities and lack of interpretability.
method Differentiable approach using bidirectional RNNs for low-rank tensor approximation.
result DRUM outperforms existing methods in inductive link prediction.
In a recent paper [1] we introduced the Fuzzy Bayesian Learning (FBL) paradigm where expert opinions can be encoded in the form of fuzzy rule bases and the hyper-parameters of the fuzzy sets can be learned from data using a Bayesian approach. The present paper extends this work for selecting the most appropriate rule b…
ALPODS AI diagnoses high-dimensional biomedical data with human-understandable explanations.
problem AI decisions in high-dimensional biomedical data are not explainable to humans.
method ALPODS method classifies data based on clusters and generates fuzzy reasoning rules.
result ALPODS provides understandable explanations for AI diagnoses.
Anchors explain text model decisions by highlighting key words.
problem Explaining neural network decisions for text data.
method Formalized Anchors for text classification, analyzing different models.
result Neural network words with highest partial derivatives are selected by Anchors.
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.
Dynamic rule-based investment strategies outperform static ones in pension schemes.
problem Managing retirement income with dynamic investment strategies.
method Rule-based investment strategies compared to dynamic programming.
result Rule-based strategies achieve higher probability of meeting retirement income targets.
In this paper, we present a new explainability formalism designed to shed light on how each input variable of a test set impacts the predictions of machine learning models. Hence, we propose a group explainability formalism for trained machine learning decision rules, based on their response to the variability of the i…
Study shows SGD's generalization is not explained by implicit bias.
problem Explaining the generalization ability of overparameterized learning algorithms.
method Revisited Stochastic Convex Optimization with SGD, demonstrating limitations of implicit bias.
result No distribution-independent or distribution-dependent implicit regularizer can explain SGD's generalization.
ExMatrix visualizes RF models, aiding in decision understanding.
problem Lack of interpretability in complex models like RF.
method ExMatrix, a novel visualization method for RF interpretability.
result ExMatrix handles large, complex RF models and promotes interpretability.
Self-explaining AI provides understandable explanations for AI decisions.
problem Difficulty in interpreting decisions made by deep neural networks, especially in critical applications.
method Introducing self-explaining AI that provides human-understandable explanations and confidence levels.
result Deep neural networks operate by interpolating between data points, making them hard to interpret.
Classy learns interpretable probabilistic rule lists for multiclass classification.
problem Creating interpretable multiclass classifiers that are both accurate and understandable.
method Probabilistic rule lists and minimum description length (MDL) principle for model selection.
result Classy selects small probabilistic rule lists that outperform state-of-the-art classifiers in terms of predictive performance and interpretability.
HRTPP improves TPP interpretability and accuracy in medical event modeling.
problem Lack of interpretability in TPPs for medical event sequences.
method Hybrid-Rule Temporal Point Processes (HRTPP) integrating temporal logic rules and numerical features.
result HRTPP outperforms state-of-the-art interpretable TPPs in predictive performance and clinical interpretability.
SigD2 reduces noisy rules in rule-based classifiers for better accuracy and readability.
problem Redundant and noisy rules in rule-based classifiers reduce model accuracy and readability.
method Two-stage pruning strategy and ensemble methods (bagging and boosting) to reduce noise and improve model performance.
result SigD2 and ACboost ensemble models outperform state-of-the-art classifiers in terms of accuracy and rule count.
This paper uses NLDT to find interpretable control rules from complex DRL policies.
problem Complex, non-interpretable policies from black-box AI methods.
method Evolutionary optimization of NLDT for hierarchical control rules.
result Interpretable control rules with similar performance to black-box DRL.
InterpretML simplifies machine learning interpretability for users and researchers.
problem Making machine learning models understandable to non-experts.
method Unified Python package exposing interpretability algorithms and visualization.
result First implementation of Explainable Boosting Machine, a powerful, interpretable model.
RAF model explains neural networks' dual rule learning and fact memorization.
problem Understanding how neural networks learn rules and memorize facts simultaneously.
method Introduces the Rules-and-Facts (RAF) model to bridge generalization and memorization.
result Characterizes conditions for simultaneous rule learning and fact memorization in neural networks.
DILP improves fraud detection explainability without significant performance boost.
problem Improving fraud detection explainability in machine learning.
method Differentiable Inductive Logic Programming (DILP) for fraud detection with data curation.
result DILP provides comparable results to traditional methods but lacks significant advantage.
From doctors diagnosing patients to judges setting bail, experts often base their decisions on experience and intuition rather than on statistical models. While understandable, relying on intuition over models has often been found to result in inferior outcomes. Here we present a new method, select-regress-and-round, f…
Examines how central bank policies affect stock markets and asset prices.
problem Understanding the impact of monetary policy on stock markets and asset prices.
method Used Taylor rule equations to analyze data from 1990 to 2020 for US and UK, testing with various econometric methods.
result Monetary policy can explain asset price volatility and output gap better than just inflation rate.
Non-affine aggregation rules cannot preserve monotonicity in convex learning.
problem Designing non-affine aggregation rules that maintain monotonicity in convex learning.
method Proving that monotonicity of aggregated gradients is preserved only if the aggregation rule is positively affine.
result Non-affine aggregation prevents steady convergence and substantially degrades algorithmic stability.
Anchors explains text classifiers by highlighting key words.
problem Interpreting machine learning models, especially for text classifiers.
method Formalizes Anchors' algorithm and analyzes its behavior on linear text classifiers.
result Anchors produces meaningful results on linear text classifiers.
XLabel tool reduces medical experts' workload by 40% and explains its decisions.
problem Efficiently labeling large electronic health records.
method Visual-interactive tool using Explainable Boosting Machine (EBM) for classification and explanation.
result EBM achieves high accuracy and explainability, even with mislabeled data.
In this paper we apply Donaldson's general moment map framework for the action of a symplectomorphism group on the corresponding space of compatible (almost) complex structures to the case of rational ruled surfaces. This gives a new approach to understanding the topology of their symplectomorphism groups, based on a r…
In a physical neural system, where storage and processing are intimately intertwined, the rules for adjusting the synaptic weights can only depend on variables that are available locally, such as the activity of the pre- and post-synaptic neurons, resulting in local learning rules. A systematic framework for studying t…
We present a heuristic based algorithm to induce \textit{nonmonotonic} logic programs that will explain the behavior of XGBoost trained classifiers. We use the technique based on the LIME approach to locally select the most important features contributing to the classification decision. Then, in order to explain the mo…
Algorithm extracts non-monotonic rules from statistical models using HUIM.
problem Extracting non-monotonic rules from statistical learning models.
method Reduces problem to HUIM, uses TreeExplainer for feature importance.
result Significant improvement in classification metrics and training time.
This paper addresses clustering with missing data using Rubin's rules.
problem How to pool partitions and assess instability when data are incomplete after multiple imputation.
method Consensus clustering and bootstrap theory are used to address the problem.
result New rules for pooling partitions and assessing instability are proposed and validated.
CFM-BD builds interpretable fuzzy models for Big Data.
problem Maintaining accuracy and interpretability in fuzzy models for Big Data.
method Distributed learning algorithm with three stages: pre-processing, rule induction, and rule selection.
result CFM-BD constructs simpler models with fewer rules and linguistic labels, achieving competitive accuracy.
In this paper we propose a novel approach for learning from data using rule based fuzzy inference systems where the model parameters are estimated using Bayesian inference and Markov Chain Monte Carlo (MCMC) techniques. We show the applicability of the method for regression and classification tasks using synthetic data…
These are lecture notes for a course on machine learning with neural networks for scientists and engineers that I have given at Gothenburg University and Chalmers Technical University in Gothenburg, Sweden. The material is organised into three parts: Hopfield networks, supervised learning of labeled data, and learning …
A tutorial on VAEs explaining its derivation and applications.
problem Understanding the VAE model and its limitations.
method Explains VAE through probabilistic and information theoretic perspectives.
result Identifies two common misconceptions and their practical consequences.