On the stability of Lipschitz continuous control problems and its applications to reinforcement learning

We address the crucial yet underexplored stability properties of the Hamilton–Jacobi–Bellman (HJB) equation in model-free reinforcement learning contexts with a focus on Lipschitz continuous optimal control problems. By an established connection between Lipschitz continuous optimal control problems and classical optimal control problems, we provide new insights into the stability of the value functions. Specifically, we investigate the generic convergence property as well as the rate of convergence of value functions as the Lipschitz constraint increases. Moreover, we present a generalized Hamilton–Jacobi based reinforcement learning framework that accommodates general \(L^{p}\) geometries in the control regularization. To evaluate the stability properties and performance of our proposed method, we conduct various numerical experiments using benchmark examples and compare its efficacy with existing approaches.

Authors

Institutions

Publication Details

Journal
Advances in Continuous and Discrete Models
Published
2026-06-17
DOI
https://doi.org/10.1186/s13662-026-04110-2
Primary Topic
Adaptive Dynamic Programming Control
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On the stability of Lipschitz continuous control problems and its applications to reinforcement learning

Yeoneung Kim, Namkyeong Cho
Advances in Continuous and Discrete Models
Adaptive Dynamic Programming Control
article

On the stability of Lipschitz continuous control problems and its applications to reinforcement learning

Yeoneung Kim, Namkyeong Cho
article en

Abstract

We address the crucial yet underexplored stability properties of the Hamilton–Jacobi–Bellman (HJB) equation in model-free reinforcement learning contexts with a focus on Lipschitz continuous optimal control problems. By an established connection between Lipschitz continuous optimal control problems and classical optimal control problems, we provide new insights into the stability of the value functions. Specifically, we investigate the generic convergence property as well as the rate of convergence of value functions as the Lipschitz constraint increases. Moreover, we present a generalized Hamilton–Jacobi based reinforcement learning framework that accommodates general \(L^{p}\) geometries in the control regularization. To evaluate the stability properties and performance of our proposed method, we conduct various numerical experiments using benchmark examples and compare its efficacy with existing approaches.

Advances in Continuous and Discrete Models
Seoul National University of Science and Technology (KR), Gachon University (KR)
Openalex Percentile: Top 5%
Adaptive Dynamic Programming Control
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.