Skip to content
Book Open access

TRACE: Targeted Ranking-Aware Counterfactual Explanation for Sequential Recommendation

Sep 2026 · Proceedings of the 20th ACM Conference on Recommender Systems · pp. 574-583 · 1 citation · 34 references

TL;DR

TRACE (Targeted Ranking-Aware Counterfactual Explanation), which decomposes the search into three stages under an embedding-accessible, training-free setting: influence-guided position selection, plausibility-aware candidate retrieval, and actual-margin beam pruning.

Abstract

Ranking-constraint counterfactual explanation for sequential recommendation requires query-limited search to decide where to edit and what to substitute—the bottlenecked for query efficiency lies more in how the search space is structured than in the mutation rate alone. We propose TRACE (Targeted Ranking-Aware Counterfactual Explanation), which decomposes the search into three stages under an embedding-accessible, training-free setting: influence-guided position selection, plausibility-aware candidate retrieval, and actual-margin beam pruning. Across five datasets and three recommender architectures, TRACE outperforms the GA-based baseline GECE in validity, query efficiency, edit cost, and likelihood preservation, with the largest gains on bring-in (raising a target item to top-1) and up to an order-of-magnitude reduction in queries on push-out (displacing the current top-1 beyond top-K). Ablations confirm that the gains arise from structuring the search space before evaluation, rather than from increased mutation frequency. Available code: https://github.com/devUuung/TRACE

Read PDF

Similar papers

#natural language process... Preprint Oct 2026

Finding the Right Balance: Relevance and Diversity in LLM Retrieval

Retrieval diversification is widely available in retrieval-augmented generation (RAG) frameworks, yet prior studies disagree on whether it improves retrieval and answer quality. We show that its effectiveness varies primarily with candidate-pool redundancy, in a pattern consistent with the number of distinct evidence p...

Guillaume Brouillette, Faustin Kagabo, Usef Faghihi et al. · 0 citations
Open access Aug 2026

Exposure-Aware Gated Refinement for Balancing Accuracy and Coverage in Closed-Loop Sequential Recommendation

Sequential recommendation aims to predict the next item from a user’s past interaction sequence, and has largely advanced around how accurately the ground-truth item is ranked. In practice, however, a recommendation list influences subsequent user behavior and item exposure, forming a closed-loop feedback process. As t...

Yu-Jin Ju, Jaedong Lee, Sohyun Park · 0 citations
Preprint Sep 2026

QReason: Query-Focused Decoupled Chain-of-Thought for Efficient Passage Reranking

Passage reranking plays a crucial role in information retrieval by refining the ordering of candidate passages to better reflect relevance. Existing listwise LLM rerankers with Chain-of-Thought (CoT) reasoning can handle complex queries effectively, but they suffer from substantial redundancy and high latency due to sl...

Yang Zhang, Wen-Han Liu, Qian-Nan Zhu et al. · 0 citations
Preprint Oct 2026

ECHO: Efficient Cascade with Homogeneous Operators for Distillation-Guided 100K-Sequence Modeling

Modeling lifetime user behavior sequences is essential for capturing long-range preferences in industrial recommendation, yet 100K-length user sequences make target-aware ranking prohibitively expensive. Search-based methods that retrieve from raw sequences incur candidate-dependent costs that grow with sequence length...

Wen-Hao Li, Qing-Lin Jia, Cheng-Hou Jin et al. · 0 citations
Open access 2026

Hodge-Guided Active Preference Elicitation for Efficient Pairwise Ranking

Pairwise comparison is a standard method for eliciting user preferences in recommender systems and group decision-making. The number of required comparisons grows quadratically with the number of alternatives, creating a substantial burden for users and platforms. This paper asks whether Hodge decomposition, which spli...

Eskander Bejaoui, M. O. Aoueileyine, R. Bouallègue · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.