Pith. sign in

REVIEW 9 cited by

LlamaRec: Two-Stage Recommendation using Large Language Models for Ranking

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 2311.02089 v1 pith:SZFO6KE5 submitted 2023-10-25 cs.IR cs.AIcs.CL

LlamaRec: Two-Stage Recommendation using Large Language Models for Ranking

classification cs.IR cs.AIcs.CL
keywords recommendationlanguagellamarecitemslargellmsmethodsmodels
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Recently, large language models (LLMs) have exhibited significant progress in language understanding and generation. By leveraging textual features, customized LLMs are also applied for recommendation and demonstrate improvements across diverse recommendation scenarios. Yet the majority of existing methods perform training-free recommendation that heavily relies on pretrained knowledge (e.g., movie recommendation). In addition, inference on LLMs is slow due to autoregressive generation, rendering existing methods less effective for real-time recommendation. As such, we propose a two-stage framework using large language models for ranking-based recommendation (LlamaRec). In particular, we use small-scale sequential recommenders to retrieve candidates based on the user interaction history. Then, both history and retrieved items are fed to the LLM in text via a carefully designed prompt template. Instead of generating next-item titles, we adopt a verbalizer-based approach that transforms output logits into probability distributions over the candidate items. Therefore, the proposed LlamaRec can efficiently rank items without generating long text. To validate the effectiveness of the proposed framework, we compare against state-of-the-art baseline methods on benchmark datasets. Our experimental results demonstrate the performance of LlamaRec, which consistently achieves superior performance in both recommendation performance and efficiency.

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. F-GRPO: Factorized Group-Relative Policy Optimization for Unified Candidate Generation and Ranking

    cs.LG 2026-05 unverdicted novelty 7.0

    F-GRPO factorizes group-relative policy optimization into generation and ranking phases within one autoregressive sequence, using order-invariant coverage and position-aware utility rewards to improve top-ranked perfo...

  2. HORIZON: A Benchmark for In-the-wild User Behaviour Modeling

    cs.IR 2026-04 unverdicted novelty 7.0

    HORIZON creates a cross-domain, long-horizon user modeling benchmark from Amazon Reviews that tests generalization across time, domains, and unseen users, exposing gaps in sequential and LLM-based recommendation models.

  3. Trustworthy Recommendation in the Era of Large Language Models: Opportunities and Challenges

    cs.IR 2026-05 unverdicted novelty 6.0

    A systematic review of over 200 studies concludes that LLMs in recommender systems act as a double-edged sword, creating both opportunities and new risks for trustworthiness.

  4. TimeMM: Time-as-Operator Spectral Filtering for Dynamic Multimodal Recommendation

    cs.IR 2026-04 unverdicted novelty 6.0

    TimeMM proposes a time-as-operator spectral filtering framework with adaptive mixing and modality routing to model non-stationary multimodal user preferences in recommendation systems.

  5. Filling the Gaps: Selective Knowledge Augmentation for LLM Recommenders

    cs.IR 2026-04 unverdicted novelty 6.0

    KnowSA_CKP uses comparative knowledge probing to selectively augment LLM prompts for items with knowledge gaps, improving recommendation accuracy and context efficiency.

  6. 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...

  7. RcLLM: Accelerating Generative Recommendation via Beyond-Prefix KV Caching

    cs.DC 2026-05 unverdicted novelty 5.0

    RcLLM accelerates generative recommendation inference by 1.31x-9.51x in TTFT through beyond-prefix KV caching, replicated user caches, sharded item caches, affinity scheduling, and selective attention with negligible ...

  8. Meta-Modal Agent: Sequential Evidence Routing for Missing-Modality Candidate Reranking

    cs.IR 2026-05 unverdicted novelty 4.0

    MMA uses LLM agents with RL to rerank candidate pools from first-stage retrievers under missing modalities, reporting 4.0% and 12.7% NDCG@10 gains on OOMA and fixed-pool tasks over baselines.

  9. Pre-trained LLMs Meet Sequential Recommenders: Efficient User-Centric Knowledge Distillation

    cs.IR 2026-04 unverdicted novelty 4.0

    A distillation technique embeds LLM-generated textual user profiles into efficient sequential recommenders without runtime LLM inference, architectural changes, or fine-tuning.