Handling data sparsity and model poisoning attacks in federated sequential recommender systems

• Multi-view contrastive learning overcomes data sparsity • Temporal regularisation stabilises user preferences across sequences • Popularity-aware defence mitigates promotion and camouflage attacks • Achieves stable performance within ± 1% even with 80% malicious clients • Maintain 90% of original user accuracy even when cold-start Federated sequential recommendation (FedSeqRec) allows many user devices to train a shared recommender without sending raw interaction histories to a central server, which is important for privacy. However, existing FedSeqRec methods still suffer from two key limitations: (1) most users have very short or sparse histories, especially when they only show interest in a few items for a short period, leaving the model with too little data to understand their preferences; and (2) in a sequential setting it is normal for interests to change suddenly, but the model may misinterpret these abrupt changes as anomalies. In this paper, we propose FORTRESS , a F ederated c O ntrastive R obus T RE commender for S equential S ystems, designed to address these limitations. To tackle the first issue, FORTRESS generates augmented versions of local interaction sequences on each client, so that the model can observe more plausible behaviour patterns and learn user preferences more reliably even when histories are short or sparse. This extra flexibility also gives adversaries more room to manipulate the training signal, so we complement it with a popularity-aware server-side regularizer that discourages rare or suspicious items from drifting into the same embedding clusters as genuinely popular items. To tackle the second issue, we introduce a temporal regularization term that discourages abrupt changes in user representations across adjacent subsequences, allowing the model to adapt to short-term interest shifts while still preserving stable long-term tastes. Experiments on three real-world datasets show that FORTRESS improves recommendation accuracy for sparse and cold-start users and substantially reduces the success of strong model poisoning attacks compared with competitive centralized and federated baselines.

Authors

Institutions

Publication Details

Journal
Knowledge-Based Systems
Published
2026-02-12
DOI
https://doi.org/10.1016/j.knosys.2026.115545
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

Handling data sparsity and model poisoning attacks in federated sequential recommender systems

Duc Anh Nguyen, Hongzhi Yin, Minh Hieu Nguyen, Quoc Viet Hung Nguyen et al.
Knowledge-Based Systems
Recommender Systems and Techniques
article

Handling data sparsity and model poisoning attacks in federated sequential recommender systems

Duc Anh Nguyen, Hongzhi Yin, Minh Hieu Nguyen, Quoc Viet Hung Nguyen, Jun Jo, Thanh Tam Nguyen
article en

Abstract

• Multi-view contrastive learning overcomes data sparsity • Temporal regularisation stabilises user preferences across sequences • Popularity-aware defence mitigates promotion and camouflage attacks • Achieves stable performance within ± 1% even with 80% malicious clients • Maintain 90% of original user accuracy even when cold-start Federated sequential recommendation (FedSeqRec) allows many user devices to train a shared recommender without sending raw interaction histories to a central server, which is important for privacy. However, existing FedSeqRec methods still suffer from two key limitations: (1) most users have very short or sparse histories, especially when they only show interest in a few items for a short period, leaving the model with too little data to understand their preferences; and (2) in a sequential setting it is normal for interests to change suddenly, but the model may misinterpret these abrupt changes as anomalies. In this paper, we propose FORTRESS , a F ederated c O ntrastive R obus T RE commender for S equential S ystems, designed to address these limitations. To tackle the first issue, FORTRESS generates augmented versions of local interaction sequences on each client, so that the model can observe more plausible behaviour patterns and learn user preferences more reliably even when histories are short or sparse. This extra flexibility also gives adversaries more room to manipulate the training signal, so we complement it with a popularity-aware server-side regularizer that discourages rare or suspicious items from drifting into the same embedding clusters as genuinely popular items. To tackle the second issue, we introduce a temporal regularization term that discourages abrupt changes in user representations across adjacent subsequences, allowing the model to adapt to short-term interest shifts while still preserving stable long-term tastes. Experiments on three real-world datasets show that FORTRESS improves recommendation accuracy for sparse and cold-start users and substantially reduces the success of strong model poisoning attacks compared with competitive centralized and federated baselines.

Knowledge-Based SystemsVol. 338
Griffith University (AU), The University of Queensland (AU), Hanoi University of Science and Technology (VN)
Openalex Percentile: Top 70%
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.