The paper presents a systematic comparison of importance‑attribution methods for deep learning models that operate on relational databases. It evaluates four methods—Monte Carlo Shapley, Kernel SHAP, single‑attribute impact, and mask learning—across regression and classification tasks using GraphSAGE and Relational Graph Transformers. The study finds that method choice affects attribute rankings and score distributions, with single‑attribute impact often matching Shapley‑based methods at lower cost, especially in regression settings.
arXiv:2610.07981v1 Announce Type: new Abstract: Higher-order models (e.g., hypergraph neural networks) often outperform lower-order baselines on hypergraph learning benchmarks, and their advantages a...
The paper introduces Ra‑NEM, a method that optimizes the area under insertion and deletion curves to improve the faithfulness of feature importance attributions in machine learning models. By deriving an objective function from faithfulness and approximating its gradient, the authors link insertion curves to top‑k feature selection, enabling a loss function that measures attribution quality. Ra‑NEM, integrated with the neural explanation mask framework, works with any differentiable model, yielding accurate, robust, and fast attributions that outperform existing algorithms on multiple XAI metrics.
The paper introduces a systematic benchmark for evaluating explainable methods that attribute temporal interactions in sequential recommendation systems. Using a dual-model masking metric, it assesses ten XAI techniques across CNN, Transformer, SASRec, and BERT4Rec backbones on KuaiRand and MovieLens datasets, revealing that gradient-based methods like GradientSHAP and Integrated Gradients are the most faithful and robust. It also finds that raw attention weights are unreliable, while gradient-weighted attention works better on short sequences but degrades on longer horizons, and that faithful methods capture genuine task structure rather than recency or popularity bias.
arXiv:2606. 06397v1 Announce Type: new Abstract: Current evaluation practices in relational learning rely heavily on flat leaderboards that average performance across heterogeneous datasets, implicitly assuming a uniform underlying structure.
arXiv:2610.20534v1 Announce Type: new Abstract: Relational deep learning has emerged as a powerful paradigm for learning end-to-end predictive models over relational databases by representing them as...
The paper investigates the phenomenon of explanation multiplicity in SHAP, showing that SHAP explanations can vary significantly across repeated runs even when the model, input, and prediction remain unchanged. The authors introduce a dual‑seed evaluation protocol, a hierarchy of metrics, and null models to quantify this variability, finding that multiplicity is widespread across datasets, models, and sampling strategies. They also demonstrate that common metrics like L2 distance may underestimate instability, while rank‑based metrics reveal substantial changes in top‑ranked features, and that improved sampling methods do not fully eliminate run‑to‑run variation.
arXiv:2603. 02184v2 Announce Type: replace-cross Abstract: Multi-attribution learning (MAL), which enhances model performance by learning from conversion labels yielded by multiple attribution mechanisms, has emerged as a promising learning paradigm for conversion rate (CVR) prediction.
The paper introduces a hypothesis‑testing framework that embeds feature importance methods (FIMs) within a Weight of Evidence (WoE) analysis. By quantifying how strongly observed evidence supports a given hypothesis—whether from domain knowledge, ground truth, or the FIM itself—the approach evaluates FIM alignment and variability. The authors provide theoretical links between WoE and attribution variance and demonstrate the method on LIME and SHAP explanations across varied reference hypotheses.
arXiv:2610.17898v1 Announce Type: cross Abstract: Sparse autoencoders decompose language model representations into interpretable features, but feature interpretation in this literature remains predo...
arXiv:2602. 00329v4 Announce Type: replace-cross Abstract: Reliable data attribution is essential for mitigating bias and reducing computational waste in modern machine learning, with the Shapley value serving as the theoretical gold standard.
arXiv:2606. 03885v1 Announce Type: new Abstract: Feature attribution methods explain predictions by assigning importance scores to input features.
arXiv:2507. 22951v2 Announce Type: replace Abstract: Knowledge Graphs organize information as entity-relation-entity triples, enabling machine learning models to predict plausible missing triples in a task known as Knowledge Graph Completion (KGC).