Pith. sign in

REVIEW 11 cited by

Think Before Recommend: Unleashing the Latent Reasoning Power for Sequential Recommendation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.22675 v3 pith:D2SWHHHL submitted 2025-03-28 cs.IR cs.AIcs.CL

classification cs.IRcs.AIcs.CL
keywords reasoningsequentialrearecrecommendationlearningrecommenderusercomputing
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Sequential Recommendation (SeqRec) aims to predict the next item by capturing sequential patterns from users' historical interactions, playing a crucial role in many real-world recommender systems. However, existing approaches predominantly adopt a direct forward computation paradigm, where the final hidden state of the sequence encoder serves as the user representation. We argue that this inference paradigm, due to its limited computational depth, struggles to model the complex evolving nature of user preferences and lacks a nuanced understanding of long-tail items, leading to suboptimal performance. To address this issue, we propose \textbf{ReaRec}, the first inference-time computing framework for recommender systems, which enhances user representations through implicit multi-step reasoning. Specifically, ReaRec autoregressively feeds the sequence's last hidden state into the sequential recommender while incorporating special reasoning position embeddings to decouple the original item encoding space from the multi-step reasoning space. Moreover, we introduce two lightweight reasoning-based learning methods, Ensemble Reasoning Learning (ERL) and Progressive Reasoning Learning (PRL), to further effectively exploit ReaRec's reasoning potential. Extensive experiments on five public real-world datasets and different SeqRec architectures demonstrate the generality and effectiveness of our proposed ReaRec. Remarkably, post-hoc analyses reveal that ReaRec significantly elevates the performance ceiling of multiple sequential recommendation backbones by approximately 30\%-50\%. Thus, we believe this work can open a new and promising avenue for future research in inference-time computing for sequential recommendation.

Discussion (0). Sign in to comment.

Forward citations

Cited by 11 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. BEAR: Towards Beam-Search-Aware Optimization for Recommendation with Large Language Models

    cs.IR 2026-01 reject novelty 7.0 of 10

    BEAR is a cheap token-level top-B regularizer for LLM-based recommendation, but its central claim that this condition is necessary for beam-search survival is incorrect.

  2. Grevo: A Unified Generative Recommendation Framework with Evolutionary Item Indexing

    cs.IR 2026-07 conditional novelty 6.0 of 10

    Grevo lets a generative recommender evolve item identifier codes through budgeted posterior-guided search instead of training a separate tokenizer.

  3. RecRec: Recursive Refinement for Sequential Recommendation

    cs.IR 2026-07 conditional novelty 6.0 of 10

    Recursive latent-state refinement with an evidence-anchored correction gate matches or beats much larger sequential, graph, and LLM recommenders on three benchmark datasets.

  4. Uncertainty-aware Generative Recommendation

    cs.IR 2026-02 conditional novelty 6.0 of 10

    UGR injects uncertainty into generative recommendation preference optimization via confidence-weighted rewards, difficulty-aware reweighting, and explicit confidence tokens, improving ranking accuracy and training stability.

  5. Think When Needed: Model-Aware Reasoning Routing for LLM-based Ranking

    cs.IR 2026-01 conditional novelty 6.0 of 10

    A per-instance router trained to predict the utility gain of reasoning decides when an LLM should think before ranking, improving NDCG by up to 6.3% while cutting generation tokens by up to 75%.

  6. The Case Against Generation for Retrieval: Discriminative Language Models as Effective Retrievers

    cs.IR 2026-07 conditional novelty 5.0 of 10

    LLM-native two-tower retrieval with EOS pooling, cross-dataset transfer, distillation from a cross-encoder, and latent user reasoning reaches SoTA-comparable recall on Amazon benchmarks.

  7. The Latent Space: Foundation, Evolution, Mechanism, Ability, and Outlook

    cs.AI 2026-04 accept novelty 5.0 of 10

    A large survey organizes latent-space work in language-based models by foundation, evolution, four mechanisms, seven abilities, and open challenges.

  8. Why Thinking Hurts: Diagnosing and Rectifying Linguistic Inertia in Large Language Models for Recommendation

    cs.IR 2026-02 conditional novelty 5.0 of 10

    Chain-of-thought reasoning degrades semantic-ID recommendation accuracy through 'linguistic inertia,' and a training-free compression-plus-contrastive decoding fix restores and often improves accuracy.

  9. Implicit Reasoning in Large Language Models: A Comprehensive Survey

    cs.CL 2025-09 conditional novelty 5.0 of 10

    A survey organizing implicit (silent) reasoning in LLMs into three execution paradigms, plus evidence, benchmarks, and challenges.

  10. Bridging Search and Recommendation through Latent Cross Reasoning

    cs.IR 2025-08 conditional novelty 5.0 of 10

    A latent cross reasoning model with contrastive learning and GRPO reinforcement learning improves search-enhanced recommendation on Qilin and KuaiSAR.

  11. Act-With-Think: Chunk Auto-Regressive Modeling for Generative Recommendation

    cs.IR 2025-06 conditional novelty 5.0 of 10

    CAR predicts each item as a chunk of semantic IDs plus a unique ID in one autoregressive step and reports large Recall@5 gains on three Amazon datasets.

Pith tools