Demo Data from EDBT 2026 / reviewers in the wild / expert
Csaba Dékány
dblp:408/6587
· DBLP profile ↗
1ranked-venue papers
1as 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 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.
| Network and information security
1 paper |
Security and privacy of machine learning · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Security and privacy of machine learning
adversarial attack |
0.9 | 1 | 2025 | MixAT: Combining Continuous and Discrete Adversarial Training for LLMs · NeurIPS 2025 |
Security and privacy of machine learning
adversarial robustness |
0.9 | 1 | 2025 | MixAT: Combining Continuous and Discrete Adversarial Training for LLMs · NeurIPS 2025 |
Security and privacy of machine learning › adversarial robustness
adversarial training |
0.9 | 1 | 2025 | MixAT: Combining Continuous and Discrete Adversarial Training for LLMs · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
quantization · 0.9low-rank adapters · 0.9discrete attack · 0.9continuous relaxation · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | MixAT: Combining Continuous and Discrete Adversarial Training for LLMsabstractDespite recent efforts in Large Language Model (LLM) safety and alignment, current adversarial attacks on frontier LLMs can still consistently force harmful generations.
Although adversarial training has been widely studied and shown to significantly improve the robustness of traditional machine learning models, its strengths and weaknesses in the context of LLMs are less understood.
Specifically, while existing discrete adversarial attacks are effective at producing harmful content, training LLMs with concrete adversarial prompts is often computationally expensive, leading to reliance on continuous relaxations. At the same time, despite their effectiveness and generalization capabilities, training with continuous perturbations does not always capture the full spectrum of vulnerabilities exploited by discrete attacks. In this work, we aim to bridge this gap by introducing MIXAT, a novel method that combines stronger discrete and faster continuous attacks during training.
We rigorously evaluate MIXAT across a wide spectrum of state-of-the-art attacks, proposing the *At Least One Attack Success Rate* (ALO-ASR) metric to capture the worst-case vulnerability of models.
We show MIXAT achieves substantially better robustness (ALO-ASR $< 20\%$) compared to prior defenses (ALO-ASR $> 50\%$), while maintaining a runtime comparable to methods based on continuous relaxations.
We further analyze MIXAT in realistic deployment settings, exploring how chat templates, quantization, low-rank adapters, and temperature affect both adversarial training and evaluation, revealing additional blind spots in current methodologies.
Our results demonstrate that MIXAT discrete-continuous defense offers a principled and superior robustness-accuracy tradeoff with minimal computational overhead, highlighting its promise for building safer LLMs. We provide our code and models at https://github.com/insait-institute/MixAT. Csaba Dékány, Stefan Balauca, Dimitar I. Dimitrov, Robin Staab, Martin T. Vechev |
NeurIPS | 1 |