Search Results for author: Pascal Welke

Found 10 papers, 4 papers with code

Weisfeiler and Leman Go Loopy: A New Hierarchy for Graph Representational Learning

1 code implementation20 Mar 2024 Raffaele Paolino, Sohir Maskey, Pascal Welke, Gitta Kutyniok

We introduce $r$-loopy Weisfeiler-Leman ($r$-$\ell{}$WL), a novel hierarchy of graph isomorphism tests and a corresponding GNN framework, $r$-$\ell{}$MPNN, that can count cycles up to length $r + 2$.

An Empirical Evaluation of the Rashomon Effect in Explainable Machine Learning

no code implementations27 Jun 2023 Sebastian Müller, Vanessa Toborek, Katharina Beckh, Matthias Jakobs, Christian Bauckhage, Pascal Welke

The Rashomon Effect describes the following phenomenon: for a given dataset there may exist many models with equally good performance but with different solution strategies.

Expectation-Complete Graph Representations with Homomorphisms

2 code implementations9 Jun 2023 Pascal Welke, Maximilian Thiessen, Fabian Jogl, Thomas Gärtner

We investigate novel random graph embeddings that can be computed in expected polynomial time and that are able to distinguish all non-isomorphic graphs in expectation.

Graph Learning

A New Aligned Simple German Corpus

1 code implementation2 Sep 2022 Vanessa Toborek, Moritz Busch, Malte Boßert, Christian Bauckhage, Pascal Welke

"Leichte Sprache", the German counterpart to Simple English, is a regulated language aiming to facilitate complex written language that would otherwise stay inaccessible to different groups of people.

Sentence

Hidden Schema Networks

no code implementations8 Jul 2022 Ramsés J. Sánchez, Lukas Conrads, Pascal Welke, Kostadin Cvejoski, César Ojeda

Large, pretrained language models infer powerful representations that encode rich semantic and syntactic content, albeit implicitly.

Decoder Language Modelling

Graph Filtration Kernels

no code implementations22 Oct 2021 Till Hendrik Schulz, Pascal Welke, Stefan Wrobel

The majority of popular graph kernels is based on the concept of Haussler's $\mathcal{R}$-convolution kernel and defines graph similarities in terms of mutual substructures.

A Generalized Weisfeiler-Lehman Graph Kernel

no code implementations20 Jan 2021 Till Hendrik Schulz, Tamás Horváth, Pascal Welke, Stefan Wrobel

The Weisfeiler-Lehman graph kernels are among the most prevalent graph kernels due to their remarkable time complexity and predictive performance.

Multiple Texts as a Limiting Factor in Online Learning: Quantifying (Dis-)similarities of Knowledge Networks across Languages

1 code implementation5 Aug 2020 Alexander Mehler, Wahed Hemati, Pascal Welke, Maxim Konca, Tolga Uslu

From the perspective of educational science, the article develops a computational model of the information landscape from which multiple texts are drawn as typical input of web-based reading.

Cannot find the paper you are looking for? You can Submit a new open access paper.