Spectral Biclustering-Driven Scalability for Post-Hoc Explainability in Recommender Systems

• URL: http://arxiv.org/abs/2607.19189v1
• Date: Tue, 21 Jul 2026 15:22:12 GMT
• Title: Spectral Biclustering-Driven Scalability for Post-Hoc Explainability in Recommender Systems
• Abstract summary: This paper introduces a block-deletion diagnostic framework that uses spectral biclustering to group users and items and then removes entire blocks of interactions.<n>It produces explanations at the level of user segments, item groups, and their interactions.<n>Results show that top-ranked recommendations are often more sensitive to specific interaction blocks than lower-ranked ones.
• Score: 0.3437656066916039
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Explainability in recommender systems is essential for ensuring transparency, accountability, and trust, yet existing post-hoc methods often encounter severe scalability challenges. Observation-level deletion diagnostics offer a counterfactual way to analyze recommendations by retraining models after removing individual users or items, but their cost grows rapidly with dataset size. To improve the practical tractability of this analysis, this paper introduces a block-deletion diagnostic framework that uses spectral biclustering to group users and items and then removes entire blocks of interactions. This formulation reduces the number of retraining procedures relative to finer-grained deletion strategies and produces explanations at the level of user segments, item groups, and their interactions. The framework is evaluated on two representative recommender paradigms, Singular Value Decomposition and Neural Collaborative Filtering, using the MovieLens and Amazon datasets. The results show that top-ranked recommendations are often more sensitive to specific interaction blocks than lower-ranked ones, with some blocks acting as supporting evidence and others having a detrimental effect on recommendation quality. The analysis also indicates that user segments differ in their sensitivity to block removal, suggesting heterogeneous levels of reliance on localized interaction patterns. These findings provide diagnostic information that is not directly visible through standard recommendation metrics. Overall, the results suggest that block-deletion diagnostics offer a practical and model-agnostic post-hoc analysis framework for recommender systems, while also highlighting that the resulting explanations depend on the chosen block structure.

Related papers

• The Latent Diagnostic Taxonomy: A Framework for Constructing Classifiers and Diagnosing Their Decisions, Applied to Prompt Injection Detection [0.0]
  This paper proposes a framework for constructing a classifier as a safeguard layer, and for developing a complementary diagnostic.<n>Applying the framework to a public prompt injection dataset, we find that a substantial fraction of its confident decisions are not robust to removing a single token.<n>For each zone of the taxonomy, we also recommend strategies for remediating diagnosed prompts.
  arXiv  Detail & Related papers  (2026-08-26T21:55:15Z)
• Monosemanticity in Recommender Systems [0.0]
  We train a large-scale matrix factorization recommender system on the Amazon Fashion dataset and apply a Matryoshka Sparse Autoencoder to the learned embeddings.<n>We analyze the resulting latent features through metadata alignment and LLM-generated labeling to assess semantic coherence and disentanglement.<n>Our findings suggest that collaborative filtering embeddings contain recoverable hierarchical structure, and that Matryoshka training provides a principled mechanism for exposing interpretable latent factors.
  arXiv  Detail & Related papers  (2026-06-28T11:16:12Z)
• AnchorMoE: Interpretable Time Series Classification via Anchor-Routed MoE [51.994752158953084]
  AnchorMoE is an interpretable-by-construction classification framework.<n>It encodes multi-view representations of local patches and routes them to specialized experts.<n>Experiments on real-world and synthetic benchmarks demonstrate that AnchorMoE achieves highly competitive classification performance.
  arXiv  Detail & Related papers  (2026-06-02T13:30:54Z)
• K-Models: a Flexible and Interpretable Method for Ordinal Clustering with Application to Antigen-Antibody Interaction Profiles [65.21921642886367]
  K-Models is a novel framework that integrates ordinal constraints and estimates key underlying elements of the random process generating the observed functional profiles.<n>The proposed method is evaluated through simulations and real-world applications.
  arXiv  Detail & Related papers  (2026-05-14T13:35:44Z)
• Model-agnostic post-hoc explainability for recommender systems [0.3437656066916039]
  We develop a systematic application, adaptation, and evaluation of deletion diagnostics in the recommender setting.<n>The method compares the performance of a model to that of a similar model trained without a specific user or item, allowing us to quantify how that observation influences the recommender.<n>To demonstrate its model-agnostic nature, the proposal is applied to both Neural Collaborative Filtering (NCF), a widely used deep learning-based recommender, and Singular Value Decomposition (SVD), a classical collaborative filtering technique.
  arXiv  Detail & Related papers  (2025-09-12T13:43:16Z)
• Rethinking Contrastive Learning in Graph Anomaly Detection: A Clean-View Perspective [54.605073936695575]
  Graph anomaly detection aims to identify unusual patterns in graph-based data, with wide applications in fields such as web security and financial fraud detection.<n>Existing methods rely on contrastive learning, assuming that a lower similarity between a node and its local subgraph indicates abnormality.<n>The presence of interfering edges invalidates this assumption, since it introduces disruptive noise that compromises the contrastive learning process.<n>We propose a Clean-View Enhanced Graph Anomaly Detection framework (CVGAD), which includes a multi-scale anomaly awareness module to identify key sources of interference in the contrastive learning process.
  arXiv  Detail & Related papers  (2025-05-23T15:05:56Z)
• Contextual Embedding-based Clustering to Identify Topics for Healthcare Service Improvement [3.9726806016869936]
  This study explores unsupervised methods to extract meaningful topics from 439 survey responses collected from a healthcare system in Wisconsin, USA.<n>A keyword-based filtering approach was applied to isolate complaint-related feedback using a domain-specific lexicon.<n>To improve coherence and interpretability where data are scarce and consist of short-texts, we propose kBERT.
  arXiv  Detail & Related papers  (2025-04-18T20:38:24Z)
• Learning Recommender Systems with Soft Target: A Decoupled Perspective [49.83787742587449]
  We propose a novel decoupled soft label optimization framework to consider the objectives as two aspects by leveraging soft labels. We present a sensible soft-label generation algorithm that models a label propagation algorithm to explore users' latent interests in unobserved feedback via neighbors.
  arXiv  Detail & Related papers  (2024-10-09T04:20:15Z)
• Regularized Contrastive Partial Multi-view Outlier Detection [76.77036536484114]
  We propose a novel method named Regularized Contrastive Partial Multi-view Outlier Detection (RCPMOD) In this framework, we utilize contrastive learning to learn view-consistent information and distinguish outliers by the degree of consistency. Experimental results on four benchmark datasets demonstrate that our proposed approach could outperform state-of-the-art competitors.
  arXiv  Detail & Related papers  (2024-08-02T14:34:27Z)
• Causal Disentangled Variational Auto-Encoder for Preference Understanding in Recommendation [50.93536377097659]
  This paper introduces the Causal Disentangled Variational Auto-Encoder (CaD-VAE), a novel approach for learning causal disentangled representations from interaction data in recommender systems. The approach utilizes structural causal models to generate causal representations that describe the causal relationship between latent factors.
  arXiv  Detail & Related papers  (2023-04-17T00:10:56Z)
• From Intrinsic to Counterfactual: On the Explainability of Contextualized Recommender Systems [43.93801836660617]
  We show that by utilizing the contextual features (e.g., item reviews from users), we can design a series of explainable recommender systems. We propose three types of explainable recommendation strategies with gradual change of model transparency: whitebox, graybox, and blackbox. Our model achieves highly competitive ranking performance, and generates accurate and effective explanations in terms of numerous quantitative metrics and qualitative visualizations.
  arXiv  Detail & Related papers  (2021-10-28T01:54:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.