mlsanityData to 7 Oct 2026

Safe Approximate Dynamic Programming Via Kernelized Lipschitz Estimation

arXiv 1907.02151 ↗First posted 3 Jul 2019eess.SY cs.LG cs.SYcited by 4

Not on the map. Why?

Abstract (arXiv)

We develop a method for obtaining safe initial policies for reinforcement learning via approximate dynamic programming (ADP) techniques for uncertain systems evolving with discrete-time dynamics. We employ kernelized Lipschitz estimation and semidefinite programming for computing admissible initial control policies with provably high probability. Such admissible controllers enable safe initialization and constraint enforcement while providing exponential stability of the equilibrium of the closed-loop system.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Jul 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 0; 2025: 1.

4 papers.