Demo Data from VLDB 2026 / reviewers in the wild / expert
Hyunju Kang
dblp:382/4096
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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
2 papers |
Trustworthy machine learning · 84% Graph learning · 16% | |
| Computer graphics and multimedia
1 paper |
Audio and music processing · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning
interpretability |
1.6 | 2 | 2025 | AudioGenX: Explainability on Text-to-Audio Generative Models · AAAI 2025 UNR-Explainer: Counterfactual Explanations for Unsupervised Node Representation Learning Models · ICLR 2024 |
Machine learning › Trustworthy machine learning › interpretability › neural network interpretation
interpretability of generative models |
0.9 | 1 | 2025 | AudioGenX: Explainability on Text-to-Audio Generative Models · AAAI 2025 |
Audio and music processing › sound synthesis
text-to-audio generation |
0.9 | 1 | 2025 | AudioGenX: Explainability on Text-to-Audio Generative Models · AAAI 2025 |
Machine learning › Trustworthy machine learning › interpretability
counterfactual explanation |
0.8 | 1 | 2024 | UNR-Explainer: Counterfactual Explanations for Unsupervised Node Representation Learning Models · ICLR 2024 |
Machine learning › Trustworthy machine learning › interpretability
explainable AI |
0.8 | 1 | 2024 | UNR-Explainer: Counterfactual Explanations for Unsupervised Node Representation Learning Models · ICLR 2024 |
Machine learning › Graph learning
graph neural network |
0.8 | 1 | 2024 | UNR-Explainer: Counterfactual Explanations for Unsupervised Node Representation Learning Models · ICLR 2024 |
Methods — techniques the papers use, named apart from their topics
token importance · 1.7factual explanation · 1.7counterfactual explanation · 1.7monte carlo tree search · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | AudioGenX: Explainability on Text-to-Audio Generative ModelsabstractText-to-audio generation models (TAG) have achieved significant advances in generating audio conditioned on text descriptions. However, a critical challenge lies in the lack of transparency regarding how each textual input impacts the generated audio. To address this issue, we introduce AudioGenX, an Explainable AI (XAI) method that provides explanations for text-to-audio generation models by highlighting the importance of input tokens. AudioGenX optimizes an Explainer by leveraging factual and counterfactual objective functions to provide faithful explanations at the audio token level. This method offers a detailed and comprehensive understanding of the relationship between text inputs and audio outputs, enhancing both the explainability and trustworthiness of TAG models. Extensive experiments demonstrate the effectiveness of AudioGenX in producing faithful explanations, benchmarked against existing methods using novel evaluation metrics specifically designed for audio generation tasks. Hyunju Kang, Geonhee Han, Yoonjae Jeong, Hogun Park |
AAAI | 1 |
| 2024 | UNR-Explainer: Counterfactual Explanations for Unsupervised Node Representation Learning ModelsabstractNode representation learning, such as Graph Neural Networks (GNNs), has become one of the important learning methods in machine learning, and the demand for reliable explanation generation is growing. Despite extensive research on explanation generation for supervised node representation learning, explaining unsupervised models has been less explored. To address this gap, we propose a method for generating counterfactual (CF) explanations in unsupervised node representation learning, aiming to identify the most important subgraphs that cause a significant change in the $k$-nearest neighbors of a node of interest in the learned embedding space upon perturbation. The $k$-nearest neighbor-based CF explanation method provides simple, yet pivotal, information for understanding unsupervised downstream tasks, such as top-$k$ link prediction and clustering. Furthermore, we introduce a Monte Carlo Tree Search (MCTS)-based explainability method for generating expressive CF explanations for **U**nsupervised **N**ode **R**epresentation learning methods, which we call **UNR-Explainer**. The proposed method demonstrates improved performance on six datasets for both unsupervised GraphSAGE and DGI. Hyunju Kang, Geonhee Han, Hogun Park |
ICLR | 1 |