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

Hayeong Lee

dblp:341/8290 · DBLP profile ↗
← Back
3ranked-venue papers
0as 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 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
Reinforcement learning · 75% Generative modeling · 19% Vision and language · 6%
Network and information security
1 paper
Security and privacy of machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › hierarchical reinforcement learning
skill learning
0.912025
NBDI: A Simple and Effective Termination Condition for Skill Extraction from Task-Agnostic Demonstrations · ICML 2025
Machine learning › Generative modeling › diffusion model
text-to-image generation
0.912025
Iterative Prompt Refinement for Safer Text-to-Image Generation · EMNLP 2025
Security and privacy of machine learning › generative model safety
text-to-image model safety
0.912025
Iterative Prompt Refinement for Safer Text-to-Image Generation · EMNLP 2025
Machine learning › Reinforcement learning
offline reinforcement learning
0.812024
ROIDICE: Offline Return on Investment Maximization for Efficient Decision Making · NeurIPS 2024
Machine learning › Reinforcement learning
policy optimization
0.812024
ROIDICE: Offline Return on Investment Maximization for Efficient Decision Making · NeurIPS 2024
Machine learning › Reinforcement learning
hierarchical reinforcement learning
0.312025
NBDI: A Simple and Effective Termination Condition for Skill Extraction from Task-Agnostic Demonstrations · ICML 2025
Computer vision › Vision and language
vision-language model
0.312025
Iterative Prompt Refinement for Safer Text-to-Image Generation · EMNLP 2025

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

supervised fine-tuning · 1.7iterative prompt refinement · 1.7state-action novelty module · 0.9novelty estimation · 0.9stationary distribution correction · 0.8linear fractional programming · 0.8
YearPublicationVenuePosition
2025 Iterative Prompt Refinement for Safer Text-to-Image Generation
abstract
Text-to-Image (T2I) models have made remarkable progress in generating images from text prompts, but their output quality and safety still depend heavily on how prompts are phrased.Existing safety methods typically refine prompts using large language models (LLMs), but they overlook the images produced, which can result in unsafe outputs or unnecessary changes to already safe prompts.To address this, we propose an iterative prompt refinement algorithm that uses Vision Language Models (VLMs) to analyze both the input prompts and the generated images.By leveraging visual feedback, our method refines prompts more effectively, improving safety while maintaining user intent and reliability comparable to existing LLM-based approaches.Additionally, we introduce a new dataset labeled with both textual and visual safety signals using off-the-shelf multi-modal LLM, enabling supervised fine-tuning.Experimental results demonstrate that our approach produces safer outputs without compromising alignment with user intent, offering a practical solution for generating safer T2I content.Our code is available at https://github.com/ku-dmlab/IPR.WARNING: This paper contains examples of harmful or inappropriate images generated by models.
Jinwoo Jeon, JunHyeok Oh, Hayeong Lee, Byung-Jun Lee 0001
EMNLP3
2025 NBDI: A Simple and Effective Termination Condition for Skill Extraction from Task-Agnostic Demonstrations
abstract
Intelligent agents are able to make decisions based on different levels of granularity and duration. Recent advances in skill learning enabled the agent to solve complex, long-horizon tasks by effectively guiding the agent in choosing appropriate skills. However, the practice of using fixed-length skills can easily result in skipping valuable decision points, which ultimately limits the potential for further exploration and faster policy learning. In this work, we propose to learn a simple and effective termination condition that identifies decision points through a state-action novelty module that leverages agent experience data. Our approach, Novelty-based Decision Point Identification (NBDI), outperforms previous baselines in complex, long-horizon tasks, and remains effective even in the presence of significant variations in the environment configurations of downstream tasks, highlighting the importance of decision point identification in skill learning.
Myunsoo Kim, Hayeong Lee, Seongwoong Shim, JunHo Seo 0001, Byung-Jun Lee 0001
ICML2
2024 ROIDICE: Offline Return on Investment Maximization for Efficient Decision Making
abstract
In this paper, we propose a novel policy optimization framework that maximizes Return on Investment (ROI) of a policy using a fixed dataset within a Markov Decision Process (MDP) equipped with a cost function. ROI, defined as the ratio between the return and the accumulated cost of a policy, serves as a measure of efficiency of the policy. Despite the importance of maximizing ROI in various applications, it remains a challenging problem due to its nature as a ratio of two long-term values: return and accumulated cost. To address this, we formulate the ROI maximizing reinforcement learning problem as a linear fractional programming. We then incorporate the stationary distribution correction (DICE) framework to develop a practical offline ROI maximization algorithm. Our proposed algorithm, ROIDICE, yields an efficient policy that offers a superior trade-off between return and accumulated cost compared to policies trained using existing frameworks.
Woosung Kim, Hayeong Lee, Jongmin Lee 0004, Byung-Jun Lee 0001
NeurIPS2