EDBT 2026 Demo / reviewers in the wild / expert
Animesh Jha
dblp:280/5382
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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.
| Artificial intelligence
1 paper |
Trustworthy machine learning · 100% | |
| Network and information security
1 paper |
Privacy and data protection · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning › machine unlearning
certified unlearning |
0.9 | 1 | 2025 | Certified Unlearning for Neural Networks · ICML 2025 |
Machine learning › Trustworthy machine learning
machine unlearning |
0.9 | 1 | 2025 | Certified Unlearning for Neural Networks · ICML 2025 |
Privacy and data protection › privacy regulation
right to be forgotten |
0.3 | 1 | 2025 | Certified Unlearning for Neural Networks · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
stochastic post-processing · 1.7privacy amplification · 1.7noisy fine-tuning · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Certified Unlearning for Neural NetworksabstractWe address the problem of machine unlearning, where the goal is to remove the influence of specific training data from a model upon request, motivated by privacy concerns and regulatory requirements such as the “right to be forgotten.” Unfortunately, existing methods rely on restrictive assumptions or lack formal guarantees.
To this end, we propose a novel method for certified machine unlearning, leveraging the connection between unlearning and privacy amplification by stochastic post-processing. Our method uses noisy fine-tuning on the retain data, i.e., data that does not need to be removed, to ensure provable unlearning guarantees. This approach requires no assumptions about the underlying loss function, making it broadly applicable across diverse settings. We analyze the theoretical trade-offs in efficiency and accuracy and demonstrate empirically that our method not only achieves formal unlearning guarantees but also performs effectively in practice, outperforming existing baselines. Anastasia Koloskova, Youssef Allouah, Animesh Jha, Rachid Guerraoui, Oluwasanmi Koyejo |
ICML | 3 |