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

Minjong Lee

dblp:342/7599 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0002-3159-5444ORCID · corroborated

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 · 2 · 1 first-author · 2 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
Trustworthy machine learning · 49% Generative modeling · 26% Language models and text generation · 15%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
0.912025
Holistic Unlearning Benchmark: A Multi-Faceted Evaluation for Text-to-Image Diffusion Model Unlearning · ICCV 2025
Natural language and speech › Language models and text generation › large language model › large language model adaptation › personalization
LLM personalization
0.912025
CoPL: Collaborative Preference Learning for Personalizing LLMs · EMNLP 2025
Machine learning › Trustworthy machine learning
machine unlearning
0.912025
Holistic Unlearning Benchmark: A Multi-Faceted Evaluation for Text-to-Image Diffusion Model Unlearning · ICCV 2025
Recommender systems
collaborative filtering
0.912025
CoPL: Collaborative Preference Learning for Personalizing LLMs · EMNLP 2025
Recommender systems › user modeling
preference reasoning
0.912025
CoPL: Collaborative Preference Learning for Personalizing LLMs · EMNLP 2025
Machine learning › Trustworthy machine learning › robustness › adversarial robustness › test-time defense
adversarial purification
0.712023
Robust Evaluation of Diffusion-Based Adversarial Purification · ICCV 2023
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.712023
Robust Evaluation of Diffusion-Based Adversarial Purification · ICCV 2023
Machine learning › Generative modeling › diffusion model
diffusion-based purification
0.712023
Robust Evaluation of Diffusion-Based Adversarial Purification · ICCV 2023
Machine learning › Trustworthy machine learning
robustness evaluation
0.712023
Robust Evaluation of Diffusion-Based Adversarial Purification · ICCV 2023
Machine learning › Efficient and distributed learning › parameter-efficient fine-tuning
LoRA mixture of experts
0.312025
CoPL: Collaborative Preference Learning for Personalizing LLMs · EMNLP 2025
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning
0.312025
CoPL: Collaborative Preference Learning for Personalizing LLMs · EMNLP 2025

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

mixture of experts · 1.7collaborative filtering · 1.7LoRA · 1.7benchmark design · 0.9white-box attack · 0.7diffusion model · 0.7
YearPublicationVenuePosition
2025 CoPL: Collaborative Preference Learning for Personalizing LLMs
abstract
Personalizing large language models (LLMs) is important for aligning outputs with diverse user preferences, yet existing methods struggle with flexibility and generalization.We propose CoPL (Collaborative Preference Learning), a graph-based collaborative filtering framework that models user-response relationships to enhance preference estimation, particularly in sparse annotation settings.By integrating a mixture of LoRA experts, CoPL efficiently fine-tunes LLMs while dynamically balancing shared and user-specific preferences.Additionally, an optimization-free adaptation strategy enables generalization to unseen users without fine-tuning.Experiments on TL;DR, UltraFeedback-P, and PersonalLLM datasets demonstrate that CoPL outperforms existing personalized reward models, effectively capturing both common and controversial preferences, making it a scalable solution for personalized LLM alignment.The code is available at https://github.com/ml-postech/CoPL.
Youngbin Choi, Seunghyuk Cho, Minjong Lee, Moonjeong Park, Yesong Ko, Jungseul Ok, Dongwoo Kim 0002
EMNLP3
2025 Holistic Unlearning Benchmark: A Multi-Faceted Evaluation for Text-to-Image Diffusion Model Unlearning
abstract
As text-to-image diffusion models gain widespread commercial applications, there are increasing concerns about unethical or harmful use, including the unauthorized generation of copyrighted or sensitive content. Concept unlearning has emerged as a promising solution to these challenges by removing undesired and harmful information from the pre-trained model. However, the previous evaluations primarily focus on whether target concepts are removed while preserving image quality, neglecting the broader impacts such as unintended side effects. In this work, we propose Holistic Unlearning Benchmark (HUB), a comprehensive framework for evaluating unlearning methods across six key dimensions: faithfulness, alignment, pinpoint-ness, multilingual robustness, attack robustness, and efficiency. Our benchmark covers 33 target concepts, including 16,000 prompts per concept, spanning four categories: Celebrity, Style, Intellectual Property, and NSFW. Our investigation reveals that no single method excels across all evaluation criteria. By releasing our evaluation code and dataset, we hope to inspire further research in this area, leading to more reliable and effective unlearning methods.
Saemi Moon, Minjong Lee, Sangdon Park 0001
ICCV2
2023 Robust Evaluation of Diffusion-Based Adversarial Purification
abstract
We question the current evaluation practice on diffusion-based purification methods. Diffusion-based purification methods aim to remove adversarial effects from an input data point at test time. The approach gains increasing attention as an alternative to adversarial training due to the disentangling between training and testing. Well-known white-box attacks are often employed to measure the robustness of the purification. However, it is unknown whether these attacks are the most effective for the diffusion-based purification since the attacks are often tailored for adversarial training. We analyze the current practices and provide a new guideline for measuring the robustness of purification methods against adversarial attacks. Based on our analysis, we further propose a new purification strategy improving robustness compared to the current diffusion-based purification methods.
Minjong Lee, Dongwoo Kim 0002
ICCV1