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

Sehui Han

dblp:323/8751 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
5since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 5 · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
5 papers
Graph learning · 46% Transfer learning and domain adaptation · 19% Generative modeling · 14%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 75% Computational science and engineering · 25%

Topics — the 18 heaviest of 19, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › model compression › knowledge distillation
cross-modal distillation
0.912025
3D Denoisers Are Good 2D Teachers: Molecular Pretraining via Denoising and Cross-Modal Distillation · AAAI 2025
Machine learning › Graph learning › molecular representation learning › molecular graph learning
molecular graph representation learning
0.912025
3D Denoisers Are Good 2D Teachers: Molecular Pretraining via Denoising and Cross-Modal Distillation · AAAI 2025
Machine learning › Graph learning
molecular representation learning
0.912025
3D Denoisers Are Good 2D Teachers: Molecular Pretraining via Denoising and Cross-Modal Distillation · AAAI 2025
Machine learning › Transfer learning and domain adaptation › knowledge transfer
inductive transfer
0.812024
Geometrically Aligned Transfer Encoder for Inductive Transfer in Regression Tasks · ICLR 2024
Machine learning › Transfer learning and domain adaptation › knowledge transfer
transfer regression
0.812024
Geometrically Aligned Transfer Encoder for Inductive Transfer in Regression Tasks · ICLR 2024
Machine learning › Graph learning
graph clustering
0.712023
Grouping Matrix Based Graph Pooling with Adaptive Number of Clusters · AAAI 2023
Machine learning › Graph learning › graph neural network
graph pooling
0.712023
Grouping Matrix Based Graph Pooling with Adaptive Number of Clusters · AAAI 2023
Natural language and speech › Information extraction and text analysis › named entity recognition
chemical named entity recognition
0.612022
CEDe: A collection of expert-curated datasets with atom-level entity annotations for Optical Chemical Structure Recognition · NeurIPS 2022
Machine learning › Generative modeling
molecular generation
0.612022
Path-Aware and Structure-Preserving Generation of Synthetically Accessible Molecules · ICML 2022
Machine learning › Generative modeling
variational autoencoder
0.612022
Path-Aware and Structure-Preserving Generation of Synthetically Accessible Molecules · ICML 2022
Bioinformatics and computational biology › molecular informatics
cheminformatics
0.612022
CEDe: A collection of expert-curated datasets with atom-level entity annotations for Optical Chemical Structure Recognition · NeurIPS 2022
Computational science and engineering
computational chemistry
0.612022
Path-Aware and Structure-Preserving Generation of Synthetically Accessible Molecules · ICML 2022
Bioinformatics and computational biology › molecular informatics › cheminformatics
molecule generation
0.612022
Path-Aware and Structure-Preserving Generation of Synthetically Accessible Molecules · ICML 2022
Bioinformatics and computational biology › molecular informatics › cheminformatics
optical chemical structure recognition
0.612022
CEDe: A collection of expert-curated datasets with atom-level entity annotations for Optical Chemical Structure Recognition · NeurIPS 2022
Machine learning › Graph learning › graph representation learning
molecular graph representation
0.212024
Geometrically Aligned Transfer Encoder for Inductive Transfer in Regression Tasks · ICLR 2024
Machine learning › Graph learning › molecular representation learning › molecular graph learning
molecular property prediction
0.212023
Grouping Matrix Based Graph Pooling with Adaptive Number of Clusters · AAAI 2023
Machine learning › Graph learning
graph reconstruction
0.212022
CEDe: A collection of expert-curated datasets with atom-level entity annotations for Optical Chemical Structure Recognition · NeurIPS 2022
Machine learning › Representation and self-supervised learning
latent space representation
0.212022
Path-Aware and Structure-Preserving Generation of Synthetically Accessible Molecules · ICML 2022

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

reaction-embedded generation · 1.1self-supervised learning · 0.9knowledge distillation · 0.9denoising · 0.9riemannian manifold · 0.8differential geometry · 0.8diffeomorphism · 0.8quadratic form · 0.7grouping matrix · 0.7binary classification · 0.7variational autoencoder · 0.6transfer learning · 0.6object detection · 0.6image captioning · 0.6
YearPublicationVenuePosition
2025 3D Denoisers Are Good 2D Teachers: Molecular Pretraining via Denoising and Cross-Modal Distillation
abstract
Pretraining molecular representations from large unlabeled data is essential for molecular property prediction due to the high cost of obtaining ground-truth labels. While there exist various 2D graph-based molecular pretraining approaches, these methods struggle to show statistically significant gains in predictive performance. Recent work have thus instead proposed 3D conformer-based pretraining under the task of denoising, leading to promising results. During downstream finetuning, however, models trained with 3D conformers require accurate atom-coordinates of previously unseen molecules, which are computationally expensive to acquire at scale. In this paper, we propose a simple solution of denoise-and-distill (D&D), a self-supervised molecular representation learning method that pretrains a 2D graph encoder by distilling representations from a 3D denoiser. With denoising followed by cross-modal knowledge distillation, our approach enjoys use of knowledge obtained from denoising as well as painless application to downstream tasks with no access to 3D conformers. Experiments on real-world molecular property prediction datasets show that the graph encoder trained via D&D can infer 3D information based on the 2D graph and shows superior performance and label-efficiency against previous methods.
Sungjun Cho, Dae-Woong Jeong, Sung Moon Ko, Sehui Han, Seunghoon Hong, Honglak Lee, Moontae Lee
AAAI5
2024 Geometrically Aligned Transfer Encoder for Inductive Transfer in Regression Tasks
abstract
Transfer learning is a crucial technique for handling a small amount of data that is potentially related to other abundant data. However, most of the existing methods are focused on classification tasks using images and language datasets. Therefore, in order to expand the transfer learning scheme to regression tasks, we propose a novel transfer technique based on differential geometry, namely the Geometrically Aligned Transfer Encoder (${\it GATE}$). In this method, we interpret the latent vectors from the model to exist on a Riemannian curved manifold. We find a proper diffeomorphism between pairs of tasks to ensure that every arbitrary point maps to a locally flat coordinate in the overlapping region, allowing the transfer of knowledge from the source to the target data. This also serves as an effective regularizer for the model to behave in extrapolation regions. In this article, we demonstrate that ${\it GATE}$ outperforms conventional methods and exhibits stable behavior in both the latent space and extrapolation regions for various molecular graph datasets.
Sung Moon Ko, Dae-Woong Jeong, Woohyung Lim, Sehui Han
ICLR5
2023 Grouping Matrix Based Graph Pooling with Adaptive Number of Clusters
abstract
Graph pooling is a crucial operation for encoding hierarchical structures within graphs. Most existing graph pooling approaches formulate the problem as a node clustering task which effectively captures the graph topology. Conventional methods ask users to specify an appropriate number of clusters as a hyperparameter, then assuming that all input graphs share the same number of clusters. In inductive settings where the number of clusters could vary, however, the model should be able to represent this variation in its pooling layers in order to learn suitable clusters. Thus we propose GMPool, a novel differentiable graph pooling architecture that automatically determines the appropriate number of clusters based on the input data. The main intuition involves a grouping matrix defined as a quadratic form of the pooling operator, which induces use of binary classification probabilities of pairwise combinations of nodes. GMPool obtains the pooling operator by first computing the grouping matrix, then decomposing it. Extensive evaluations on molecular property prediction tasks demonstrate that our method outperforms conventional methods.
Sung Moon Ko, Sungjun Cho, Dae-Woong Jeong, Sehui Han, Moontae Lee, Honglak Lee
AAAI4
2022 Path-Aware and Structure-Preserving Generation of Synthetically Accessible Molecules
abstract
Computational chemistry aims to autonomously design specific molecules with target functionality. Generative frameworks provide useful tools to learn continuous representations of molecules in a latent space. While modelers could optimize chemical properties, many generated molecules are not synthesizable. To design synthetically accessible molecules that preserve main structural motifs of target molecules, we propose a reaction-embedded and structure-conditioned variational autoencoder. As the latent space jointly encodes molecular structures and their reaction routes, our new sampling method that measures the path-informed structural similarity allows us to effectively generate structurally analogous synthesizable molecules. When targeting out-of-domain as well as in-domain seed structures, our model generates structurally and property-wisely similar molecules equipped with well-defined reaction paths. By focusing on the important region in chemical space, we also demonstrate that our model can design new molecules with even higher activity than the seed molecules.
Juhwan Noh, Dae-Woong Jeong, Kiyoung Kim, Sehui Han, Moontae Lee, Honglak Lee, Yousung Jung
ICML4
2022 CEDe: A collection of expert-curated datasets with atom-level entity annotations for Optical Chemical Structure Recognition
abstract
Optical Chemical Structure Recognition (OCSR) deals with the translation from chemical images to molecular structures, this being the main way chemical compounds are depicted in scientific documents. Traditionally, rule-based methods have followed a framework based on the detection of chemical entities, such as atoms and bonds, followed by a compound structure reconstruction step. Recently, neural architectures analog to image captioning have been explored to solve this task, yet they still show to be data inefficient, using millions of examples just to show performances comparable with traditional methods. Looking to motivate and benchmark new approaches based on atomic-level entities detection and graph reconstruction, we present CEDe, a unique collection of chemical entity bounding boxes manually curated by experts for scientific literature datasets. These annotations combine to more than 700,000 chemical entity bounding boxes with the necessary information for structure reconstruction. Also, a large synthetic dataset containing one million molecular images and annotations is released in order to explore transfer-learning techniques that could help these architectures perform better under low-data regimes. Benchmarks show that detection-reconstruction based models can achieve performances on par with or better than image captioning-like models, even with 100x fewer training examples.
Rodrigo Hormazabal, Changyoung Park, Soonyoung Lee, Sehui Han, Yeonsik Jo, Jaewan Lee, Ahra Jo, Jaegul Choo, Moontae Lee, Honglak Lee
NeurIPS4