activity
20172026
most citedEfficient Information Flow Maximization in Probabilistic Graphs

10 citations · 18 across the 13 of their papers we have counts for

collaborators
Showing cs.LGShow all

9 papers · 1 filter

cs.LG2026

When, Where, How: Active In-Context Learning for Tabular Foundation Models

Christian M. M. Frey

Tabular Foundation Models (TFMs) adapt to a new task only through the labeled rows in their context. However, labels are expensive to acquire in real-world scenarios due to the nee…

cs.LG2026

Learning to Order: Task Sequencing as In-Context Optimization

Jan Kobiolka, Christian Frey, Arlind Kadra +2

Task sequencing (TS) is one of the core open problems in Deep Learning, arising in a plethora of real-world domains, from robotic assembly lines to autonomous driving. Unfortunatel…

cs.LG2026

POP: Prior-Fitted First-Order Optimization Policies

Jan Kobiolka, Christian Frey, Gresa Shala +3

Gradient-based optimizers are highly sensitive to design choices in their adaptive learning rate mechanisms. To address this limitation, we introduce POP, a meta-learned Reinforcem…

cs.LG2026

End-to-End Compression for Tabular Foundation Models

Guri Zabërgja, Rafiq Kamel, Arlind Kadra +2

The long-standing dominance of gradient-boosted decision trees for tabular data has recently been challenged by in-context learning tabular foundation models. In-context learning m…

cs.LG2025

Towards Reproducibility in Predictive Process Mining: SPICE -- A Deep Learning Library

Oliver Stritzel, Nick Hühnerbein, Simon Rauch +5

In recent years, Predictive Process Mining (PPM) techniques based on artificial neural networks have evolved as a method for monitoring the future behavior of unfolding business pr…

cs.LG2025★ 1 cited

SHAining on Process Mining: Explaining Event Log Characteristics Impact on Algorithms

Andrea Maldonado, Christian M. M. Frey, Sai Anirudh Aryasomayajula +3

Process mining aims to extract and analyze insights from event logs, yet algorithm metric results vary widely depending on structural event log characteristics. Existing work often…

cs.LG2024★ 2 cited

Tabular Data: Is Deep Learning all you need?

Guri Zabërgja, Arlind Kadra, Christian M. M. Frey +1

Tabular data represent one of the most prevalent data formats in applied machine learning, largely because they accommodate a broad spectrum of real-world problems. Existing litera…

cs.LG2023★ 5 cited

DiffusAL: Coupling Active Learning with Graph Diffusion for Label-Efficient Node Classification

Sandra Gilhuber, Julian Busch, Daniel Rotthues +2

Node classification is one of the core tasks on attributed graphs, but successful graph learning solutions require sufficiently labeled data. To keep annotation costs low, active g…

cs.LG2021

SEA: Graph Shell Attention in Graph Neural Networks

Christian M. M. Frey, Yunpu Ma, Matthias Schubert

A common issue in Graph Neural Networks (GNNs) is known as over-smoothing. By increasing the number of iterations within the message-passing of GNNs, the nodes' representations of…