Pith. sign in

REVIEW 9 cited by

Slow Thinking 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 2504.09627 v1 pith:XLNJ76CT submitted 2025-04-13 cs.IR cs.AI

Slow Thinking for Sequential Recommendation

classification cs.IR cs.AI
keywords modeluserreasoningbehaviorhistoricalmethodsrecommendationrepresentations
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

To develop effective sequential recommender systems, numerous methods have been proposed to model historical user behaviors. Despite the effectiveness, these methods share the same fast thinking paradigm. That is, for making recommendations, these methods typically encodes user historical interactions to obtain user representations and directly match these representations with candidate item representations. However, due to the limited capacity of traditional lightweight recommendation models, this one-step inference paradigm often leads to suboptimal performance. To tackle this issue, we present a novel slow thinking recommendation model, named STREAM-Rec. Our approach is capable of analyzing historical user behavior, generating a multi-step, deliberative reasoning process, and ultimately delivering personalized recommendations. In particular, we focus on two key challenges: (1) identifying the suitable reasoning patterns in recommender systems, and (2) exploring how to effectively stimulate the reasoning capabilities of traditional recommenders. To this end, we introduce a three-stage training framework. In the first stage, the model is pretrained on large-scale user behavior data to learn behavior patterns and capture long-range dependencies. In the second stage, we design an iterative inference algorithm to annotate suitable reasoning traces by progressively refining the model predictions. This annotated data is then used to fine-tune the model. Finally, in the third stage, we apply reinforcement learning to further enhance the model generalization ability. Extensive experiments validate the effectiveness of our proposed method.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 9 Pith papers

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

  1. Beyond Matching: Category-Guided Latent Intent Reasoning for Generative Retrieval in E-Commerce

    cs.IR 2026-06 unverdicted novelty 7.0

    CaLIR learns continuous latent intent states guided by product category hierarchies for generative retrieval, combining hierarchical reasoning and dynamic prefix tries to balance effectiveness and low-latency inferenc...

  2. GenRec: A Preference-Oriented Generative Framework for Large-Scale Recommendation

    cs.IR 2026-04 unverdicted novelty 7.0

    GenRec combines page-wise NTP, token compression, and GRPO-SR reinforcement learning to scale generative retrieval, delivering 9.5% click and 8.7% transaction gains in production A/B tests on the JD App.

  3. S$^2$GR: Stepwise Semantic-Guided Reasoning in Latent Space for Generative Recommendation

    cs.IR 2026-01 unverdicted novelty 7.0

    S²GR adds stepwise thinking tokens with contrastive supervision on codebook clusters to balance computational focus and ground reasoning paths in generative recommendation.

  4. HiGR: Industrial-Scale Hierarchical Generative Slate Recommendation Framework in Tencent

    cs.IR 2025-12 conditional novelty 7.0

    A hierarchical generative slate recommender that plans list-level preferences before decoding items achieves 5× speedup and gains in deployed A/B tests.

  5. From Understanding to Action: Feedback-Grounded Policy Discovery for Generative Recommendation

    cs.IR 2026-07 conditional novelty 6.0

    A feedback-grounded framework discovers recommendation policies by their measured advantage over intent-only baselines and distills them into two latent tokens of a lightweight Semantic-ID recommender.

  6. Birds of a Feather Cluster Nearby: a Proximity-Aware Geo-Codebook for Local Service Recommendation

    cs.IR 2026-04 unverdicted novelty 6.0

    Pro-GEO introduces a geo-centroid coordinate system and geo-rotary position encoding to model geographic proximity as rotational transformations, enabling balanced semantic-spatial modeling in local service recommendations.

  7. Enhancing Local Life Service Recommendation with Agentic Reasoning in Large Language Model

    cs.IR 2026-04 unverdicted novelty 6.0

    A unified LLM framework jointly models living need prediction and service recommendation via behavioral clustering and curriculum RL, improving accuracy on both tasks over isolated approaches.

  8. A Survey on Generative Recommendation: Data, Model, and Tasks

    cs.IR 2025-10 accept novelty 6.0

    This survey organizes generative recommendation into data, model, and task dimensions, identifying five advantages including world knowledge integration and creative generation while noting challenges in benchmarks an...

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

    cs.IR 2026-02 conditional novelty 5.0

    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.