Demo Data from EDBT 2026 / reviewers in the wild / expert
Abhinav Vemulapalli
dblp:420/7865
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0001-7873-2389ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 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.
| Network and information security
1 paper |
Security and privacy of machine learning · 100% | |
| Artificial intelligence
1 paper |
Efficient and distributed learning · 77% Trustworthy machine learning · 23% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › automated machine learning › neural architecture search › one-shot neural architecture search
weight-sharing supernet |
0.9 | 1 | 2025 | VillainNet: Targeted Poisoning Attacks Against SuperNets Along the Accuracy-Latency Pareto Frontier · CCS 2025 |
Security and privacy of machine learning › adversarial attack
backdoor attack |
0.9 | 1 | 2025 | VillainNet: Targeted Poisoning Attacks Against SuperNets Along the Accuracy-Latency Pareto Frontier · CCS 2025 |
Security and privacy of machine learning › adversarial attack › backdoor attack
targeted poisoning attack |
0.9 | 1 | 2025 | VillainNet: Targeted Poisoning Attacks Against SuperNets Along the Accuracy-Latency Pareto Frontier · CCS 2025 |
Machine learning › Trustworthy machine learning
robustness |
0.3 | 1 | 2025 | VillainNet: Targeted Poisoning Attacks Against SuperNets Along the Accuracy-Latency Pareto Frontier · CCS 2025 |
Methods — techniques the papers use, named apart from their topics
poisoning · 1.7distance-aware optimization · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | VillainNet: Targeted Poisoning Attacks Against SuperNets Along the Accuracy-Latency Pareto FrontierabstractState-of-the-art (SOTA) weight-shared SuperNets dynamically activate subnetworks at runtime, enabling robust adaptive inference under varying deployment conditions. However, we find that adversaries can take advantage of the unique training and inference paradigms of SuperNets to selectively implant backdoors that activate only within specific subnetworks, remaining dormant across billions of other subnetworks. We present VillainNet (VNET), a novel poisoning methodology that restricts backdoor activation to attacker-chosen subnetworks, tailored either to specific operational scenarios (e.g., specific vehicle speeds or weather conditions) or to specific subnetwork configurations. VNET's core innovation is a novel, distance-aware optimization process that leverages architectural and computational similarity metrics between subnetworks to ensure that backdoor activation does not occur across non-target subnetworks. This forces defenders to confront a dramatically expanded search space for backdoor detection. We show that across two SOTA SuperNets, trained on the CIFAR10 and GTSRB datasets, VNET can achieve attack success rates comparable to traditional poisoning approaches (approximately 99%), while significantly lowering the chances of attack detection, thereby stealthily hiding the attack. Consequently, defenders face increased computational burdens, requiring on average 66 (and up to 250 for highly targeted attacks) sampled subnetworks to detect the attack, implying a roughly 66-fold increase in compute cost required to test the SuperNet for backdoors. David Oygenblik, Abhinav Vemulapalli, Animesh Agrawal, Debopam Sanyal, Alexey Tumanov, Brendan Saltaformaggio |
CCS | 2 |