Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Paul Krzakala

dblp:303/4319 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Graph learning · 83% Optimization for machine learning · 13% Deep learning architectures and training · 4%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph autoencoder
0.912025
The quest for the GRAph Level autoEncoder (GRALE) · NeurIPS 2025
Machine learning › Graph learning
graph decoding
0.912025
The quest for the GRAph Level autoEncoder (GRALE) · NeurIPS 2025
Machine learning › Graph learning
graph generation
0.912025
The quest for the GRAph Level autoEncoder (GRALE) · NeurIPS 2025
Machine learning › Graph learning
graph representation learning
0.912025
The quest for the GRAph Level autoEncoder (GRALE) · NeurIPS 2025
Machine learning › Graph learning
graph matching
0.812024
Any2Graph: Deep End-To-End Supervised Graph Prediction With An Optimal Transport Loss · NeurIPS 2024
Machine learning › Graph learning › graph inference
graph prediction
0.812024
Any2Graph: Deep End-To-End Supervised Graph Prediction With An Optimal Transport Loss · NeurIPS 2024
Machine learning › Optimization for machine learning › optimal transport
gromov-wasserstein distance
0.812024
Any2Graph: Deep End-To-End Supervised Graph Prediction With An Optimal Transport Loss · NeurIPS 2024
Machine learning › Deep learning architectures and training
autoencoder
0.312025
The quest for the GRAph Level autoEncoder (GRALE) · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

optimal transport · 1.6evoformer · 0.9attention mechanism · 0.9deep learning · 0.8
YearPublicationVenuePosition
2025 The quest for the GRAph Level autoEncoder (GRALE)
abstract
Although graph-based learning has attracted a lot of attention, graph representation learning is still a challenging task whose resolution may impact key application fields such as chemistry or biology. To this end, we introduce GRALE, a novel graph autoencoder that encodes and decodes graphs of varying sizes into a shared embedding space. GRALE is trained using an Optimal Transport-inspired loss that compares the source and reconstructed graphs and leverages a differentiable matching module, which is trained jointly with the encoder and decoder. The proposed attention-based architecture relies on Evoformer, the core component of AlphaFold, which we extend to support both graph encoding and decoding. We show, in numerical experiments on simulated and molecular data, that GRALE enables a highly general form of pre-training, applicable to a wide range of downstream tasks, from classification and regression to more complex tasks such as graph interpolation, editing, matching, and prediction.
Paul Krzakala, Gabriel Melo, Charlotte Laclau, Florence d'Alché-Buc, Rémi Flamary
NeurIPS1
2024 Any2Graph: Deep End-To-End Supervised Graph Prediction With An Optimal Transport Loss
abstract
We propose Any2graph, a generic framework for end-to-end Supervised Graph Prediction (SGP) i.e. a deep learning model that predicts an entire graph for any kind of input. The framework is built on a novel Optimal Transport loss, the Partially-Masked Fused Gromov-Wasserstein, that exhibits all necessary properties (permutation invariance, differentiability and scalability) and is designed to handle any-sized graphs. Numerical experiments showcase the versatility of the approach that outperform existing competitors on a novel challenging synthetic dataset and a variety of real-world tasks such as map construction from satellite image (Sat2Graph) or molecule prediction from fingerprint (Fingerprint2Graph).
Paul Krzakala, Rémi Flamary, Florence d'Alché-Buc, Charlotte Laclau, Matthieu Labeau
NeurIPS1