Demo Data from EDBT 2026 / reviewers in the wild / expert
Siteng Kang
dblp:229/4875
· DBLP profile ↗
3ranked-venue papers
1as first author
2since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Security and privacy · 1
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.
| Network and information security
2 papers |
Security and privacy of machine learning · 78% Cryptographic primitives and cryptanalysis · 22% | |
| Artificial intelligence
1 paper |
Learning paradigms · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Security and privacy of machine learning › adversarial attack
backdoor attack |
0.7 | 1 | 2023 | Poisoning Generative Replay in Continual Learning to Promote Forgetting · ICML 2023 |
Security and privacy of machine learning
poisoning attack |
0.7 | 1 | 2023 | Poisoning Generative Replay in Continual Learning to Promote Forgetting · ICML 2023 |
Cryptographic primitives and cryptanalysis › hash functions
memory-hard functions |
0.4 | 1 | 2019 | Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions · CRYPTO (2) 2019 |
Machine learning › Learning paradigms › continual learning › rehearsal-based continual learning
generative replay |
0.2 | 1 | 2023 | Poisoning Generative Replay in Continual Learning to Promote Forgetting · ICML 2023 |
Methods — techniques the papers use, named apart from their topics
input-aware trigger · 1.3dirty-label backdoor · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Offline Reward Perturbation Boosts Distributional Shift in Online RLabstractOffline-to-online reinforcement learning has recently been shown effective in reducing the online sample complexity by first training from offline collected data. However, this additional data source may also invite new poisoning attacks that target offline training. In this work, we reveal such vulnerabilities in critic-regularized offline RL by proposing a novel data poisoning attack method, which is stealthy in the sense that the performance during the offline training remains intact, but the online fine-tuning stage will suffer a significant performance drop. Our method leverages the techniques from bi-level optimization to promote the over-estimation/distribution shift under offline-to-online reinforcement learning. Experiments on four environments confirm the satisfaction of the new stealthiness requirement, and can be effective in attacking with only a small budget and without having white-box access to the victim model. Zishun Yu, Siteng Kang |
UAI | 2 |
| 2023 | Poisoning Generative Replay in Continual Learning to Promote ForgettingabstractGenerative models have grown into the workhorse of many state-of-the-art machine learning methods. However, their vulnerability under poisoning attacks has been largely understudied. In this work, we investigate this issue in the context of continual learning, where generative replayers are utilized to tackle catastrophic forgetting. By developing a novel customization of dirty-label input-aware backdoors to the online setting, our attacker manages to stealthily promote forgetting while retaining high accuracy at the current task and sustaining strong defenders. Our approach taps into an intriguing property of generative models, namely that they cannot well capture input-dependent triggers. Experiments on four standard datasets corroborate the poisoner's effectiveness. Siteng Kang |
ICML | 1 |
| 2019 | Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions
Jeremiah Blocki, Benjamin Harsha, Siteng Kang, Seunghoon Lee 0004, Samson Zhou |
CRYPTO (2) | 3 |