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

Yeonsung Jung

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

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

Artificial intelligence and machine learning · 7 · 3 first-author · 7 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 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
6 papers
Trustworthy machine learning · 34% Generative modeling · 20% Efficient and distributed learning · 19%
Computer graphics and multimedia
3 papers
Visual content generation and editing · 61% Image and video coding · 30% Image and video processing · 9%
Network and information security
1 paper
Security and privacy of machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
fairness
1.422024
A Simple Remedy for Dataset Bias via Self-Influence: A Mislabeled Sample Perspective · NeurIPS 2024
Fighting Fire with Fire: Contrastive Debiasing without Bias-free Data via Generative Bias-transformation · ICML 2023
Machine learning › Generative modeling › autoregressive model
autoregressive image generation
0.912025
LANTERN: Accelerating Visual Autoregressive Models with Relaxed Speculative Decoding · ICLR 2025
Machine learning › Generative modeling
autoregressive model
0.912025
LANTERN: Accelerating Visual Autoregressive Models with Relaxed Speculative Decoding · ICLR 2025
Machine learning › Generative modeling
diffusion model
0.912025
Early Timestep Zero-Shot Candidate Selection for Instruction-Guided Image Editing · ICCV 2025
Machine learning › Efficient and distributed learning
inference acceleration
0.912025
LANTERN: Accelerating Visual Autoregressive Models with Relaxed Speculative Decoding · ICLR 2025
Machine learning › Efficient and distributed learning › inference acceleration
speculative decoding
0.912025
LANTERN: Accelerating Visual Autoregressive Models with Relaxed Speculative Decoding · ICLR 2025
Computer vision › Vision and language › vision-language model
vision-language model evaluation
0.912025
Preserve or Modify? Context-Aware Evaluation for Balancing Preservation and Modification in Text-Guided Image Editing · CVPR 2025
Visual content generation and editing › image editing › text-guided image editing
instruction-based image editing
0.912025
Early Timestep Zero-Shot Candidate Selection for Instruction-Guided Image Editing · ICCV 2025
Visual content generation and editing › image editing
text-guided image editing
0.912025
Preserve or Modify? Context-Aware Evaluation for Balancing Preservation and Modification in Text-Guided Image Editing · CVPR 2025
Security and privacy of machine learning
adversarial attack
0.912025
Playing the Fool: Jailbreaking LLMs and Multimodal LLMs with Out-of-Distribution Strategy · CVPR 2025
Security and privacy of machine learning › adversarial attack
jailbreak attack
0.912025
Playing the Fool: Jailbreaking LLMs and Multimodal LLMs with Out-of-Distribution Strategy · CVPR 2025
Machine learning › Trustworthy machine learning › fairness
bias mitigation
0.812024
A Simple Remedy for Dataset Bias via Self-Influence: A Mislabeled Sample Perspective · NeurIPS 2024
Machine learning › Efficient and distributed learning › data selection
data pruning
0.812024
PruNeRF: Segment-Centric Dataset Pruning via 3D Spatial Consistency · ICML 2024
Computer vision › 3D vision
neural radiance field
0.812024
PruNeRF: Segment-Centric Dataset Pruning via 3D Spatial Consistency · ICML 2024
Machine learning › Trustworthy machine learning
robustness
0.812024
A Simple Remedy for Dataset Bias via Self-Influence: A Mislabeled Sample Perspective · NeurIPS 2024
Machine learning › Trustworthy machine learning › robustness
spurious correlation
0.812024
A Simple Remedy for Dataset Bias via Self-Influence: A Mislabeled Sample Perspective · NeurIPS 2024
Machine learning › Representation and self-supervised learning › contrastive learning
contrastive debiasing
0.712023
Fighting Fire with Fire: Contrastive Debiasing without Bias-free Data via Generative Bias-transformation · ICML 2023
Machine learning › Trustworthy machine learning
debiasing
0.712023
Fighting Fire with Fire: Contrastive Debiasing without Bias-free Data via Generative Bias-transformation · ICML 2023
Computer vision › Vision and language
vision-language model
0.312025
Early Timestep Zero-Shot Candidate Selection for Instruction-Guided Image Editing · ICCV 2025
Computer vision › 3D vision
3d scene understanding
0.212024
PruNeRF: Segment-Centric Dataset Pruning via 3D Spatial Consistency · ICML 2024
Computer vision › 3D vision
spatial consistency
0.212024
PruNeRF: Segment-Centric Dataset Pruning via 3D Spatial Consistency · ICML 2024
Machine learning › Deep learning architectures and training › data-centric deep learning
training data quality
0.212024
A Simple Remedy for Dataset Bias via Self-Influence: A Mislabeled Sample Perspective · NeurIPS 2024
Machine learning › Representation and self-supervised learning
contrastive learning
0.212023
Fighting Fire with Fire: Contrastive Debiasing without Bias-free Data via Generative Bias-transformation · ICML 2023

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

zero-shot candidate selection · 1.7total variation distance · 1.7speculative decoding · 1.7multimodal large language model · 1.7hyperplane separation · 1.7early timestep selection · 1.7CLIP · 1.7influence functions · 1.5visual transformation · 0.9textual transformation · 0.9image mixup · 0.9segmentation · 0.8depth-based reprojection · 0.8
YearPublicationVenuePosition
2025 Playing the Fool: Jailbreaking LLMs and Multimodal LLMs with Out-of-Distribution Strategy
abstract
Despite the remarkable versatility of Large Language Models (LLMs) and Multimodal LLMs (MLLMs) to generalize across both language and vision tasks, LLMs and MLLMs have shown vulnerability to jailbreaking, generating textual outputs that undermine safety, ethical, and bias standards when exposed to harmful or sensitive inputs. With the recent advancement of safety alignment via preference-tuning from human feedback, LLMs and MLLMs have been equipped with safety guardrails to yield safe, ethical, and fair responses with regard to harmful inputs. However, despite the significance of safety alignment, research on the vulnerabilities remains largely underexplored. In this paper, we investigate the unexplored vulnerability of the safety alignment, examining its ability to consistently provide safety guarantees for out-of-distribution(OOD)-ifying harmful inputs that may fall outside the aligned data distribution. Our key observation is that OOD-ifying the vanilla harmful inputs highly increases the uncertainty of the model to discern the malicious intent within the input, leading to a higher chance of being jailbroken. Exploiting this vulnerability, we propose JOOD, a new Jailbreak framework via OOD-ifying inputs beyond the safety alignment. We explore various off-the-shelf visual and textual transformation techniques for OOD-ifying the harmful inputs. Notably, we observe that even simple mixing-based techniques such as image mixup prove highly effective in increasing the uncertainty of the model, thereby facilitating the bypass of the safety alignment. Experiments across diverse jailbreak scenarios demonstrate that JOOD effectively jailbreaks recent proprietary LLMs and MLLMs such as GPT-4 and o1 with high attack success rate, which previous attack approaches have consistently struggled to jailbreak. Code is available at https://github.com/naver-ai/JOOD.
Joonhyun Jeong, Seyun Bae, Yeonsung Jung, Jaeryong Hwang, Eunho Yang
CVPR3
2025 Preserve or Modify? Context-Aware Evaluation for Balancing Preservation and Modification in Text-Guided Image Editing
abstract
The development of vision-language and generative models has significantly advanced text-guided image editing, which seeks the preservation of core elements in the source image while implementing modifications based on the target text. However, existing metrics have a context-blindness problem, indiscriminately applying the same evaluation criteria on completely different pairs of source image and target text, biasing towards either modification or preservation. Directional CLIP similarity, the only metric that considers both source image and target text, is also biased towards modification aspects and attends to irrelevant editing regions of the image. We propose AugCLIP, a context-aware metric that adaptively coordinates preservation and modification aspects, depending on the specific context of a given source image and target text. This is done by deriving the CLIP representation of an ideally edited image, that preserves the source image with necessary modifications to align with target text. More specifically, using a multi-modal large language model, AugCLIP augments the textual descriptions of the source and target, then calculates a modification vector through a hyperplane that separates source and target attributes in CLIP space. Extensive experiments on five benchmark datasets, encompassing a diverse range of editing scenarios, show that AugCLIP aligns remarkably well with human evaluation standards, outperforming existing metrics. The code is available at https://github.com/augclip/augclip_eval.
Yoonjeon Kim, Soohyun Ryu, Yeonsung Jung, Hyunkoo Lee, Joowon Kim, June Yong Yang, Jaeryong Hwang, Eunho Yang
CVPR3
2025 Early Timestep Zero-Shot Candidate Selection for Instruction-Guided Image Editing
Joowon Kim, Ziseok Lee, Donghyeon Cho, Sanghyun Jo, Yeonsung Jung, Eunho Yang
ICCV5
2025 LANTERN: Accelerating Visual Autoregressive Models with Relaxed Speculative Decoding
abstract
Auto-Regressive (AR) models have recently gained prominence in image generation, often matching or even surpassing the performance of diffusion models. However, one major limitation of AR models is their sequential nature, which processes tokens one at a time, slowing down generation compared to models like GANs or diffusion-based methods that operate more efficiently. While speculative decoding has proven effective for accelerating LLMs by generating multiple tokens in a single forward, its application in visual AR models remains largely unexplored. In this work, we identify a challenge in this setting, which we term \textit{token selection ambiguity}, wherein visual AR models frequently assign uniformly low probabilities to tokens, hampering the performance of speculative decoding. To overcome this challenge, we propose a relaxed acceptance condition referred to as LANTERN that leverages the interchangeability of tokens in latent space. This relaxation restores the effectiveness of speculative decoding in visual AR models by enabling more flexible use of candidate tokens that would otherwise be prematurely rejected. Furthermore, by incorporating a total variation distance bound, we ensure that these speed gains are achieved without significantly compromising image quality or semantic coherence. Experimental results demonstrate the efficacy of our method in providing a substantial speed-up over speculative decoding. In specific, compared to a na\"ive application of the state-of-the-art speculative decoding, LANTERN increases speed-ups by $\mathbf{1.75}\times$ and $\mathbf{1.82}\times$, as compared to greedy decoding and random sampling, respectively, when applied to LlamaGen, a contemporary visual AR model. The code is publicly available at \url{https://github.com/jadohu/LANTERN}.
Doohyuk Jang, Sihwan Park 0001, June Yong Yang, Yeonsung Jung, Jihun Yun, Souvik Kundu 0009, Sungyub Kim, Eunho Yang
ICLR4
2024 PruNeRF: Segment-Centric Dataset Pruning via 3D Spatial Consistency
abstract
Neural Radiance Fields (NeRF) have shown remarkable performance in learning 3D scenes. However, NeRF exhibits vulnerability when confronted with distractors in the training images -- unexpected objects are present only within specific views, such as moving entities like pedestrians or birds. Excluding distractors during dataset construction is a straightforward solution, but without prior knowledge of their types and quantities, it becomes prohibitively expensive. In this paper, we propose PruNeRF, a segment-centric dataset pruning framework via 3D spatial consistency, that effectively identifies and prunes the distractors. We first examine existing metrics for measuring pixel-wise distraction and introduce Influence Functions for more accurate measurements. Then, we assess 3D spatial consistency using a depth-based reprojection technique to obtain 3D-aware distraction. Furthermore, we incorporate segmentation for pixel-to-segment refinement, enabling more precise identification. Our experiments on benchmark datasets demonstrate that PruNeRF consistently outperforms state-of-the-art methods in robustness against distractors.
Yeonsung Jung, Heecheol Yun, Joonhyung Park, Jin-Hwa Kim, Eunho Yang
ICML1
2024 A Simple Remedy for Dataset Bias via Self-Influence: A Mislabeled Sample Perspective
abstract
Learning generalized models from biased data is an important undertaking toward fairness in deep learning. To address this issue, recent studies attempt to identify and leverage bias-conflicting samples free from spurious correlations without prior knowledge of bias or an unbiased set. However, spurious correlation remains an ongoing challenge, primarily due to the difficulty in correctly detecting these samples. In this paper, inspired by the similarities between mislabeled samples and bias-conflicting samples, we approach this challenge from a novel perspective of mislabeled sample detection. Specifically, we delve into Influence Function, one of the standard methods for mislabeled sample detection, for identifying bias-conflicting samples and propose a simple yet effective remedy for biased models by leveraging them. Through comprehensive analysis and experiments on diverse datasets, we demonstrate that our new perspective can boost the precision of detection and rectify biased models effectively. Furthermore, our approach is complementary to existing methods, showing performance improvement even when applied to models that have already undergone recent debiasing techniques.
Yeonsung Jung, Jaeyun Song, June Yong Yang, Jin-Hwa Kim, Sungyub Kim, Eunho Yang
NeurIPS1
2023 Fighting Fire with Fire: Contrastive Debiasing without Bias-free Data via Generative Bias-transformation
abstract
Deep neural networks (DNNs), despite their ability to generalize with over-capacity networks, often rely heavily on the malignant bias as shortcuts instead of task-related information for discriminative tasks. This can lead to poor performance on real-world inputs, particularly when the majority of the sample is biased. To address the highly biased issue, recent studies either exploit auxiliary information which is rarely obtainable in practice or sift handful bias-free samples to emphasize them for debiasing. However, these methods are not always guaranteed to work due to unmet presumptions. In this paper, we propose Contrastive Debiasing via Generative Bias-transformation (CDvG) which is capable of operating without explicitly exploiting bias labels and bias-free samples. Motivated by our observation that not only discriminative models but also image translation models tend to focus on the malignant bias, CDvG employs an image translation model to transform the bias to another mode of bias while preserving task-relevant information. Through contrastive learning, the bias-transformed views are set against each other to learn bias-invariant representations. Our method shows a better debiasing effect when bias is more malignant as opposed to previous methods, and can also be integrated with the methods that focus on bias-free samples in a plug-and-play manner for further improvement. Experimental results on diverse datasets demonstrate that the proposed method outperforms the state-of-the-art, especially when bias-free samples are extremely scarce or absent.
Yeonsung Jung, Hajin Shim, June Yong Yang, Eunho Yang
ICML1