25 citations · 135 across the 25 of their papers we have counts for
8 papers · 1 filter
Gumbel-MPNN: Graph Rewiring with Gumbel-Softmax
Marcel Hoffmann, Lukas Galke, Ansgar Scherp
Graph homophily has been considered an essential property for message-passing neural networks (MPNN) in node classification. Recent findings suggest that performance is more closel…
A Transformer-based Autoregressive Decoder Architecture for Hierarchical Text Classification
Younes Yousef, Lukas Galke, Ansgar Scherp
Recent approaches in hierarchical text classification (HTC) rely on the capabilities of a pre-trained transformer model and exploit the label semantics and a graph encoder for the…
When are 1.58 bits enough? A Bottom-up Exploration of BitNet Quantization
Jacob Nielsen, Lukas Galke, Peter Schneider-Kamp
Contemporary machine learning models, such as language models, are powerful, but come with immense resource requirements both at training and inference time. It has been shown that…
POWN: Prototypical Open-World Node Classification
Marcel Hoffmann, Lukas Galke, Ansgar Scherp
We consider the problem of \textit{true} open-world semi-supervised node classification, in which nodes in a graph either belong to known or new classes, with the latter not presen…
Open-World Lifelong Graph Learning
Marcel Hoffmann, Lukas Galke, Ansgar Scherp
We study the problem of lifelong graph learning in an open-world scenario, where a model needs to deal with new tasks and potentially unknown classes. We utilize Out-of-Distributio…
Lifelong Learning on Evolving Graphs Under the Constraints of Imbalanced Classes and New Classes
Lukas Galke, Iacopo Vagliano, Benedikt Franke +3
Lifelong graph learning deals with the problem of continually adapting graph neural network (GNN) models to changes in evolving graphs. We address two critical challenges of lifelo…
Lifelong Learning of Graph Neural Networks for Open-World Node Classification
Lukas Galke, Benedikt Franke, Tobias Zielke +1
Graph neural networks (GNNs) have emerged as the standard method for numerous tasks on graph-structured data such as node classification. However, real-world graphs are often evolv…
Can Graph Neural Networks Go "Online"? An Analysis of Pretraining and Inference
Lukas Galke, Iacopo Vagliano, Ansgar Scherp
Large-scale graph data in real-world applications is often not static but dynamic, i. e., new nodes and edges appear over time. Current graph convolution approaches are promising,…