A Systematic Benchmark of Explainable Methods for Temporal Attribution in Sequential Recommendation Systems
cs.LG
Submitted: 2026-09-23
Updated: 2026-09-23
Comments: Presented at CARS@RecSys'26, 11 pages, 6 figures
License: http://creativecommons.org/licenses/by/4.0/
The gist: Sequential RecSys are central to modern personalization, exploiting user's historical interaction sequences to drive next-step decisions.
Terminology
Abstract
Sequential RecSys are central to modern personalization, exploiting user's historical interaction sequences to drive next-step decisions. Deep learning models, particularly CNN and Transformer-based architectures, have proven highly effective at capturing temporal dependencies in these histories. For transparency and trust, understanding which past interactions drive a given recommendation is increasingly important --- both for developers auditing model behavior and for users seeking a rationale. However, the non-linearities that give these models their predictive power also render them black boxes, making it difficult to attribute decisions to specific interactions. While gradient-based, perturbation-based, and attention-based explainability methods exist, a systematic benchmark of their faithfulness for sequential recommendation is missing. We address this gap by introducing a dual-model masking metric in which one model supplies per-timestep attribution scores and a separately trained, masking-robust probe measures the resulting change in predicted probability. Using this metric, we benchmark ten XAI methods across CNN, Transformer, SASRec, and BERT4Rec backbones on KuaiRand and MovieLens, complemented by analyses of temporal attribution patterns, item popularity confounding, and robustness to input corruption. Our key findings are: (1) gradient-based methods, particularly GradientSHAP and Integrated Gradients, yield the most faithful and robust attributions; (2) raw attention weights are unreliable, but gradient-weighted attention restores faithfulness on shorter sequences, with degradation on longer horizons as softmax attention probabilities converge toward uniform importance scores, diminishing the method's ability to identify informative interactions; and (3) temporal attribution patterns in faithful methods reflect genuine task structure rather than recency or popularity bias.
Sources
- Learning to Estimate Shapley Values with Vision Transformers
- Towards A Rigorous Science of Interpretable Machine Learning
- Session-based Recommendations with Recurrent Neural Networks
- TIMeSynC: Temporal Intent Modelling with Synchronized Context Encodings for Financial Service Applications
- FinTRec: Transformer Based Unified Contextual Ads Targeting and Personalization for Financial Applications
- Captum: A unified and generic model interpretability library for PyTorch
- ALBERT: A Lite BERT for Self-supervised Learning of Language Representations
- KuaiFormer: Transformer-Based Retrieval at Kuaishou
- Limitations of Normalization in Attention Mechanism
- TimeSliver : Symbolic-Linear Decomposition for Explainable Time Series Classification
- Is Attention Interpretable?
- Structured Self-Attention Weights Encode Semantics in Sentiment Analysis
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks