Skip to content
← Back to explorer

CollectiveKV: Decoupling and Sharing Collaborative Information in Sequential Recommendation

Jingyu Li, Zhaocheng Du, Qianhui Zhu, kaiyuan Li, Zhicheng Zhang, Song-Li Wu, Chaolang Li, Pengwen Dai · Jan 27, 2026 · Citations: 0

How to use this paper page

Coverage: Stale

Use this page to decide whether the paper is strong enough to influence an eval design. It summarizes the abstract plus available structured metadata. If the signal is thin, use it as background context and compare it against stronger hub pages before making protocol choices.

Best use

Background context only

Metadata: Stale

Trust level

Provisional

Signals: Stale

What still needs checking

Structured extraction is still processing; current fields are metadata-first.

Signal confidence unavailable

Abstract

Sequential recommendation models are widely used in applications, yet they face stringent latency requirements. Mainstream models leverage the Transformer attention mechanism to improve performance, but its computational complexity grows with the sequence length, leading to a latency challenge for long sequences. Consequently, KV cache technology has recently been explored in sequential recommendation systems to reduce inference latency. However, KV cache introduces substantial storage overhead in sequential recommendation systems, which often have a large user base with potentially very long user history sequences. In this work, we observe that KV sequences across different users exhibit significant similarities, indicating the existence of collaborative signals in KV. Furthermore, we analyze the KV using singular value decomposition (SVD) and find that the information in KV can be divided into two parts: the majority of the information is shareable across users, while a small portion is user-specific. Motivated by this, we propose CollectiveKV, a cross-user KV sharing mechanism. It captures the information shared across users through a learnable global KV pool. During inference, each user retrieves high-dimensional shared KV from the pool and concatenates them with low-dimensional user-specific KV to obtain the final KV. Experiments on five sequential recommendation models and three datasets show that our method can compress the KV cache to only 0.8% of its original size, while maintaining or even enhancing model performance.

Use caution before copying this protocol

Use this page for context, then validate protocol choices against stronger HFEPX references before implementation decisions.

  • Structured extraction is still processing; current fields are metadata-first.

HFEPX Relevance Assessment

Signal extraction is still processing. This page currently shows metadata-first guidance until structured protocol fields are ready.

Best use

Background context only

Use if you need

A provisional background reference while structured extraction finishes.

Main weakness

Structured extraction is still processing; current fields are metadata-first.

Trust level

Provisional

Eval-Fit Score

Unavailable

Eval-fit score is unavailable until extraction completes.

Human Feedback Signal

Not explicit in abstract metadata

Evaluation Signal

Weak / implicit signal

HFEPX Fit

Provisional (processing)

Extraction confidence: Provisional

What This Page Found In The Paper

Each field below shows whether the signal looked explicit, partial, or missing in the available metadata. Use this to judge what is safe to trust directly and what still needs full-paper validation.

Human Feedback Types

provisional

None explicit

Confidence: Provisional Best-effort inference

No explicit feedback protocol extracted.

Evidence snippet: Sequential recommendation models are widely used in applications, yet they face stringent latency requirements.

Evaluation Modes

provisional

None explicit

Confidence: Provisional Best-effort inference

Validate eval design from full paper text.

Evidence snippet: Sequential recommendation models are widely used in applications, yet they face stringent latency requirements.

Quality Controls

provisional

Not reported

Confidence: Provisional Best-effort inference

No explicit QC controls found.

Evidence snippet: Sequential recommendation models are widely used in applications, yet they face stringent latency requirements.

Benchmarks / Datasets

provisional

Not extracted

Confidence: Provisional Best-effort inference

No benchmark anchors detected.

Evidence snippet: Sequential recommendation models are widely used in applications, yet they face stringent latency requirements.

Reported Metrics

provisional

Not extracted

Confidence: Provisional Best-effort inference

No metric anchors detected.

Evidence snippet: Sequential recommendation models are widely used in applications, yet they face stringent latency requirements.

Rater Population

provisional

Unknown

Confidence: Provisional Best-effort inference

Rater source not explicitly reported.

Evidence snippet: Sequential recommendation models are widely used in applications, yet they face stringent latency requirements.

Human Data Lens

This page is using abstract-level cues only right now. Treat the signals below as provisional.

  • Potential human-data signal: No explicit human-data keywords detected.
  • Potential benchmark anchors: No benchmark names detected in abstract.
  • Abstract highlights: 3 key sentence(s) extracted below.

Evaluation Lens

Evaluation fields are inferred from the abstract only.

  • Potential evaluation modes: No explicit eval keywords detected.
  • Potential metric signals: No metric keywords detected.
  • Confidence: Provisional (metadata-only fallback).

Research Brief

Metadata summary

Sequential recommendation models are widely used in applications, yet they face stringent latency requirements.

Based on abstract + metadata only. Check the source paper before making high-confidence protocol decisions.

Key Takeaways

  • Sequential recommendation models are widely used in applications, yet they face stringent latency requirements.
  • Mainstream models leverage the Transformer attention mechanism to improve performance, but its computational complexity grows with the sequence length, leading to a latency challenge for long sequences.
  • Consequently, KV cache technology has recently been explored in sequential recommendation systems to reduce inference latency.

Researcher Actions

  • Compare this paper against nearby papers in the same arXiv category before using it for protocol decisions.
  • Check the full text for explicit evaluation design choices (raters, protocol, and metrics).
  • Use related-paper links to find stronger protocol-specific references.

Caveats

  • Generated from abstract + metadata only; no PDF parsing.
  • Signals below are heuristic and may miss details reported outside the abstract.

Recommended Queries

Related Papers

Papers are ranked by protocol overlap, extraction signal alignment, and semantic proximity.

No related papers found for this item yet.

Get Started

Join the #1 Platform for AI Training Talent

Where top AI builders and expert AI Trainers connect to build the future of AI.
Self-Service
Post a Job
Post your project and get a shortlist of qualified AI Trainers and Data Labelers. Hire and manage your team in the tools you already use.
Managed Service
For Large Projects
Done-for-You
We recruit, onboard, and manage a dedicated team inside your tools. End-to-end operations for large or complex projects.
For Freelancers
Join as an AI Trainer
Find AI training and data labeling projects across platforms, all in one place. One profile, one application process, more opportunities.