Explaining Group Recommendations via Counterfactuals

• URL: http://arxiv.org/abs/2601.16882v2
• Date: Mon, 26 Jan 2026 13:40:58 GMT
• Title: Explaining Group Recommendations via Counterfactuals
• Abstract summary: Grouper systems help users make collective choices but often lack transparency.<n>Existing explanation methods focus on individuals, offering limited support for groups where multiple preferences interact.<n>We propose a framework for group counterfactual explanations, which reveal how removing specific past interactions would change a group recommendation.
• Score: 1.9053062263045657
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Group recommender systems help users make collective choices but often lack transparency, leaving group members uncertain about why items are suggested. Existing explanation methods focus on individuals, offering limited support for groups where multiple preferences interact. In this paper, we propose a framework for group counterfactual explanations, which reveal how removing specific past interactions would change a group recommendation. We formalize this concept, introduce utility and fairness measures tailored to groups, and design heuristic algorithms, such as Pareto-based filtering and grow-and-prune strategies, for efficient explanation discovery. Experiments on MovieLens and Amazon datasets show clear trade-offs: low-cost methods produce larger, less fair explanations, while other approaches yield concise and balanced results at higher cost. Furthermore, the Pareto-filtering heuristic demonstrates significant efficiency improvements in sparse settings.

Related papers

• Optimal Transport Group Counterfactual Explanations [15.277896909284296]
  Group counterfactual explanations find a set of counterfactual instances to explain a group of input instances contrastively.<n>We learn an explicit optimal transport map that sends any group instance to its counterfactual without re-optimization.<n>Experiments show that they accurately generalize, preserve group geometry and incur only negligible additional transport cost.
  arXiv  Detail & Related papers  (2026-01-28T15:22:20Z)
• Collaborative Group-Aware Hashing for Fast Recommender Systems [66.92426381995695]
  Hash technique has shown its superiority for speeding up the online recommendation by bit operations on Hamming distance computations.<n>Existing hashing-based recommendations suffer from low accuracy, especially with sparse settings.<n>This paper lodges a Collaborative Group-Aware Hashing (CGAH) method for both collaborative filtering and content-aware recommendations.
  arXiv  Detail & Related papers  (2025-12-23T09:07:28Z)
• Enhancing Group Recommendation using Soft Impute Singular Value Decomposition [0.0]
  Group recommender systems often struggle due to sparsity and high-dimensionality of the available data.<n>We propose a group recommender system called Group Soft-Impute SVD, which leverages soft-impute singular value decomposition to enhance group recommendations.
  arXiv  Detail & Related papers  (2025-11-14T11:13:56Z)
• GroupCoOp: Group-robust Fine-tuning via Group Prompt Learning [57.888537648437115]
  Group Context Optimization (GroupCoOp) is a simple and effective debiased fine-tuning algorithm.<n>It enhances the group robustness of fine-tuned vision-language models (VLMs)<n>GroupCoOp achieved the best results on five benchmarks across five CLIP architectures.
  arXiv  Detail & Related papers  (2025-09-28T09:54:30Z)
• Multi-Granularity Attention Model for Group Recommendation [7.764789596492022]
  Group recommendation provides personalized recommendations to a group of users based on their shared interests, preferences, and characteristics. We present the Multi-Granularity Attention Model (MGAM) to uncover group members' latent preferences and mitigate recommendation noise. Our method effectively reduces group recommendation noise across multiple granularities and comprehensively learns individual interests.
  arXiv  Detail & Related papers  (2023-08-08T03:24:44Z)
• Fairness Aware Counterfactuals for Subgroups [8.593488857185678]
  We present Fairness Aware Counterfactuals for Subgroups (FACTS), a framework for auditing subgroup fairness through counterfactual explanations. We aim to formulate different aspects of the difficulty of individuals in certain subgroups to achieve recourse. We introduce notions of subgroup fairness that are robust, if not totally oblivious, to the cost of achieving recourse.
  arXiv  Detail & Related papers  (2023-06-26T18:03:56Z)
• Modeling the Q-Diversity in a Min-max Play Game for Robust Optimization [61.39201891894024]
  Group distributionally robust optimization (group DRO) can minimize the worst-case loss over pre-defined groups. We reformulate the group DRO framework by proposing Q-Diversity. Characterized by an interactive training mode, Q-Diversity relaxes the group identification from annotation into direct parameterization.
  arXiv  Detail & Related papers  (2023-05-20T07:02:27Z)
• "Explain it in the Same Way!" -- Model-Agnostic Group Fairness of Counterfactual Explanations [8.132423340684568]
  Counterfactual explanations tell the user what to do in order to change the outcome of the system in a desirable way. We propose a model-agnostic method for computing counterfactual explanations that do not differ significantly in their complexity between protected groups.
  arXiv  Detail & Related papers  (2022-11-27T15:24:06Z)
• Focus on the Common Good: Group Distributional Robustness Follows [47.62596240492509]
  This paper proposes a new and simple algorithm that explicitly encourages learning of features that are shared across various groups. While Group-DRO focuses on groups with worst regularized loss, focusing instead, on groups that enable better performance even on other groups, could lead to learning of shared/common features.
  arXiv  Detail & Related papers  (2021-10-06T09:47:41Z)
• Overcoming Data Sparsity in Group Recommendation [52.00998276970403]
  Group recommender systems should be able to accurately learn not only users' personal preferences but also preference aggregation strategy. In this paper, we take Bipartite Graphding Model (BGEM), the self-attention mechanism and Graph Convolutional Networks (GCNs) as basic building blocks to learn group and user representations in a unified way.
  arXiv  Detail & Related papers  (2020-10-02T07:11:19Z)
• GroupIM: A Mutual Information Maximization Framework for Neural Group Recommendation [24.677145454396822]
  We study the problem of making item recommendations to ephemeral groups, which comprise users with limited or no historical activities together. Existing studies target persistent groups with substantial activity history, while ephemeral groups lack historical interactions. We propose data-driven regularization strategies to exploit both the preference covariance amongst users who are in the same group, as well as the contextual relevance of users' individual preferences to each group.
  arXiv  Detail & Related papers  (2020-06-05T23:18:19Z)
• Fairness-Aware Explainable Recommendation over Knowledge Graphs [73.81994676695346]
  We analyze different groups of users according to their level of activity, and find that bias exists in recommendation performance between different groups. We show that inactive users may be more susceptible to receiving unsatisfactory recommendations, due to insufficient training data for the inactive users. We propose a fairness constrained approach via re-ranking to mitigate this problem in the context of explainable recommendation over knowledge graphs.
  arXiv  Detail & Related papers  (2020-06-03T05:04:38Z)

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.