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.

Eun-Bi Yoon

dblp:324/1477 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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
3 papers
Generative modeling · 48% Trustworthy machine learning · 31% Graph learning · 21%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
1.322023
Score-based Generative Models with Lévy Processes · NeurIPS 2023
Score-based Generative Modeling through Stochastic Evolution Equations in Hilbert Spaces · NeurIPS 2023
Machine learning › Generative modeling › diffusion model
score-based generative model
1.322023
Score-based Generative Models with Lévy Processes · NeurIPS 2023
Score-based Generative Modeling through Stochastic Evolution Equations in Hilbert Spaces · NeurIPS 2023
Machine learning › Graph learning › graph classification
graph-level classification
0.612022
Prototype-Based Explanations for Graph Neural Networks (Student Abstract) · AAAI 2022
Machine learning › Graph learning
graph neural network
0.612022
Prototype-Based Explanations for Graph Neural Networks (Student Abstract) · AAAI 2022
Machine learning › Trustworthy machine learning › interpretability
graph neural network explanation
0.612022
Prototype-Based Explanations for Graph Neural Networks (Student Abstract) · AAAI 2022
Machine learning › Trustworthy machine learning
interpretability
0.612022
Prototype-Based Explanations for Graph Neural Networks (Student Abstract) · AAAI 2022
Machine learning › Trustworthy machine learning › interpretability › example-based explanation
prototype-based explanation
0.612022
Prototype-Based Explanations for Graph Neural Networks (Student Abstract) · AAAI 2022

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

stochastic evolution equations · 0.7stochastic differential equation · 0.7lévy processes · 0.7kernel two-sample test · 0.7fourier neural operator · 0.7denoising score matching · 0.7maximum common subgraph · 0.6clustering · 0.6
YearPublicationVenuePosition
2023 Score-based Generative Modeling through Stochastic Evolution Equations in Hilbert Spaces
abstract
Continuous-time score-based generative models consist of a pair of stochastic differential equations (SDEs)—a forward SDE that smoothly transitions data into a noise space and a reverse SDE that incrementally eliminates noise from a Gaussian prior distribution to generate data distribution samples—are intrinsically connected by the time-reversal theory on diffusion processes. In this paper, we investigate the use of stochastic evolution equations in Hilbert spaces, which expand the applicability of SDEs in two aspects: sample space and evolution operator, so they enable encompassing recent variations of diffusion models, such as generating functional data or replacing drift coefficients with image transformation. To this end, we derive a generalized time-reversal formula to build a bridge between probabilistic diffusion models and stochastic evolution equations and propose a score-based generative model called Hilbert Diffusion Model (HDM). Combining with Fourier neural operator, we verify the superiority of HDM for sampling functions from functional datasets with a power of kernel two-sample test of 4.2 on Quadratic, 0.2 on Melbourne, and 3.6 on Gridwatch, which outperforms existing diffusion models formulated in function spaces. Furthermore, the proposed method shows its strength in motion synthesis tasks by utilizing the Wiener process with values in Hilbert space. Finally, our empirical results on image datasets also validate a connection between HDM and diffusion models using heat dissipation, revealing the potential for exploring evolution operators and sample spaces.
Sungbin Lim, Eun-Bi Yoon, Taehyun Byun, Taewon Kang, Seungwoo Kim, Kyungjae Lee 0001
NeurIPS2
2023 Score-based Generative Models with Lévy Processes
abstract
Investigating the optimal stochastic process beyond Gaussian for noise injection in a score-based generative model remains an open question. Brownian motion is a light-tailed process with continuous paths, which leads to a slow convergence rate for the Number of Function Evaluation (NFE). Recent studies have shown that diffusion models suffer from mode-collapse issues on imbalanced data. In order to overcome the limitations of Brownian motion, we introduce a novel score-based generative model referred to as Lévy-Itō Model (LIM). This model utilizes isotropic $\alpha$-stable Lévy processes. We first derive an exact reverse-time stochastic differential equation driven by the Lévy process and develop the corresponding fractional denoising score matching. The proposed generative model takes advantage of the heavy-tailed properties of the Lévy process. Our experimental results show LIM allows for faster and more diverse sampling while maintaining high fidelity compared to existing diffusion models across various image datasets such as CIFAR10, CelebA, and imbalanced dataset CIFAR10LT. Comparing our results to those of DDPM with 3.21 Fréchet Inception Distance (FID) and 0.6437 Recall on the CelebA dataset, we achieve 1.58 FID and 0.7006 Recall using the same architecture. LIM shows the best performance in NFE 500 with $2\times$ faster total wall-clock time than the baseline.
Eun-Bi Yoon, Keehun Park, Sungwoong Kim, Sungbin Lim
NeurIPS1
2022 Prototype-Based Explanations for Graph Neural Networks (Student Abstract)
abstract
Aside the high performance of graph neural networks (GNNs), considerable attention has recently been paid to explanations of black-box deep learning models. Unlike most studies focusing on model explanations based on a specific graph instance, we propose Prototype-bAsed GNN-Explainer (PAGE), a novel model-level explanation method for graph-level classification that explains what the underlying model has learned by providing human-interpretable prototypes. Specifically, our method performs clustering on the embedding space of the underlying GNN model; extracts embeddings in each cluster; and discovers prototypes, which serve as model explanations, by estimating the maximum common subgraph (MCS) from the extracted embeddings. Experimental evaluation demonstrates that PAGE not only provides high-quality explanations but also outperforms the state-of-the-art model-level method in terms of consistency and faithfulness that are performance metrics for quantitative evaluations.
Yong-Min Shin, Sunwoo Kim 0006, Eun-Bi Yoon, Won-Yong Shin
AAAI3