Enregistré dans:
Détails bibliographiques
Auteurs principaux: Aqsha, Alif, Bank, Peter, Sánchez-Betancourt, Leandro
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:https://arxiv.org/abs/2602.23473
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866914355577094144
author Aqsha, Alif
Bank, Peter
Sánchez-Betancourt, Leandro
author_facet Aqsha, Alif
Bank, Peter
Sánchez-Betancourt, Leandro
contents We study a signature-driven numerical scheme to solve multi-dimensional linear-quadratic (LQ) stochastic control problems. Using that linear signature functionals are dense in the natural class of admissible controls, we show that our approach turns the original LQ problem into a deterministic convex quadratic polynomial optimisation. To underpin a numerical approach based on truncated signatures, we prove that the problem's value function can be approximated by finite-dimensional polynomial approximations when the truncation levels are chosen sufficiently high. Remarkably, our numerical experiments show very decent accuracy already for small truncation levels. Key tools for our analysis are (i) the algebraic representation of controlled stochastic differential equations and the associated cost function as linear functionals of the path signatures of the driving noise, (ii) the convergence of the truncated linear functionals, and (iii) the density of signature controls.
format Preprint
id arxiv_https___arxiv_org_abs_2602_23473
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Solving Linear-Quadratic Stochastic Control Problems with Signatures
Aqsha, Alif
Bank, Peter
Sánchez-Betancourt, Leandro
Optimization and Control
We study a signature-driven numerical scheme to solve multi-dimensional linear-quadratic (LQ) stochastic control problems. Using that linear signature functionals are dense in the natural class of admissible controls, we show that our approach turns the original LQ problem into a deterministic convex quadratic polynomial optimisation. To underpin a numerical approach based on truncated signatures, we prove that the problem's value function can be approximated by finite-dimensional polynomial approximations when the truncation levels are chosen sufficiently high. Remarkably, our numerical experiments show very decent accuracy already for small truncation levels. Key tools for our analysis are (i) the algebraic representation of controlled stochastic differential equations and the associated cost function as linear functionals of the path signatures of the driving noise, (ii) the convergence of the truncated linear functionals, and (iii) the density of signature controls.
title Solving Linear-Quadratic Stochastic Control Problems with Signatures
topic Optimization and Control
url https://arxiv.org/abs/2602.23473