← Search

Geon-hyeong Kim

14 accepted papers

2026

A Regret Minimization Framework on Preference Learning in Large Language Models

ICML 2026spotlight

Reinforcement learning with verifiable rewards (RLVR) has enabled progress on reasoning-intensive tasks by relying on task-specific verifiers that provide automated correctness signals. However, many realistic language tasks are difficult to equip with reliable verifiers, motivating a growing relian…

Cited by 0SourceScholar
2026

Designing Observation and Action Models for Efficient Reinforcement Learning with LLMs

ICML 2026poster

Large Language Models (LLMs) have emerged as powerful tools for semantic reasoning, enabling the formalization of tasks that traditionally relied on manual human intuition. This capability extends to environment design in Reinforcement Learning (RL). While prior research predominantly focuses on rew…

Cited by 0SourceScholar
2026

SafeDPO: A Simple Approach to Direct Preference Optimization with Enhanced Safety

ICLR 2026oral

As Large Language Models (LLMs) are increasingly deployed in real-world applications, balancing both helpfulness and safety has become a central challenge. A natural approach is to incorporate safety constraints into Reinforcement Learning from Human Feedback (RLHF), where recent studies have shown…

Cited by 0SourceScholar
2025

Online Pre-Training for Offline-to-Online Reinforcement Learning

ICML 2025poster

Offline-to-online reinforcement learning (RL) aims to integrate the complementary strengths of offline and online RL by pre-training an agent offline and subsequently fine-tuning it through online interactions. However, recent studies reveal that offline pre-trained agents often underperform during…

Cited by 0SourcePDFScholar
2024

Degeneration-free Policy Optimization: RL Fine-Tuning for Language Models without Degeneration

ICML 2024poster

As the pre-training objectives (e.g., next token prediction) of language models (LMs) are inherently not aligned with task scores, optimizing LMs to achieve higher downstream task scores is essential. One of the promising approaches is to fine-tune LMs through reinforcement learning (RL). However, c…

Cited by 0SourcePDFScholar
2024

Prospector: Improving LLM Agents with Self-Asking and Trajectory Ranking

EMNLP 2024finding

Large language models (LLMs) have shown the ability to solve complex decision-making tasks beyond natural language processing tasks. LLM agents based on few-shot in-context learning (ICL) achieve surprisingly high performance without training. Despite their simplicity and generalizability, ICL-based…

Cited by 8SourcePDFScholar
2023

Information-Theoretic State Space Model for Multi-View Reinforcement Learning

ICML 2023oral

Multi-View Reinforcement Learning (MVRL) seeks to find an optimal control for an agent given multi-view observations from various sources. Despite recent advances in multi-view learning that aim to extract the latent representation from multi-view data, it is not straightforward to apply them to con…

Cited by 4SourcePDFScholar
2023

SafeDICE: Offline Safe Imitation Learning with Non-Preferred Demonstrations

NeurIPS 2023poster

We consider offline safe imitation learning (IL), where the agent aims to learn the safe policy that mimics preferred behavior while avoiding non-preferred behavior from non-preferred demonstrations and unlabeled demonstrations. This problem setting corresponds to various real-world scenarios, where…

Cited by 1SourcePDFScholar
2022

DemoDICE: Offline Imitation Learning with Supplementary Imperfect Demonstrations

ICLR 2022poster

We consider offline imitation learning (IL), which aims to mimic the expert's behavior from its demonstration without further interaction with the environment. One of the main challenges in offline IL is to deal with the narrow support of the data distribution exhibited by the expert demonstrations…

Cited by 105SourcePDFScholar
2022

LobsDICE: Offline Learning from Observation via Stationary Distribution Correction Estimation

NeurIPS 2022accept

We consider the problem of learning from observation (LfO), in which the agent aims to mimic the expert's behavior from the state-only demonstrations by experts. We additionally assume that the agent cannot interact with the environment but has access to the action-labeled transition data collected…

2021

Multi-View Representation Learning via Total Correlation Objective

NeurIPS 2021poster

Multi-View Representation Learning (MVRL) aims to discover a shared representation of observations from different views with the complex underlying correlation. In this paper, we propose a variational approach which casts MVRL as maximizing the amount of total correlation reduced by the representati…

Cited by 52SourcePDFScholar
2020

Variational Inference for Sequential Data with Future Likelihood Estimates

ICML 2020poster

The recent development of flexible and scalable variational inference algorithms has popularized the use of deep probabilistic models in a wide range of applications. However, learning and reasoning about high-dimensional models with nondifferentiable densities are still a challenge. For such a mode…

Cited by 5SourcePDFScholar
2020

Variational Interaction Information Maximization for Cross-domain Disentanglement

NeurIPS 2020poster

Cross-domain disentanglement is the problem of learning representations partitioned into domain-invariant and domain-specific representations, which is a key to successful domain transfer or measuring semantic distance between two domains. Grounded in information theory, we cast the simultaneous lea…