← Search

Dongmin Park

16 accepted papers

2026

Lookahead Unmasking Elicits Reliable Decoding in Diffusion Language Models

ICML 2026poster

Masked Diffusion Models (MDMs) as language models generate by iteratively unmasking tokens, yet their performance crucially depends on the inference-time order of unmasking. Conventional methods such as confidence-based sampling are short-sighted, focusing on local optimization which neglects test-t…

Cited by 0SourceScholar
2026

Orak: A Foundational Benchmark for Training and Evaluating LLM Agents on Diverse Video Games

ICLR 2026poster

Large Language Model (LLM) agents are reshaping the game industry, by enabling more intelligent and human-preferable characters. Yet, current game benchmarks fall short of practical needs: they lack evaluations of diverse LLM capabilities across various game genres, studies of agentic modules crucia…

Cited by 0SourceScholar
2026

See and Fix the Flaws: Enabling VLMs and Diffusion Models to Comprehend Visual Artifacts via Agentic Data Synthesis

CVPR 2026

Despite recent advances in diffusion models, AI generated images still often contain visual artifacts that compromise realism. Although more thorough pre-training and bigger models might reduce artifacts, there is no assurance that they can be completely eliminated, which makes artifact mitigation a

Cited by 0SourcecodeScholar
2026

VLM-SubtleBench: How Far Are VLMs from Human-Level Subtle Comparative Reasoning?

ICLR 2026poster

The ability to distinguish subtle differences between visually similar images is essential for diverse domains such as industrial anomaly detection, medical imaging, and aerial surveillance. While comparative reasoning benchmarks for vision-language models (VLMs) have recently emerged, they primaril…

Cited by 0SourcecodeScholar
2025

Active Learning for Continual Learning: Keeping the Past Alive in the Present

ICLR 2025poster

*Continual learning (CL)* enables deep neural networks to adapt to ever-changing data distributions. In practice, there may be scenarios where annotation is costly, leading to *active continual learning (ACL)*, which performs *active learning (AL)* for the CL scenarios when reducing the labeling cos…

Cited by 0SourcePDFScholar
2025

FlashAdventure: A Benchmark for GUI Agents Solving Full Story Arcs in Diverse Adventure Games

EMNLP 2025

GUI agents powered by LLMs show promise in interacting with diverse digital environments. Among these, video games offer a valuable testbed due to their varied interfaces, with adventure games posing additional challenges through complex, narrative-driven interactions. Existing game benchmarks, howe

Cited by 0SourcePDFScholar
2025

Rare-to-Frequent: Unlocking Compositional Generation Power of Diffusion Models on Rare Concepts with LLM Guidance

ICLR 2025spotlight

State-of-the-art text-to-image (T2I) diffusion models often struggle to generate rare compositions of concepts, e.g., objects with unusual attributes. In this paper, we show that the compositional generation power of diffusion models on such rare concepts can be significantly enhanced by the Large L…

2025

Test-time Alignment of Diffusion Models without Reward Over-optimization

ICLR 2025spotlight

Diffusion models excel in generative tasks, but aligning them with specific objectives while maintaining their versatility remains challenging. Existing fine-tuning methods often suffer from reward over-optimization, while approximate guidance approaches fail to optimize target rewards effectively.…

2024

Adaptive Shortcut Debiasing for Online Continual Learning

AAAI 2024technical

We propose a novel framework DropTop that suppresses the shortcut bias in online continual learning (OCL) while being adaptive to the varying degree of the shortcut bias incurred by continuously changing environment. By the observed high-attention property of the shortcut bias, highly-activated feat…

2024

One Size Fits All for Semantic Shifts: Adaptive Prompt Tuning for Continual Learning

ICML 2024poster

In real-world continual learning (CL) scenarios, tasks often exhibit intricate and unpredictable semantic shifts, posing challenges for *fixed* prompt management strategies which are tailored to only handle semantic shifts of *uniform* degree (i.e., uniformly mild or uniformly abrupt). To address th…

2023

Context Consistency Regularization for Label Sparsity in Time Series

ICML 2023poster

Labels are typically sparse in real-world time series due to the high annotation cost. Recently, consistency regularization techniques have been used to generate artificial labels from unlabeled augmented instances. To fully exploit the sequential characteristic of time series in consistency regular…

Cited by 11SourcePDFScholar
2023

Robust Data Pruning under Label Noise via Maximizing Re-labeling Accuracy

NeurIPS 2023poster

Data pruning, which aims to downsize a large training set into a small informative subset, is crucial for reducing the enormous computational costs of modern deep learning. Though large-scale data collections invariably contain annotation noise and numerous robust learning methods have been develope…

2022

Meta-Learning for Online Update of Recommender Systems

AAAI 2022technical

Online recommender systems should be always aligned with users' current interest to accurately suggest items that each user would like. Since user interest usually evolves over time, the update strategy should be flexible to quickly catch users' current interest from continuously generated new user-…

2022

Meta-Query-Net: Resolving Purity-Informativeness Dilemma in Open-set Active Learning

NeurIPS 2022accept

Unlabeled data examples awaiting annotations contain open-set noise inevitably. A few active learning studies have attempted to deal with this open-set noise for sample selection by filtering out the noisy examples. However, because focusing on the purity of examples in a query set leads to overlook…

2021

Task-Agnostic Undesirable Feature Deactivation Using Out-of-Distribution Data

NeurIPS 2021poster

A deep neural network (DNN) has achieved great success in many machine learning tasks by virtue of its high expressive power. However, its prediction can be easily biased to undesirable features, which are not essential for solving the target task and are even imperceptible to a human, thereby resul…

2019

Continual Learning by Asymmetric Loss Approximation With Single-Side Overestimation

ICCV 2019poster

Catastrophic forgetting is a critical challenge in training deep neural networks. Although continual learning has been investigated as a countermeasure to the problem, it often suffers from the requirements of additional network components and the limited scalability to a large number of tasks. We p…

Cited by 49PDFScholar