activity
20202026
most citedA Novel Higher-order Weisfeiler-Lehman Graph Convolution

4 citations · 5 across the 6 of their papers we have counts for

collaborators

7 papers

cs.LG2026

Unification and Optimization of Robust Supervised Learning

Jonas Hanselle, Valentin Margraf, Clemens Damke +1

Robust learning methods such as distributionally robust optimization, vicinal risk minimization, Mixup, and label smoothing address different sources of uncertainty, including dist…

cs.LG2025★ 1 cited

Distribution Matching for Graph Quantification Under Structural Covariate Shift

Clemens Damke, Eyke Hüllermeier

Graphs are commonly used in machine learning to model relationships between instances. Consider the task of predicting the political preferences of users in a social network; to so…

cs.LG2025

Adjusted Count Quantification Learning on Graphs

Clemens Damke, Eyke Hüllermeier

Quantification learning is the task of predicting the label distribution of a set of instances. We study this problem in the context of graph-structured data, where the instances a…

cs.LG2024

CUQ-GNN: Committee-based Graph Uncertainty Quantification using Posterior Networks

Clemens Damke, Eyke Hüllermeier

In this work, we study the influence of domain-specific characteristics when defining a meaningful notion of predictive uncertainty on graph data. Previously, the so-called Graph P…

cs.LG2024

Linear Opinion Pooling for Uncertainty Quantification on Graphs

Clemens Damke, Eyke Hüllermeier

We address the problem of uncertainty quantification for graph-structured data, or, more specifically, the problem to quantify the predictive uncertainty in (semi-supervised) node…

cs.SE2023

UNGOML: Automated Classification of unsafe Usages in Go

Anna-Katharina Wickert, Clemens Damke, Lars Baumgärtner +2

The Go programming language offers strong protection from memory corruption. As an escape hatch of these protections, it provides the unsafe package. Previous studies identified th…

cs.LG2020★ 4 cited

A Novel Higher-order Weisfeiler-Lehman Graph Convolution

Clemens Damke, Vitalik Melnikov, Eyke Hüllermeier

Current GNN architectures use a vertex neighborhood aggregation scheme, which limits their discriminative power to that of the 1-dimensional Weisfeiler-Lehman (WL) graph isomorphis…