activity
20142026
most citedAdversarial Attacks on Neural Networks for Graph Data

1k citations · 4.2k across the 120 of their papers we have counts for

collaborators
Showing 2026Show all

11 papers · 1 filter

cs.LG2026

Reliability Scaling Laws for Quantized Large Language Models

Sirine Ayadi, Sándor Daróczi, Stephan Günnemann +1

Quantization is a powerful strategy to build capable and resource-efficient large language models (LLMs) by reducing the bitwidth of the parameters. While quantized LLMs achieve st…

cs.CR2026

All you need to break LLMs are Black-Box, Adapting, Efficient, Transferable, Harmful, Applicable ... Attacks

Vincent Limbach, Jonas Dornbusch, David Lüdke +2

Accurately evaluating adversarial robustness is a longstanding challenge. A flawed attack design can inflate robustness estimates, making deployment risk assessment and defense com…

cs.LG2026

Speculative Sampling For Faster Molecular Dynamics

Arthur Kosmala, Stephan Günnemann, Meng Gao +1

Molecular dynamics (MD) is a key tool for simulating the dynamical behavior of atomic systems. However, MD is inherently serial, which makes it difficult to increase single-system…

cs.LG2026

Provable Robustness against Backdoor Attacks via the Primal-Dual Perspective on Differential Privacy

Aman Saxena, Jan Schuchardt, Yan Scholten +1

Randomized smoothing is a powerful tool for certifying robustness to adversarial perturbations, including poisoning attacks via randomized training and evasion attacks via randomiz…

cs.LG2026

Interpolating Discrete Diffusion Models with Controllable Resampling

Marcel Kollovieh, Sirine Ayadi, Stephan Günnemann

Discrete diffusion models form a powerful class of generative models across diverse domains, including text and graphs. However, existing approaches face fundamental limitations. M…

cs.LG2026

Exact Certification of Neural Networks and Partition Aggregation Ensembles against Label Poisoning

Ajinkya Mohgaonkar, Lukas Gosch, Mahalakshmi Sabanayagam +2

Label-flipping attacks, which corrupt training labels to induce misclassifications at inference, remain a major threat to supervised learning models. This drives the need for robus…

cs.LG2026

Amplified Patch-Level Differential Privacy for Free via Random Cropping

Kaan Durmaz, Jan Schuchardt, Sebastian Schmidt +1

Random cropping is one of the most common data augmentation techniques in computer vision, yet the role of its inherent randomness in training differentially private machine learni…

cs.LG2026

Closing the Distribution Gap in Adversarial Training for LLMs

Chengzhi Hu, Jonas Dornbusch, David Lüdke +2

Adversarial training for LLMs is one of the most promising methods to reliably improve robustness against adversaries. However, despite significant progress, models remain vulnerab…

cs.LG2026

Flow-Based Density Ratio Estimation for Intractable Distributions with Applications in Genomics

Egor Antipov, Alessandro Palma, Lorenzo Consoli +3

Estimating density ratios between pairs of intractable data distributions is a core problem in probabilistic modeling, enabling principled comparisons of sample likelihoods under d…

cs.LG2026

3D Molecule Generation from Rigid Motifs via SE(3) Flows

Roman Poletukhin, Marcel Kollovieh, Eike Eberhard +1

Three-dimensional molecular structure generation is typically performed at the level of individual atoms, yet molecular graph generation techniques often consider fragments as thei…

cs.LG2026

Task-Awareness Improves LLM Generations and Uncertainty

Tim Tomov, Dominik Fuchsgruber, Stephan Günnemann

In many applications of LLMs, natural language responses often have an underlying structure such as representing discrete labels, numerical values, or graphs. Yet, existing decodin…