← Search

Seungyub Han

7 accepted papers

2025

Bellman Unbiasedness: Toward Provably Efficient Distributional Reinforcement Learning with General Value Function Approximation

ICML 2025poster

Distributional reinforcement learning improves performance by capturing environmental stochasticity, but a comprehensive theoretical understanding of its effectiveness remains elusive. In addition, the intractable element of the infinite dimensionality of distributions has been overlooked. In this p…

Cited by 0SourcePDFScholar
2025

Pareto Optimal Risk-Agnostic Distributional Bandits with Heavy-Tail Rewards

NeurIPS 2025poster

This paper addresses the problem of multi-risk measure agnostic multi-armed bandits in heavy-tailed reward settings. We propose a framework that leverages novel deviation inequalities for the $1$-Wasserstein distance to construct confidence intervals for Lipschitz risk measures. The distributional…

Cited by 0SourceScholar
2025

Policy-labeled Preference Learning: Is Preference Enough for RLHF?

ICML 2025spotlight

To design reward that align with human goals, Reinforcement Learning from Human Feedback (RLHF) has emerged as a prominent technique for learning reward functions from human preferences and optimizing models using reinforcement learning algorithms. However, existing RLHF methods often misinterpret…

Cited by 0SourcePDFScholar
2024

Spectral-Risk Safe Reinforcement Learning with Convergence Guarantees

NeurIPS 2024poster

The field of risk-constrained reinforcement learning (RCRL) has been developed to effectively reduce the likelihood of worst-case scenarios by explicitly handling risk-measure-based constraints. However, the nonlinearity of risk measures makes it challenging to achieve convergence and optimality. To…

2023

On the Convergence of Continual Learning with Adaptive Methods

UAI 2023poster

One of the objectives of continual learning is to prevent catastrophic forgetting in learning multiple tasks sequentially, and the existing solutions have been driven by the conceptualization of the plasticity-stability dilemma. However, the convergence of continual learning for each sequential task…

Cited by 4SourcePDFScholar
2023

Pitfall of Optimism: Distributional Reinforcement Learning by Randomizing Risk Criterion

NeurIPS 2023poster

Distributional reinforcement learning algorithms have attempted to utilize estimated uncertainty for exploration, such as optimism in the face of uncertainty. However, using the estimated variance for optimistic exploration may cause biased data collection and hinder convergence or performance. In t…

Cited by 4SourcePDFScholar
2023

SPQR: Controlling Q-ensemble Independence with Spiked Random Model for Reinforcement Learning

NeurIPS 2023poster

Alleviating overestimation bias is a critical challenge for deep reinforcement learning to achieve successful performance on more complex tasks or offline datasets containing out-of-distribution data. In order to overcome overestimation bias, ensemble methods for Q-learning have been investigated t…