5 citations · 18 across the 18 of their papers we have counts for
18 papers
The Illusion of Certainty: Uncertainty Quantification for LLMs Fails under Ambiguity
Tim Tomov, Dominik Fuchsgruber, Tom Wollschläger +1
Accurate uncertainty quantification (UQ) in Large Language Models (LLMs) is critical for trustworthy deployment. While real-world language is inherently ambiguous, reflecting aleat…
Diffusion LLMs are Natural Adversaries for any LLM
David Lüdke, Tom Wollschläger, Paul Ungermann +2
We introduce a novel framework that transforms the resource-intensive (adversarial) prompt optimization problem into an \emph{efficient, amortized inference task}. Our core insight…
Uncertainty Estimation for Heterophilic Graphs Through the Lens of Information Theory
Dominik Fuchsgruber, Tom Wollschläger, Johannes Bordne +1
While uncertainty estimation for graphs recently gained traction, most methods rely on homophily and deteriorate in heterophilic settings. We address this by analyzing message pass…
REINFORCE Adversarial Attacks on Large Language Models: An Adaptive, Distributional, and Semantic Objective
Simon Geisler, Tom Wollschläger, M. H. I. Abdalla +3
To circumvent the alignment of large language models (LLMs), current optimization-based adversarial attacks usually craft adversarial prompts by maximizing the likelihood of a so-c…
Adversarial Alignment for LLMs Requires Simpler, Reproducible, and More Measurable Objectives
Leo Schwinn, Yan Scholten, Tom Wollschläger +4
Misaligned research objectives have considerably hindered progress in adversarial robustness research over the past decade. For instance, an extensive focus on optimizing target me…
The Geometry of Refusal in Large Language Models: Concept Cones and Representational Independence
Tom Wollschläger, Jannes Elstner, Simon Geisler +3
The safety alignment of large language models (LLMs) can be circumvented through adversarially crafted inputs, yet the mechanisms by which these attacks bypass safety barriers rema…
Certifiably Robust Encoding Schemes
Aman Saxena, Tom Wollschläger, Nicola Franco +2
Quantum machine learning uses principles from quantum mechanics to process data, offering potential advances in speed and performance. However, previous work has shown that these m…
Discrete Randomized Smoothing Meets Quantum Computing
Tom Wollschläger, Aman Saxena, Nicola Franco +2
Breakthroughs in machine learning (ML) and advances in quantum computing (QC) drive the interdisciplinary field of quantum machine learning to new levels. However, due to the susce…
Expressivity and Generalization: Fragment-Biases for Molecular GNNs
Tom Wollschläger, Niklas Kemper, Leon Hetzel +2
Although recent advances in higher-order Graph Neural Networks (GNNs) improve the theoretical expressiveness and molecular property predictive performance, they often fall short of…
Lift Your Molecules: Molecular Graph Generation in Latent Euclidean Space
Mohamed Amine Ketata, Nicholas Gao, Johanna Sommer +2
We introduce a new framework for molecular graph generation with 3D molecular generative models. Our Synthetic Coordinate Embedding (SyCo) framework maps molecular graphs to Euclid…
Energy-based Epistemic Uncertainty for Graph Neural Networks
Dominik Fuchsgruber, Tom Wollschläger, Stephan Günnemann
In domains with interdependent data, such as graphs, quantifying the epistemic uncertainty of a Graph Neural Network (GNN) is challenging as uncertainty can arise at different stru…
Uncertainty for Active Learning on Graphs
Dominik Fuchsgruber, Tom Wollschläger, Bertrand Charpentier +2
Uncertainty Sampling is an Active Learning strategy that aims to improve the data efficiency of machine learning models by iteratively acquiring labels of data points with the high…
Attacking Large Language Models with Projected Gradient Descent
Simon Geisler, Tom Wollschläger, M. H. I. Abdalla +2
Current LLM alignment methods are readily broken through specifically crafted adversarial prompts. While crafting adversarial prompts using discrete optimization is highly effectiv…
Expressivity of Graph Neural Networks Through the Lens of Adversarial Robustness
Francesco Campi, Lukas Gosch, Tom Wollschläger +2
We perform the first adversarial robustness study into Graph Neural Networks (GNNs) that are provably more powerful than traditional Message Passing Neural Networks (MPNNs). In par…
Uncertainty Estimation for Molecules: Desiderata and Methods
Tom Wollschläger, Nicholas Gao, Bertrand Charpentier +2
Graph Neural Networks (GNNs) are promising surrogates for quantum mechanical calculations as they establish unprecedented low errors on collections of molecular dynamics (MD) traje…
Efficient MILP Decomposition in Quantum Computing for ReLU Network Robustness
Nicola Franco, Tom Wollschläger, Benedikt Poggel +2
Emerging quantum computing technologies, such as Noisy Intermediate-Scale Quantum (NISQ) devices, offer potential advancements in solving mathematical optimization problems. Howeve…
Localized Randomized Smoothing for Collective Robustness Certification
Jan Schuchardt, Tom Wollschläger, Aleksandar Bojchevski +1
Models for image segmentation, node classification and many other tasks map a single input to multiple labels. By perturbing this single shared input (e.g. the image) an adversary…
Quantum Robustness Verification: A Hybrid Quantum-Classical Neural Network Certification Algorithm
Nicola Franco, Tom Wollschlaeger, Nicholas Gao +2
In recent years, quantum computers and algorithms have made significant progress indicating the prospective importance of quantum computing (QC). Especially combinatorial optimizat…