Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This paper presents Trajectory-Regularized Stochastic Optimal Control (TRSOC), a theoretical framework that integrates Kullback-Leibler divergence penalties into standard stochastic optimal control to balance performance with adherence to reference dynamics. By leveraging Girsanov's theorem, the method preserves dynamic programming structures while offering closed-form solutions in linear-quadratic settings and demonstrating utility for offline data-driven tasks. This advancement directly impacts machine learning applications requiring robust policy optimization under distributional constraints or safety guidelines.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Trajectory-Regularized Stochastic Optimal Control via KL Divergence

arXiv2 min read

arXiv:2607.22201v1 Announce Type: cross Abstract: We introduce trajectory-regularized stochastic optimal control (TRSOC), which augments standard stochastic optimal control (SOC) with a Kullback--Leibler (KL) divergence between controlled and reference trajectory distributions. Using Girsanov's theorem, the trajectory KL reduces to a quadratic drift mismatch penalty, yielding a modified running cost that preserves the dynamic programming (DP) structure. We derive the corresponding Hamilton--Jacobi--Bellman (HJB) equation and characterize the optimal policy. In the linear-quadratic (LQ) setting, the formulation admits a closed-form solution with an augmented control cost. Experiments show that the regularization parameter induces a trade-off between performance-driven and reference-preserving behavior, including cases with reference dynamics learned from offline data.

Abstract:We introduce trajectory-regularized stochastic optimal control (TRSOC), which augments standard stochastic optimal control (SOC) with a Kullback--Leibler (KL) divergence between controlled and reference trajectory distributions. Using Girsanov's theorem, the trajectory KL reduces to a quadratic drift mismatch penalty, yielding a modified running cost that preserves the dynamic programming (DP) structure. We derive the corresponding Hamilton--Jacobi--Bellman (HJB) equation and characterize the optimal policy. In the linear-quadratic (LQ) setting, the formulation admits a closed-form solution with an augmented control cost. Experiments show that the regularization parameter induces a trade-off between performance-driven and reference-preserving behavior, including cases with reference dynamics learned from offline data.

Systems and Control (eess.SY); Machine Learning (cs.LG)

arXiv:2607.22201 [eess.SY]

(or arXiv:2607.22201v1 [eess.SY] for this version)

https://doi.org/10.48550/arXiv.2607.22201 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 199 words

Related coverage