Demo Data from EDBT 2026 / reviewers in the wild / expert
Seokhyun Moon
dblp:241/9786
· DBLP profile ↗
2ranked-venue papers
0as 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 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 |
Generative modeling · 59% Graph learning · 31% 3D vision · 9% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling
diffusion model |
0.9 | 1 | 2025 | Discrete Diffusion Schrödinger Bridge Matching for Graph Transformation · ICLR 2025 |
Machine learning › Generative modeling › diffusion model
discrete diffusion model |
0.9 | 1 | 2025 | Discrete Diffusion Schrödinger Bridge Matching for Graph Transformation · ICLR 2025 |
Machine learning › Graph learning
graph generation |
0.9 | 1 | 2025 | Discrete Diffusion Schrödinger Bridge Matching for Graph Transformation · ICLR 2025 |
Machine learning › Generative modeling › molecular generation
molecular optimization |
0.9 | 1 | 2025 | Discrete Diffusion Schrödinger Bridge Matching for Graph Transformation · ICLR 2025 |
Machine learning › Generative modeling › diffusion model › diffusion bridge
schrödinger bridge matching |
0.9 | 1 | 2025 | Discrete Diffusion Schrödinger Bridge Matching for Graph Transformation · ICLR 2025 |
Machine learning › Graph learning › graph neural network › geometric graph neural network
3d graph neural network |
0.7 | 1 | 2023 | GeoTMI: Predicting Quantum Chemical Property with Easy-to-Obtain Geometry via Positional Denoising · NeurIPS 2023 |
Machine learning › Generative modeling › diffusion model
denoising |
0.7 | 1 | 2023 | GeoTMI: Predicting Quantum Chemical Property with Easy-to-Obtain Geometry via Positional Denoising · NeurIPS 2023 |
Computer vision › 3D vision
geometric deep learning |
0.7 | 1 | 2023 | GeoTMI: Predicting Quantum Chemical Property with Easy-to-Obtain Geometry via Positional Denoising · NeurIPS 2023 |
Machine learning › Graph learning › molecular representation learning › molecular graph learning
molecular property prediction |
0.7 | 1 | 2023 | GeoTMI: Predicting Quantum Chemical Property with Easy-to-Obtain Geometry via Positional Denoising · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
optimal transport · 0.9iterative markovian fitting · 0.9graph edit distance · 0.9continuous-time markov chain · 0.9mutual information maximization · 0.7graph neural network · 0.7denoising · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Discrete Diffusion Schrödinger Bridge Matching for Graph TransformationabstractTransporting between arbitrary distributions is a fundamental goal in generative modeling.
Recently proposed diffusion bridge models provide a potential solution, but they rely on a joint distribution that is difficult to obtain in practice.
Furthermore, formulations based on continuous domains limit their applicability to discrete domains such as graphs.
To overcome these limitations, we propose Discrete Diffusion Schrödinger Bridge Matching (DDSBM), a novel framework that utilizes continuous-time Markov chains to solve the SB problem in a high-dimensional discrete state space.
Our approach extends Iterative Markovian Fitting to discrete domains, and we have proved its convergence to the SB.
Furthermore, we adapt our framework for the graph transformation, and show that our design choice of underlying dynamics characterized by independent modifications of nodes and edges can be interpreted as the entropy-regularized version of optimal transport with a cost function described by the graph edit distance.
To demonstrate the effectiveness of our framework, we have applied DDSBM to molecular optimization in the field of chemistry.
Experimental results demonstrate that DDSBM effectively optimizes molecules' property-of-interest with minimal graph transformation, successfully retaining other features. Source code is available [here](https://github.com/junhkim1226/DDSBM). Jun Hyeong Kim, Seonghwan Kim 0004, Seokhyun Moon, Hyeongwoo Kim, Jeheon Woo, Woo Youn Kim |
ICLR | 3 |
| 2023 | GeoTMI: Predicting Quantum Chemical Property with Easy-to-Obtain Geometry via Positional DenoisingabstractAs quantum chemical properties have a dependence on their geometries, graph neural networks (GNNs) using 3D geometric information have achieved high prediction accuracy in many tasks. However, they often require 3D geometries obtained from high-level quantum mechanical calculations, which are practically infeasible, limiting their applicability to real-world problems. To tackle this, we propose a new training framework, GeoTMI, that employs denoising process to predict properties accurately using easy-to-obtain geometries (corrupted versions of correct geometries, such as those obtained from low-level calculations). Our starting point was the idea that the correct geometry is the best description of the target property. Hence, to incorporate information of the correct, GeoTMI aims to maximize mutual information between three variables: the correct and the corrupted geometries and the property. GeoTMI also explicitly updates the corrupted input to approach the correct geometry as it passes through the GNN layers, contributing to more effective denoising. We investigated the performance of the proposed method using 3D GNNs for three prediction tasks: molecular properties, a chemical reaction property, and relaxed energy in a heterogeneous catalytic system. Our results showed consistent improvements in accuracy across various tasks, demonstrating the effectiveness and robustness of GeoTMI. Jeheon Woo, Seonghwan Kim 0004, Seokhyun Moon, Jun Hyeong Kim, Woo Youn Kim |
NeurIPS | 4 |