Skip to content
Open access

SeGMA4Rec: Learning stable sequential representations through semantic graph propagation and hierarchical contrastive alignment.

Aug 2026 · Neural Networks · Vol 205 Pt C, pp. 109526 · 0 citations · 57 references
Medicine

TL;DR

Semantic Global Graph with Multi-layer Alignment for Recommendation (SeGMA4Rec), which combines item-level semantic enrichment with sequence-level hierarchical regularization, is proposed and achieves strong and generally superior performance over competitive baselines.

Abstract

Deep sequential encoders such as Transformers are widely used for modeling user behavior in sequential recommendation, yet their effectiveness can be limited when interaction sequences are short and sparse. In such settings, insufficient behavioral evidence makes it difficult to learn reliable representations. Existing contrastive learning methods provide useful auxiliary supervision, but they often rely on random sequence perturbations that may remove informative interactions and typically apply contrastive objectives only to the final encoder layer. Moreover, interaction-based models cannot fully capture global semantic relations among items that rarely or never co-occur. To address these limitations, we propose Semantic Global Graph with Multi-layer Alignment for Recommendation (SeGMA4Rec), which combines item-level semantic enrichment with sequence-level hierarchical regularization. SeGMA4Rec constructs a semantic item graph from pretrained textual embeddings, adaptively refines the retained edge weights, and propagates task-relevant information among related items. The graph-enhanced item representations are then processed by a sequential encoder whose attention scores guide probabilistic view generation toward retaining informative interactions. Three contrastive objectives further align representations across augmented views and encoder layers, providing direct regularization at multiple depths. Experiments on four benchmark datasets show that SeGMA4Rec achieves strong and generally superior performance over competitive baselines, including improvements of up to 9.9% in Recall@10 and 8.1% in NDCG@10 on ML-1M. Additional analyses confirm the complementary contributions of semantic graph propagation, adaptive edge refinement, attention-guided augmentation, and multi-layer contrastive alignment.

Read PDF

Similar papers

Oct 2026

Semantic Augmented Multiview Graph Learning With Frequency-Aware Propagation for Recommendation

Graph neural networks (GNNs) have been widely adopted in collaborative filtering to model higher order relationships between users and items. However, existing methods mainly focus on interaction-based structures and neglect the explicit modeling of semantic relations among users and among items. Within these graph str...

Yi-Xin Liu, Yu Zhang, Lei Sang et al. · 0 citations
Review Open access Sep 2026

LRGCL: LLM-refined graph contrastive learning for review-based recommendation

LRGCL is proposed, an LLM-Refined Graph Contrastive Learning model for personalized recommendation that introduces a semantic-preserving contrastive objective in which key interaction edges are identified and preserved in augmented graph views, while only non-critical edges are dropped.

Li-Ye Shi, Peng-Fei Shao, Shao-Zhong Zhang et al. · 0 citations
Preprint Aug 2026

POI Recommendation with LLM-Augmented Multi-Graph Learning and Contrastive Alignment

The proposed LLM-augmented Multi-Graph Contrastive Learning (LLM-MGCL) is a multi-graph neural network that uses semantic and spatial information about items to extend the LightGCN backbone with two auxiliary item-item graphs that outperforms classical collaborative filtering, matrix factorization, and interaction-only...

Burak Tamer, W. Höpken, Zehui Wang · 0 citations
Oct 2026

Pairwise Uncertainty-Based Graph Contrastive Learning

Currently, vanilla graph contrastive learning (GCL) has become the mainstream paradigm for learning discriminative node representations in unsupervised settings. However, its performance is limited by two issues. First, traditional graph augmentation strategies lack awareness of edge semantic relationships, which may c...

Cheng-Cheng Xu, Tian-Feng Wang, Bin Sun et al. · 0 citations
Preprint Oct 2026

SheafPrune: Sheaf-Guided Graph Propagation for Visual Token Pruning

Multimodal large language models process the complete visual token sequence, increasing prefill cost even when many tokens are irrelevant to the instruction. Token-wise saliency captures limited inter-token dependence; graph-based selection instead depends on how relations govern importance propagation and ranking. We...

Xiao-Yang Ma, Chi Wang, Hong Sun · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.