Demo Data from EDBT 2026 / reviewers in the wild / expert
Dingqi Liu
dblp:412/8418
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0009-0705-7513ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Recommender systems · 100% | |
| Network and information security
1 paper |
Security and privacy of machine learning · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Recommender systems
federated recommendation |
1.0 | 1 | 2026 | Spattack: Subgroup Poisoning Attacks on Federated Recommender Systems · WWW 2026 |
Recommender systems › federated recommendation
poisoning attack |
1.0 | 1 | 2026 | Spattack: Subgroup Poisoning Attacks on Federated Recommender Systems · WWW 2026 |
Security and privacy of machine learning › federated learning security
federated learning attack |
1.0 | 1 | 2026 | Spattack: Subgroup Poisoning Attacks on Federated Recommender Systems · WWW 2026 |
Recommender systems › trustworthy recommendation
privacy-preserving recommendation |
0.3 | 1 | 2026 | Spattack: Subgroup Poisoning Attacks on Federated Recommender Systems · WWW 2026 |
Methods — techniques the papers use, named apart from their topics
embedding approximation · 2.0contrastive learning · 2.0clustering · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Spattack: Subgroup Poisoning Attacks on Federated Recommender SystemsabstractFederated recommender systems (FedRec) have emerged as a promising approach to provide personalized recommendations while protecting user privacy. However, recent studies have demonstrated their vulnerability to poisoning attacks, wherein malicious clients can inject carefully crafted gradients to prompt target items to benign users. Existing attacks typically target the full user group, which compromises stealth and increases the risk of detection. In contrast, real-world adversaries may prefer to target specific user subgroup, such as promoting health supplements to older individual, to maximize attack success while preserving stealth to evade detection. Motivated by this gap, we introduce Spattack, the first poisoning attack designed to manipulate recommendations for specific user subgroups in federated setting. Specifically, Spattack adopts an approximate-and-promote paradigm, which first approximate user embeddings of target/non-target subgroups and then prompts target items to the target subgroups. We further reveal a trade-off in achieving strong attack performance on the target group while keeping the non-target group largely unaffected. To achieve a better trade-off, we propose enhanced approximation and promotion strategies. For the approximation, we push the embeddings of different subgroup away based on contrastive learning and augment the target group's relevant item set via clustering. For the promotion, we align target and relevant item embeddings to strengthen their semantic connections. An adaptive weighting strategy is further proposed to balance promotion effects between target and non-target subgroups. Experiments on three real-world datasets demonstrate that Spattack consistently achieves strong attack performance on the target subgroup with minimal impact on non-target users, even when only 0.1% of users are malicious. Moreover, Spattack maintains competitive recommendation performance and exhibits strong resilience against mainstream defenses. Bo Yan 0005, Yurong Hao, Dingqi Liu, Huabin Sun, Pengpeng Qiao, Wei Yang Bryan Lim, Yang Cao 0011, Chuan Shi 0001 |
WWW | 3 |