TagRec: Temporal-Aware Graph Contrastive Learning with Theoretical Augmentation for Sequential Recommendation

Venue: IEEE KDE 2025 Source: IEEE Xplore Category: Sequential Recommendation

Overview

TagRec addresses sequential recommendation by combining temporal-aware graph contrastive learning with theoretically justified augmentation. It targets the core challenges of large-scale search, recommendation, and personalization systems: efficiency, scalability, and user intent understanding. Traditional pipeline methods that isolate retrieval, ranking, and generation struggle in the LLM era, where users expect natural language interaction, multi-hop reasoning, and real-time knowledge.

Key points

• Proposes a unified view for the problem domain, bringing scattered related work into a comparable framework.
• Decomposes method components (representation learning, retriever, reranker, planner, generator, feedback mechanisms) for easier engineering adoption.
• Provides reproducible benchmark protocols, datasets, or taxonomy tables, lowering the entry cost for follow-up researchers.
• Discusses interfaces with emerging paradigms such as LLM tool calling, reinforcement learning, and multi-agent collaboration.
• Lists open problems: evaluation trustworthiness, latency and cost, hallucination and safety, cross-lingual and multimodal extension.

Method outline

The typical pipeline is: problem formalization → model/system design → training/construction process → inference pipeline.

1. Input & representation: encode queries, documents, and user context into dense or sparse representations, or structured prompts. 2. Core modules: retriever, reranker, planner, memory modules, tool interfaces — chained or parallel per task. 3. Learning strategies: supervised fine-tuning, contrastive learning, distillation, reinforcement learning (including process rewards), bootstrapped data synthesis. 4. Inference strategies: single-round retrieval, iterative retrieval, parallel sub-queries, early stopping and budget control.

Evaluation

Typical experimental design in this research line includes:

• Datasets: MS MARCO, BEIR, Natural Questions, domain corpora, public recommendation datasets.
• Metrics: nDCG@10, MRR, Recall@k, Hit@k, human preference, task success rate, latency, token cost.
• Baselines: BM25, dense retrieval, cross-encoder reranking, retrieval-free LLMs, commercial search APIs.
• Ablations: contribution of retrieval steps, reranking depth, and training data scale.

Specific numerical results should be verified against the original PDF tables; this entry is based on the abstract and public metadata.

Insights for search / recommendation / personalization

1. Architecture: cascaded retrieval + reranking + generation remains mainstream, but agentic paradigms are making retrieval count and strategy themselves learnable. 2. Data: high-quality instruction data and click/session logs are both critical; synthetic data must guard against knowledge leakage and distribution shift. 3. Evaluation: the gap between offline metrics and online satisfaction is widening; LLM-as-judge needs cross-validation with human evaluation. 4. Product: latency, cost, explainability, and safety policies are hard constraints for industrial deployment — not just academic benchmark optimization.

Related entries

• BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations
• EAGER: Two-Stream Generative Recommender with Behavior-Semantic Collaboration
• Efficient On-Device Session-Based Recommendation
• How to Index Item IDs for Recommendation Foundation Models (P5, SIGIR)
• LLMCDSR: Enhancing Cross-Domain Sequential Recommendation with LLMs
• Mamba4Rec: Efficient Sequential Recommendation with Selective State Space Models

Glossary

| Term | Meaning | |------|---------| | IR | Information Retrieval | | RAG | Retrieval-Augmented Generation | | LTR | Learning to Rank | | nDCG | Normalized Discounted Cumulative Gain | | Agentic Search | Modeling search as sequential decision-making and tool calling | | Gen-IR | Generative Information Retrieval |