Sungwon Kim

Sungwon Kim

Auto-generated profile, based on publicly available information

Sungwon Kim

KAIST, Daejeon, Republic of Korea

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 August 2024
Verified
Conference Paper
Open access
SSSangwoo Seo
Sangwoo Seo
SKSungwon Kim
Sungwon Kim
JJJihyeong Jung
Jihyeong Jung
YLYoonho Lee
Yoonho Lee
CPChanyoung Park
Chanyoung Park
Temporal Graph Neural Networks (TGNN) have the ability to capture both the graph topology and dynamic dependencies of interactions within a graph over time. There has been a growing need to explain the predictions of TGNN models due to the difficulty in identifying how past events influence their predictions. Since the explanation model for a static graph cannot be readily applied to temporal graphs due to its inability to capture temporal dependencies, recent studies proposed explanation models for temporal graphs. However, existing explanation models for temporal graphs rely on post-hoc explanations, requiring separate models for prediction and explanation, which is limited in two aspects: efficiency and accuracy of explanation. In this work, we propose a novel built-in explanation framework for temporal graphs, called Self-Explainable Temporal Graph Networks based on Graph Information Bottleneck (TGIB). TGIB provides explanations for event occurrences by introducing stochasticity in each temporal event based on the Information Bottleneck theory. Experimental results demonstrate the superiority of TGIB in terms of both the link prediction performance and explainability compared to state-of-the-art methods. This is the first work that simultaneously performs prediction and explanation for temporal graphs in an end-to-end manner. The source code of TGIB is available at https://github.com/sang-woo-seo/TGIB.

13 May 2024
Verified
Conference Paper
Open access
SCSeungyoon Choi
Seungyoon Choi
WKWonjoong Kim
Wonjoong Kim
SKSungwon Kim
Sungwon Kim
YIYeonjun In
Yeonjun In
SKSein Kim
Sein Kim
CPChanyoung Park
Chanyoung Park
We investigate the replay buffer in rehearsal-based approaches for graph continual learning (GCL) methods. Existing rehearsal-based GCL methods select the most representative nodes for each class and store them in a replay buffer for later use in training subsequent tasks. However, we discovered that considering only the class representativeness of each replayed node makes the replayed nodes to be concentrated around the center of each class, incurring a potential risk of overfitting to nodes residing in those regions, which aggravates catastrophic forgetting. Moreover, as the rehearsal-based approach heavily relies on a few replayed nodes to retain knowledge obtained from previous tasks, involving the replayed nodes that have irrelevant neighbors in the model training may have a significant detrimental impact on model performance. In this paper, we propose a GCL model named DSLR, specifically, we devise a coverage-based diversity (CD) approach to consider both the class representativeness and the diversity within each class of the replayed nodes. Moreover, we adopt graph structure learning (GSL) to ensure that the replayed nodes are connected to truly informative neighbors. Extensive experimental results demonstrate the effectiveness and efficiency of DSLR. Our source code is available at https://github.com/seungyoon-Choi/DSLR_official.

4 August 2023
Verified
Conference Paper
Open access
SKSungwon Kim
Sungwon Kim
JLJunseok Lee
Junseok Lee
NLNamkyeong Lee
Namkyeong Lee
WKWonjoong Kim
Wonjoong Kim
SCSeungyoon Choi
Seungyoon Choi
CPChanyoung Park
Chanyoung Park
Although Graph Neural Networks (GNNs) have been successful in node classification tasks, their performance heavily relies on the availability of a sufficient number of labeled nodes per class. In real-world situations, not all classes have many labeled nodes and there may be instances where the model needs to classify new classes, making manual labeling difficult. To solve this problem, it is important for GNNs to be able to classify nodes with a limited number of labeled nodes, known as few-shot node classification. Previous episodic meta-learning based methods have demonstrated success in few-shot node classification, but our findings suggest that optimal performance can only be achieved with a substantial amount of diverse training meta-tasks. To address this challenge of meta-learning based few-shot learning (FSL), we propose a new approach, the Task-Equivariant Graph few-shot learning (TEG) framework. Our TEG framework enables the model to learn transferable task-adaptation strategies using a limited number of training meta-tasks, allowing it to acquire meta-knowledge for a wide range of meta-tasks. By incorporating equivariant neural networks, TEG can utilize their strong generalization abilities to learn highly adaptable task-specific strategies. As a result, TEG achieves state-of-the-art performance with limited training meta-tasks. Our experiments on various benchmark datasets demonstrate TEG's superiority in terms of accuracy and generalization ability, even when using minimal meta-training data, highlighting the effectiveness of our proposed approach in addressing the challenges of meta-learning based few-shot node classification. Our code is available at the following link: https://github.com/sung-won-kim/TEG

21 March 2026 in Water Research
Verified
Journal Article
Open access
YCYongjoon Choe
Yongjoon Choe
SKSungwon Kim
Sungwon Kim
SBSusan E. Burns
Susan E. Burns
CPChanyoung Park
Chanyoung Park
Colloidal aggregation in natural and engineered waters is a complex function of both particle and groundwater electrochemical conditions, yet predicting aggregation behavior across diffusion-limited and reaction-limited regimes remains challenging due to the nonlinear dependence of collision efficiency on ionic strength and surface potential. This study presents a graph neural operator surrogate model that captures particle aggregation dynamics by embedding transport physics directly into the network architecture. Particle size classes are represented as graph nodes with Brownian collision kernels encoded in edge features, while attention mechanisms conditioned on ionic strength and zeta potential learn collision efficiency variations governed by extended DLVO interactions. The proposed model predicts aggregation kinetics across a range of electrochemical conditions, achieving R2 > 0.99 for both held-out parameter combinations and temporal extrapolation, and outperforming baseline models that do not embed physics in the architecture, as well as loss-based, physics-regularized neural networks. Validation against experimental measurements from bacteriophage, polystyrene, and cerium oxide systems confirms reproduction of aggregation regime transitions and kinetic saturation. Attention analysis reveals physically consistent reorganization from multiple information pathways under strong electrostatic repulsion to integrated processing under weak repulsion. This framework enables rapid, physically grounded exploration of colloidal aggregation relevant to water quality prediction and treatment optimization.