Multi‐Task Sequential Recommendation Based on Gradient Segmentation

ABSTRACT In the real world, the interaction behaviors of users are not isolated. Instead, they occur continuously in a sequential manner. In the absence of project information, it is difficult for ordinary recommendation methods to predict their next interaction behavior, while sequential recommendation can capture the dynamic behavior of users to complete the recommendation task. Existing sequential recommendation methods generally capture more information about interactive sequences by adding auxiliary tasks for strengthening sequence representations. Despite their achievements, they are deficient in mining user‐user or item‐item multi‐level sequence information, and are not efficient in solving multi‐task optimization problems. To address the above issues, we propose gradient segmentation‐based multi‐task sequential recommendation (GS‐MTLSR). First, we cluster user interaction sequences, and then maximize the consistency between user sequence features and their corresponding behavior category features through contrastive learning. Second, we construct dynamic global graphs to capture global contextual information and enhance interaction item relationship information of the sequence through graph contrastive learning. For the optimization problem of multiple contrastive learning tasks, this paper adopts the gradient segmentation method to solve gradient conflicts to eliminate the negative cosine similarity between task optimization gradients. In this way, multiple contrastive learning tasks can be leveraged to the sequential recommendation (SR) model. Experimental results show that the recommendation accuracy of the GS‐MTLSR model achieves state‐of‐the‐art performance compared to other baseline models.

Authors

Institutions

Publication Details

Journal
Concurrency and Computation Practice and Experience
Published
2026-05-29
DOI
https://doi.org/10.1002/cpe.70759
Primary Topic
Recommender Systems and Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi‐Task Sequential Recommendation Based on Gradient Segmentation

R Wang, Ying Liu, Gang Tian
Concurrency and Computation Practice and Experience
Recommender Systems and Techniques
article

Multi‐Task Sequential Recommendation Based on Gradient Segmentation

R Wang, Ying Liu, Gang Tian
article en

Abstract

ABSTRACT In the real world, the interaction behaviors of users are not isolated. Instead, they occur continuously in a sequential manner. In the absence of project information, it is difficult for ordinary recommendation methods to predict their next interaction behavior, while sequential recommendation can capture the dynamic behavior of users to complete the recommendation task. Existing sequential recommendation methods generally capture more information about interactive sequences by adding auxiliary tasks for strengthening sequence representations. Despite their achievements, they are deficient in mining user‐user or item‐item multi‐level sequence information, and are not efficient in solving multi‐task optimization problems. To address the above issues, we propose gradient segmentation‐based multi‐task sequential recommendation (GS‐MTLSR). First, we cluster user interaction sequences, and then maximize the consistency between user sequence features and their corresponding behavior category features through contrastive learning. Second, we construct dynamic global graphs to capture global contextual information and enhance interaction item relationship information of the sequence through graph contrastive learning. For the optimization problem of multiple contrastive learning tasks, this paper adopts the gradient segmentation method to solve gradient conflicts to eliminate the negative cosine similarity between task optimization gradients. In this way, multiple contrastive learning tasks can be leveraged to the sequential recommendation (SR) model. Experimental results show that the recommendation accuracy of the GS‐MTLSR model achieves state‐of‐the‐art performance compared to other baseline models.

Concurrency and Computation Practice and ExperienceVol. 38(11)
Shandong University of Science and Technology (CN)
Openalex Percentile: Top 2%
Recommender Systems and Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.