activity
20222026
most citedA Smooth Polynomial Lyapunov Certificate for Convergence of Q-Learning and Its Smooth Variants

1 citations · 1 across the 6 of their papers we have counts for

collaborators

6 papers

cs.LG2026

Safe-Support Q-Learning: Learning without Unsafe Exploration

Yeeun Lim, Narim Jeong, Donghwan Lee

Ensuring safety during reinforcement learning (RL) training is critical in real-world applications where unsafe exploration can lead to devastating outcomes. While most safe RL met…

cs.LG2026

Finite-Time Analysis of Q-Value Iteration for General-Sum Stackelberg Games

Narim Jeong, Donghwan Lee

Reinforcement learning has been successful both empirically and theoretically in single-agent settings, but extending these results to multi-agent reinforcement learning in general…

cs.LG2024★ 1 cited

A Smooth Polynomial Lyapunov Certificate for Convergence of Q-Learning and Its Smooth Variants

Donghwan Lee, Hyunjun Na

Classical convergence analyses of Q-learning rely on the -norm contraction of Bellman operators, and existing ordinary differential equation (ODE) arguments often use the n…

cs.LG2024

Finite-Time Error Analysis of Soft Q-Learning: Switching System Approach

Narim Jeong, Donghwan Lee

Soft Q-learning is a variation of Q-learning designed to solve entropy regularized Markov decision problems where an agent aims to maximize the entropy regularized value function.…

eess.SY2024

Analysis of Off-Policy Multi-Step TD-Learning with Linear Function Approximation

Donghwan Lee

This paper analyzes multi-step TD-learning algorithms within the `deadly triad' scenario, characterized by linear function approximation, off-policy learning, and bootstrapping. In…

eess.SY2022

Final Iteration Convergence Bound of Q-Learning: Switching System Approach

Donghwna Lee

Q-learning is known as one of the fundamental reinforcement learning (RL) algorithms. Its convergence has been the focus of extensive research over the past several decades. Recent…