This reproducibility paper explores the counterfactual explanation technique known as Learning to eXplain Recommendations (LXR), and considers alternate baselines for LXR, including item popularity and latent factor similarity, and finds that for some tasks these alternatives work surprisingly well.
Abstract
This reproducibility paper explores the counterfactual explanation technique known as Learning to eXplain Recommendations (LXR). Prior work has shown that LXR can reliably identify perturbations that, if applied to a user's profile, cause the user's top ranked item to no longer be recommended, thereby explaining the item's recommendation as a function of the user's rating choices. In this paper, we extend this work in multiple ways. We expand the scope of the original LXR study to look at explanations for items other than the most highly recommended item, finding that LXR is also effective at this version of the task. We consider alternate baselines for LXR, including item popularity and latent factor similarity, and we see that for some tasks these alternatives work surprisingly well. We also examine the impact of item popularity, finding that LXR offers better explanation quality (shorter perturbations) when less popular items are being explained. Finally, we conduct a brute-force exploration of a subset of the perturbation space in order to estimate a lower bound for optimal perturbation size against which LXR and other such methods can be compared.
How well does a recommender system know you? These systems are typically trained on the silhouette of user activity to predict immediate engagement, yet this narrow focus may paradoxically expose how incomplete the system’s knowledge of the user really is. Rather than recommending from established user preferences, thi...
Daniel Nemirovsky, Priya Nirmal Singh Khokher, Adarsh Jois et al.· Proceedings of the 20th ACM...· 0 citations
Large language models (LLMs) have shown promise for recommendation reranking, but their use introduces an important tradeoff between recommendation quality and serving efficiency. We investigate whether a decision-oriented model provides a useful alternative when the reranking task is fundamentally a structured choice...
Large Language Models (LLMs) are increasingly used to evaluate recommendation systems, but are known to exhibit systematic biases. We study whether LLM judges are influenced by descriptions of a recommendation algorithm’s optimization objective, even when evaluating identical recommendation outputs. We find that they a...
Himan Abdollahpouri, Kyle Kretschman, M. Lalmas· Proceedings of the 20th ACM...· 0 citations
Recommender systems increasingly influence what users discover and consume online, yet the decision logic behind their outputs often remains opaque. Counterfactual explanation (CFX) methods provide an effective way to show which changes to a user's interaction history would alter a recommendation. In recommendation set...
Vojtech Cahlík, Amir Reza Mohammadi, R. Alves et al.· Proceedings of the 35th ACM...· 0 citations
This work proposes a decorrelation-regularized training framework that augments next-item prediction with an auxiliary redundancy-reduction term, and instantiate it with BT-SR, which uses the Barlow Twins objective to form label-consistent positive pairs without synthetic corruptions.
Veronika Ivanova, Marina Munkhoeva, Ivan Razvorotnev et al.· Proceedings of the 20th ACM...· 0 citations
These findings verify the original paper's claim that User Profile Recommendation achieves competitive performance under its test-set reranking protocol and makes recommendations more transparent.
Noah Mamié, L. van den Bergh· Proceedings of the 9th Black...· 0 citations