REPREC: Representation Driven Parameter-Efficient Recommendation System
arXiv:2607. 24845v1 Announce Type: cross Abstract: Large language models (LLMs) have been applied to sequential recommendation by formulating it as a natural language task.
RACE is a framework for efficient sequential recommendation that adapts model structure and input sequences to each instance’s complexity. It uses a ranking‑uncertainty metric derived from the stability of top‑K predictions to estimate instance difficulty, then predicts this uncertainty from early‑layer features. Guided by the prediction, RACE performs instance‑specific slimming—channel sensitivity extraction to remove redundant parameters and progressive sequence filtering to reduce data redundancy—achieving better accuracy, efficiency, and adaptability than existing baselines on four datasets.
arXiv:2607. 24845v1 Announce Type: cross Abstract: Large language models (LLMs) have been applied to sequential recommendation by formulating it as a natural language task.
SequenceO1 is an end‑to‑end framework that enables ultra‑long (up to 100K interactions) sequence modeling for recommendation systems. It compresses raw user histories into a fixed‑size sketch using Sketch Attention and then models short‑term and long‑term interests with Target‑to‑History Cross Attention. The system incorporates low‑rank caching, batching, pipeline lift, and a FlashSA kernel to keep training and inference efficient, achieving consistent offline and online performance gains when deployed at full traffic on Douyin.
arXiv:2607. 27744v1 Announce Type: new Abstract: Modern recommendation models gain prediction quality by scaling feature-interaction and sequence modules, but production cost constraints cap how far systems can scale.
arXiv:2604. 24806v2 Announce Type: replace-cross Abstract: Modern Deep Learning Recommendation Models (DLRMs) follow scaling laws with sequence length, driving the frontier toward ultra-long User Interaction History (UIH).
LEAP is a length prediction system for large language model inference that uses the serving model’s prefill hidden states and a linear readout to estimate output length. It adapts online via recursive least squares, updating the readout with completed requests without costly retraining or gradient computation. Experiments show LEAP maintains strong ranking performance across domain shifts, improves Spearman correlation by 64.7% under large shifts, and reduces per-token latency by 15.9–40.8% while increasing throughput and drastically cutting predictor parameters.
DeGRe is a dense‑supervised generative reranking framework designed to improve multi‑stage recommender systems by addressing label bias and credit assignment issues. It uses an offline Lookahead Evaluator with beam search to generate dense supervision signals, which are distilled into a lightweight Online Generator that can perform efficient greedy decoding at inference time. Experiments show that DeGRe outperforms baselines on public benchmarks and industrial datasets, and it has been successfully deployed on Taobao Flash Shopping to enhance online recommendations.
arXiv:2609.35783v1 Announce Type: cross Abstract: Large-scale recommender systems, particularly short-form video platforms, are often bottlenecked by massive popularity feedback loops. In such enviro...
arXiv:2606. 27743v1 Announce Type: cross Abstract: Large Language Models (LLMs) inference is typically deployed under a static resource assumption, where models execute a fixed computational graph regardless of the runtime environment.
arXiv:2606. 01111v1 Announce Type: new Abstract: Modern industrial recommender systems rely on thousands of heterogeneous features -- ranging from low-dimensional scalars (e.
The paper introduces LoopRec, an item‑level adaptive recursion mechanism for sequential recommendation that replaces the conventional fixed‑depth computation with a learned, per‑item depth assignment. LoopRec recursively applies a shared block and uses a lightweight gate to decide whether each item should exit or continue processing, allowing early exit for items that converge quickly while allocating deeper computation to critical items. Experiments on multiple backbone families show that LoopRec consistently outperforms fixed‑depth counterparts, with learned depth patterns aligning with lower‑frequency and more recent items.
arXiv:2605. 17779v2 Announce Type: replace Abstract: Generative recommendation reformulates recommendation as next-token prediction over discrete semantic identifiers (IDs).
arXiv:2602. 19938v2 Announce Type: replace Abstract: Sparse Mixture-of-Experts (SMoE) architectures are increasingly used to scale large language models efficiently, delivering strong accuracy under fixed compute budgets.