← Search

Frederik Wenkel

7 accepted papers

2026

Can Computational Reducibility Lead to Transferable Models for Graph Combinatorial Optimization?

ICML 2026poster

A key challenge in deriving unified neural solvers for combinatorial optimization (CO) is efficient generalization of models between one set of tasks to new tasks not used during the initial training process. To address it, we first establish a new model, which uses a GCON module as a form of expres…

Cited by 0SourceScholar
2024

How Molecules Impact Cells: Unlocking Contrastive PhenoMolecular Retrieval

NeurIPS 2024poster

Predicting molecular impact on cellular function is a core challenge in therapeutic design. Phenomic experiments, designed to capture cellular morphology, utilize microscopy based techniques and demonstrate a high throughput solution for uncovering molecular impact on the cell. In this work, we lear…

Cited by 2SourcePDFScholar
2024

On the Scalability of GNNs for Molecular Graphs

NeurIPS 2024poster

Scaling deep learning models has been at the heart of recent revolutions in language modelling and image generation. Practitioners have observed a strong relationship between model size, dataset size, and performance. However, structure-based architectures such as Graph Neural Networks (GNNs) are ye…

Cited by 12SourcePDFScholar
2024

Towards Foundational Models for Molecular Learning on Large-Scale Multi-Task Datasets

ICLR 2024poster

Recently, pre-trained foundation models have enabled significant advancements in multiple fields. In molecular machine learning, however, where datasets are often hand-curated, and hence typically small, the lack of datasets with labeled features, and codebases to manage those datasets, has hindered…

2022

Can Hybrid Geometric Scattering Networks Help Solve the Maximum Clique Problem?

NeurIPS 2022accept

We propose a geometric scattering-based graph neural network (GNN) for approximating solutions of the NP-hard maximum clique (MC) problem. We construct a loss function with two terms, one which encourages the network to find highly connected nodes and the other which acts as a surrogate for the cons…

2020

Scattering GCN: Overcoming Oversmoothness in Graph Convolutional Networks

NeurIPS 2020poster

Graph convolutional networks (GCNs) have shown promising results in processing graph data by extracting structure-aware features. This gave rise to extensive work in geometric deep learning, focusing on designing network architectures that ensure neuron activations conform to regularity patterns wit…