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

Daewon Chae

dblp:354/4231 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2025
0009-0005-2552-1800ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 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
2 papers
Generative modeling · 36% Reinforcement learning · 23% Language models and text generation · 18%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
0.912025
DiffExp: Efficient Exploration in Reward Fine-tuning for Text-to-Image Diffusion Models · AAAI 2025
Natural language and speech › Language models and text generation › large language model inference
inference-time computation
0.912025
VersaPRM: Multi-Domain Process Reward Model via Synthetic Reasoning Data · ICML 2025
Machine learning › Reinforcement learning › reinforcement learning from human feedback
process reward model
0.912025
VersaPRM: Multi-Domain Process Reward Model via Synthetic Reasoning Data · ICML 2025
Machine learning › Generative modeling › diffusion model › diffusion model adaptation
reward fine-tuning
0.912025
DiffExp: Efficient Exploration in Reward Fine-tuning for Text-to-Image Diffusion Models · AAAI 2025
Machine learning › Learning theory
weighted majority vote
0.912025
VersaPRM: Multi-Domain Process Reward Model via Synthetic Reasoning Data · ICML 2025
Machine learning › Transfer learning and domain adaptation › domain generalization
multi-source domain generalization
0.312025
VersaPRM: Multi-Domain Process Reward Model via Synthetic Reasoning Data · ICML 2025
Machine learning › Reinforcement learning
sample efficiency
0.312025
DiffExp: Efficient Exploration in Reward Fine-tuning for Text-to-Image Diffusion Models · AAAI 2025

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

synthetic reasoning data generation · 0.9process reward modeling · 0.9phrase weighting · 0.9classifier-free guidance · 0.9alignprop · 0.9DDPO · 0.9
YearPublicationVenuePosition
2025 DiffExp: Efficient Exploration in Reward Fine-tuning for Text-to-Image Diffusion Models
abstract
Fine-tuning text-to-image diffusion models to maximize rewards has proven effective for enhancing model performance. However, reward fine-tuning methods often suffer from slow convergence due to online sample generation. Therefore, obtaining diverse samples with strong reward signals is crucial for improving sample efficiency and overall performance. In this work, we introduce DiffExp, a simple yet effective exploration strategy for reward fine-tuning of text-to-image models. Our approach employs two key strategies: (a) dynamically adjusting the scale of classifier-free guidance to enhance sample diversity, and (b) randomly weighting phrases of the text prompt to exploit high-quality reward signals. We demonstrate that these strategies significantly enhance exploration during online sample generation, improving the sample efficiency of recent reward fine-tuning methods, such as DDPO and AlignProp.
Daewon Chae, June Suk Choi, Kimin Lee
AAAI1
2025 VersaPRM: Multi-Domain Process Reward Model via Synthetic Reasoning Data
abstract
Process Reward Models (PRMs) have proven effective at enhancing mathematical reasoning for Large Language Models (LLMs) by leveraging increased inference-time computation. However, they are predominantly trained on mathematical data and their generalizability to non-mathematical domains has not been rigorously studied. In response, this work first shows that current PRMs have poor performance in other domains. To address this limitation, we introduce ***VersaPRM***, a multi-domain PRM trained on synthetic reasoning data generated using our novel data generation and annotation method. VersaPRM achieves consistent performance gains across diverse domains. For instance, in the MMLU-Pro category of Law, VersaPRM via weighted majority voting, achieves a 7.9% performance gain over the majority voting baseline–surpassing Qwen2.5-Math-PRM's gain of 1.3%. We further contribute to the community by open-sourcing all data, code and models for VersaPRM.
Thomas Zeng 0003, Shuibai Zhang, Shutong Wu, Christian Classen, Daewon Chae, Ethan Ewer, Heeju Kim, Wonjun Kang, Jackson Kunde, Jungtaek Kim 0001, Hyung Il Koo, Kannan Ramchandran, Dimitris S. Papailiopoulos, Kangwook Lee 0001
ICML5
2024 Clustering-based Image-Text Graph Matching for Domain Generalization
Nokyung Park, Daewon Chae, Jeongyong Shim, Sangpil Kim, Eun-Sol Kim, Jinkyu Kim 0001
ICPR (10)2
2024 Text-Driven Prototype Learning for Few-Shot Class-Incremental Learning
Seongbeom Park, Haeji Jung, Daewon Chae, Hyunju Yun, Sungyoon Kim, Suhong Moon, Jinkyu Kim 0001, Seunghyun Park 0001
ICPR (9)3