Salvato in:
Dettagli Bibliografici
Autori principali: Teng, Ruyi, Wang, Dan, Chen, Wei, Gao, Yulong
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:https://arxiv.org/abs/2510.23332
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866918173132980224
author Teng, Ruyi
Wang, Dan
Chen, Wei
Gao, Yulong
author_facet Teng, Ruyi
Wang, Dan
Chen, Wei
Gao, Yulong
contents Distributional linear quadratic regulator (LQR) is a new framework that integrates the distributional reinforcement learning and classical LQR, which offers a new way to study the random return instead of the expected cost. Unlike iterative approximation using dynamic programming in the DRL, a closed-form expression for the random return can be exactly characterized in the distributional LQR, which is defined over infinitely many random variables. In recent work [1, 2], it has been shown that this random return can be well approximated by a finite number of random variables, which we call truncated random return. In this paper, we study the truncated random return in the distributional LQR. We show that the truncated random return can be naturally expressed in the quadratic form. We develop a sufficient condition for the positive definiteness of the block symmetric matrix in the quadratic form and provide the lower and upper bounds on the eigenvalues of this matrix. We further show that in this case, the truncated random return follows a positively weighted non-central chi-square distribution if the random disturbances admits Gaussian, and its cumulative distribution function is log-concave if the probability density function of the random disturbances is log-concave.
format Preprint
id arxiv_https___arxiv_org_abs_2510_23332
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Quadratic Truncated Random Return in Distributional LQR: Positive Definiteness, Density, and Log-Concavity
Teng, Ruyi
Wang, Dan
Chen, Wei
Gao, Yulong
Optimization and Control
Distributional linear quadratic regulator (LQR) is a new framework that integrates the distributional reinforcement learning and classical LQR, which offers a new way to study the random return instead of the expected cost. Unlike iterative approximation using dynamic programming in the DRL, a closed-form expression for the random return can be exactly characterized in the distributional LQR, which is defined over infinitely many random variables. In recent work [1, 2], it has been shown that this random return can be well approximated by a finite number of random variables, which we call truncated random return. In this paper, we study the truncated random return in the distributional LQR. We show that the truncated random return can be naturally expressed in the quadratic form. We develop a sufficient condition for the positive definiteness of the block symmetric matrix in the quadratic form and provide the lower and upper bounds on the eigenvalues of this matrix. We further show that in this case, the truncated random return follows a positively weighted non-central chi-square distribution if the random disturbances admits Gaussian, and its cumulative distribution function is log-concave if the probability density function of the random disturbances is log-concave.
title Quadratic Truncated Random Return in Distributional LQR: Positive Definiteness, Density, and Log-Concavity
topic Optimization and Control
url https://arxiv.org/abs/2510.23332