EDBT 2026 Demo / reviewers in the wild / expert
Pierre Lubitzsch
dblp:415/3724 · also Pierre Sicco Lubitzsch
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2026
0009-0002-4973-2328ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1 · 1 first-author · 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% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Recommender systems
collaborative filtering |
1.0 | 1 | 2026 | ERASE - A Real-World Aligned Benchmark for Unlearning in Recommender Systems · SIGIR 2026 |
Recommender systems
machine unlearning |
1.0 | 1 | 2026 | ERASE - A Real-World Aligned Benchmark for Unlearning in Recommender Systems · SIGIR 2026 |
Recommender systems
session-based recommendation |
0.3 | 1 | 2026 | ERASE - A Real-World Aligned Benchmark for Unlearning in Recommender Systems · SIGIR 2026 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | ERASE - A Real-World Aligned Benchmark for Unlearning in Recommender SystemsabstractMachine unlearning (MU) enables the removal of selected training data from models to address privacy compliance, security, and liability issues in recommender systems. Existing MU benchmarks poorly reflect real-world recommender settings: they focus primarily on collaborative filtering, assume unrealistically large deletion requests, and overlook practical constraints such as sequential unlearning and efficiency. We present ERASE, a large-scale benchmark for MU in recommender systems designed to align with real-world usage. ERASE spans three core tasks---collaborative filtering, session-based recommendation, and next-basket recommendation---and includes unlearning realistic scenarios such as sequentially removing sensitive interactions or spam. The benchmark covers seven unlearning algorithms, including general-purpose and recommender-specific methods, across nine public datasets and nine state-of-the-art models, producing over 600 GB of reusable artifacts, such as extensive logs and over a thousand model checkpoints. The artifacts that we release enable systematic analyses of where current unlearning methods succeed and where they fail. ERASE shows that approximate unlearning matches retraining in some settings, but robustness varies widely across datasets and architectures. Repeated unlearning exposes weaknesses in general-purpose methods, especially for attention-based and recurrent models, while recommender-specific approaches behave more reliably. ERASE offers an empirical basis for the community to assess, drive, and track progress toward practical MU in recommender systems. Pierre Lubitzsch, Maarten de Rijke, Sebastian Schelter |
SIGIR | 1 |