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 · 1 citation · 20 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

It is concluded that diversification should be used selectively, based on observable redundancy and evidence requirements, and introduces a query-adaptive rule that diversifies only when the effective number of distinct documents in the nearest-neighbor top-$k$ selection falls below the query's evidence requirement.

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
#artificial intelligence Book Open access Aug 2026

Pairwise Ranking Outperforms Single-Action RL for Offline Explanation Selection: A Practical Lesson

This work separates generation from selection: explanations are produced ahead of time as a frozen candidate pool (six prompt styles, two commodity LLMs), and a small CPU-resident selector picks one at request time, which needs no GPU and returns in under 100 ms.

T. Chowdhury, Saeideh Shahrokh Esfahani · 0 citations
Preprint Aug 2026

Difficulty-Aware Semantic-ID Optimization for Generative Recommendation

Difficulty-Aware Semantic-ID Optimization (DASO), a tree-aware post-training method that addresses failure mode as an online rollout-allocation problem and improves over MiniOneRec-style GRPO on 11 of 12 metrics and achieves the best result on 9 of 12 metrics.

Xin Yu, Stephen Li, S. Aghaei et al. · 1 citation
Conference Open access 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

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