MUX selected as a spotlight at NeurIPS 2026
MUX: Continuous Reasoning via Multiplexed Tokens was accepted to NeurIPS 2026 as a spotlight paper.
News posts grouped by year.
MUX: Continuous Reasoning via Multiplexed Tokens was accepted to NeurIPS 2026 as a spotlight paper.
Our group website is live, with pages for our research, team, publications, and news.
A class-agnostic optimal-transport coupling for conditional flow models that consistently improves generation when combined with classifier-free guidance.
We released Wander, a single graph foundation model for node classification, link prediction, and knowledge-graph reasoning built on random walks.
Our paper RelAgent: LLM Agents as Data Scientists for Relational Learning was accepted to NeurIPS 2026.
Looped flows train recurrent models with local denoising objectives, so that extra computation at inference time can help solve harder problems.
İsmail gave talks and guest lectures on graph foundation models at the LOGML summer school, EPFL, the Wallenberg Advanced Scientific Forum, and Oxford.
A category-theoretic framework for the symmetries that LLM-based theorem provers should respect.
MUX compresses step-by-step reasoning of language models into continuous latent tokens that each multiplex a span of reasoning.
RelAgent uses LLM agents as data scientists for relational learning, producing predictors that are fast and interpretable.
Categorical Flow Maps and MacroGuide: Topological Guidance for Macrocycle Generation were accepted to ICML 2026.
Louis Tichelman and Angelo Gnazzo joined the group as PhD students at TU Wien.
Topological Flow Matching, HYPER, and Flock were accepted to ICLR 2026.
İsmail İlkan Ceylan was appointed Associate Professor at TU Wien.
One Model, Any Conjunctive Query: Graph Neural Networks for Answering Queries over Incomplete Knowledge Graphs was accepted to the Learning on Graphs Conference 2025.
Equivariance Everywhere All At Once and Curly Flow Matching were accepted to NeurIPS 2025.
Node classification reformulated as a tabular problem, so that tabular foundation models can classify nodes zero-shot.
İsmail joined TU Wien as Assistant Professor and AITHYRA as Adjunct PI, while remaining an Academic Member at the University of Oxford.
İsmail lectured on geometric deep learning with Michael Bronstein at the Sixth Annual Nepal AI School in Kathmandu.
How Expressive are Knowledge Graph Foundation Models? was accepted to ICML 2025.
Homomorphism Counts as Structural Encodings for Graph Learning was accepted to ICLR 2025.
Krzysztof Olejniczak's MSc thesis on answering conjunctive queries with graph neural networks was awarded the Gibbs Prize.
İsmail received a Department Teaching Commendation at the University of Oxford for the Graph Representation Learning course.
Oscar Davis received the Hoare Project Prize and Zeyang Zhao the Gibbs Prize for their MSc theses in the group.