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

Yong-Hyun Park

dblp:62/444 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 3 first-author · 3 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 · 56% Trustworthy machine learning · 21% Reinforcement learning · 12%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
1.832025
Jump Your Steps: Optimizing Sampling Schedule of Discrete Diffusion Models · ICLR 2025
Understanding the Latent Space of Diffusion Models through the Lens of Riemannian Geometry · NeurIPS 2023
Direct Unlearning Optimization for Robust and Safe Text-to-Image Models · NeurIPS 2024
Machine learning › Generative modeling › diffusion model
discrete diffusion model
0.912025
Jump Your Steps: Optimizing Sampling Schedule of Discrete Diffusion Models · ICLR 2025
Machine learning › Reinforcement learning
sample efficiency
0.912025
Jump Your Steps: Optimizing Sampling Schedule of Discrete Diffusion Models · ICLR 2025
Machine learning › Trustworthy machine learning › adversarial machine learning
adversarial defense
0.812024
Direct Unlearning Optimization for Robust and Safe Text-to-Image Models · NeurIPS 2024
Machine learning › Trustworthy machine learning
robustness
0.812024
Direct Unlearning Optimization for Robust and Safe Text-to-Image Models · NeurIPS 2024
Machine learning › Generative modeling › diffusion model
text-to-image generation
0.812024
Direct Unlearning Optimization for Robust and Safe Text-to-Image Models · NeurIPS 2024
Machine learning › Generative modeling › diffusion model
image editing
0.712023
Understanding the Latent Space of Diffusion Models through the Lens of Riemannian Geometry · NeurIPS 2023
Machine learning › Representation and self-supervised learning › latent space
latent space analysis
0.712023
Understanding the Latent Space of Diffusion Models through the Lens of Riemannian Geometry · NeurIPS 2023
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › manifold learning
riemannian manifold
0.212023
Understanding the Latent Space of Diffusion Models through the Lens of Riemannian Geometry · NeurIPS 2023

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

tau-leaping · 0.9compounding decoding error minimization · 0.9preference optimization · 0.8output-preserving regularization · 0.8riemannian geometry · 0.7pullback metric · 0.7
YearPublicationVenuePosition
2025 Jump Your Steps: Optimizing Sampling Schedule of Discrete Diffusion Models
abstract
Diffusion models have seen notable success in continuous domains, leading to the development of discrete diffusion models (DDMs) for discrete variables. Despite recent advances, DDMs face the challenge of slow sampling speeds. While parallel sampling methods like $\tau$-leaping accelerate this process, they introduce _Compounding Decoding Error_ (CDE), where discrepancies arise between the true distribution and the approximation from parallel token generation, leading to degraded sample quality. In this work, we present _Jump Your Steps_ (JYS), a novel approach that optimizes the allocation of discrete sampling timesteps by minimizing CDE without extra computational cost. More precisely, we derive a practical upper bound on CDE and propose an efficient algorithm for searching for the optimal sampling schedule. Extensive experiments across image, music, and text generation show that JYS significantly improves sampling quality, establishing it as a versatile framework for enhancing DDM performance for fast sampling.
Yong-Hyun Park, Chieh-Hsin Lai, Satoshi Hayakawa, Yuhta Takida, Yuki Mitsufuji
ICLR1
2024 Direct Unlearning Optimization for Robust and Safe Text-to-Image Models
abstract
Recent advancements in text-to-image (T2I) models have greatly benefited from large-scale datasets, but they also pose significant risks due to the potential generation of unsafe content. To mitigate this issue, researchers proposed unlearning techniques that attempt to induce the model to unlearn potentially harmful prompts. However, these methods are easily bypassed by adversarial attacks, making them unreliable for ensuring the safety of generated images. In this paper, we propose Direct Unlearning Optimization (DUO), a novel framework for removing NSFW content from T2I models while preserving their performance on unrelated topics. DUO employs a preference optimization approach using curated paired image data, ensuring that the model learns to remove unsafe visual concepts while retain unrelated features. Furthermore, we introduce an output-preserving regularization term to maintain the model's generative capabilities on safe content. Extensive experiments demonstrate that DUO can robustly defend against various state-of-the-art red teaming methods without significant performance degradation on unrelated topics, as measured by FID and CLIP scores. Our work contributes to the development of safer and more reliable T2I models, paving the way for their responsible deployment in both closed-source and open-source scenarios.
Yong-Hyun Park, Sangdoo Yun, Jin-Hwa Kim, Geonhui Jang, Yonghyun Jeong, Junghyo Jo, Gayoung Lee
NeurIPS1
2023 Understanding the Latent Space of Diffusion Models through the Lens of Riemannian Geometry
abstract
Despite the success of diffusion models (DMs), we still lack a thorough understanding of their latent space. To understand the latent space $\mathbf{x}_t \in \mathcal{X}$, we analyze them from a geometrical perspective. Our approach involves deriving the local latent basis within $\mathcal{X}$ by leveraging the pullback metric associated with their encoding feature maps. Remarkably, our discovered local latent basis enables image editing capabilities by moving $\mathbf{x}_t$, the latent space of DMs, along the basis vector at specific timesteps. We further analyze how the geometric structure of DMs evolves over diffusion timesteps and differs across different text conditions. This confirms the known phenomenon of coarse-to-fine generation, as well as reveals novel insights such as the discrepancy between $\mathbf{x}_t$ across timesteps, the effect of dataset complexity, and the time-varying influence of text prompts. To the best of our knowledge, this paper is the first to present image editing through $\mathbf{x}$-space traversal, editing only once at specific timestep $t$ without any additional training, and providing thorough analyses of the latent structure of DMs. The code to reproduce our experiments can be found at the [link](https://github.com/enkeejunior1/Diffusion-Pullback).
Yong-Hyun Park, Mingi Kwon, Jaewoong Choi, Junghyo Jo, Youngjung Uh
NeurIPS1