← Search

Minchan Jeong

11 accepted papers

2026

Group-Normalized Implicit Value Optimization for Language Models

ICLR 2026poster

Fine-tuning Large Language Models (LLMs) with reinforcement learning (RL) has become a key technique for enhancing performance on a wide range of tasks, from user alignment to complex reasoning. However, this approach is often hindered by the difficulty of fine-grained credit assignment, as it typic…

Cited by 0SourceScholar
2025

DPAIL: Training Diffusion Policy for Adversarial Imitation Learning without Policy Optimization

NeurIPS 2025poster

Human experts employ diverse strategies to complete a task, producing to multi-modal demonstration data. Although traditional Adversarial Imitation Learning (AIL) methods have achieved notable success, they often collapse theses multi-modal behaviors into a single strategy, failing to replicate expe…

Cited by 0SourceScholar
2025

Efficient Parametric SVD of Koopman Operator for Stochastic Dynamical Systems

NeurIPS 2025poster

The Koopman operator provides a principled framework for analyzing nonlinear dynamical systems through linear operator theory. Recent advances in dynamic mode decomposition (DMD) have shown that trajectory data can be used to identify dominant modes of a system in a data-driven manner. Building on t…

Cited by 0SourceScholar
2024

BAPO: Base-Anchored Preference Optimization for Overcoming Forgetting in Large Language Models Personalization

EMNLP 2024finding

While learning to align Large Language Models (LLMs) with human preferences has shown remarkable success, aligning these models to meet the diverse user preferences presents further challenges in preserving previous knowledge. This paper examines the impact of personalized preference optimization on…

2024

FedSOL: Stabilized Orthogonal Learning with Proximal Restrictions in Federated Learning

CVPR 2024poster

Federated Learning (FL) aggregates locally trained models from individual clients to construct a global model. While FL enables learning a model with data privacy it often suffers from significant performance degradation when clients have heterogeneous data distributions. This data heterogeneity cau…

2024

Hard Prompts Made Interpretable: Sparse Entropy Regularization for Prompt Tuning with RL

ACL 2024long

With the advent of foundation models, prompt tuning has positioned itself as an important technique for directing model behaviors and eliciting desired responses. Prompt tuning regards selecting appropriate keywords included into the input, thereby adapting to the downstream task without adjusting o…

2023

Bayesian Multi-Task Transfer Learning for Soft Prompt Tuning

EMNLP 2023long findings

Prompt tuning, in which prompts are optimized to adapt large-scale pre-trained language models to downstream tasks instead of fine-tuning the full model parameters, has been shown to be particularly effective when the prompts are trained in the multi-task transfer learning setting. These methods gen…

Cited by 0SourcecodeScholar
2023

Contextual Linear Bandits under Noisy Features: Towards Bayesian Oracles

AISTATS 2023poster

We study contextual linear bandit problems under feature uncertainty; they are noisy with missing entries. To address the challenges of the noise, we analyze Bayesian oracles given observed noisy features. Our Bayesian analysis finds that the optimal hypothesis can be far from the underlying realiza…

2022

Preservation of the Global Knowledge by Not-True Distillation in Federated Learning

NeurIPS 2022accept

In federated learning, a strong global model is collaboratively learned by aggregating clients' locally trained models. Although this precludes the need to access clients' data directly, the global model's convergence often suffers from data heterogeneity. This study starts from an analogy to contin…