Risk-Sensitive Stochastic Optimal Control

• Risk-sensitive stochastic optimal control is a framework that integrates risk measures (e.g., CVaR, exponential-of-cost criteria) into stochastic systems to address variability and tail risks.
• It employs techniques such as dynamic programming, nonlinear HJB equations, and Pontryagin’s maximum principle to derive optimal policies under uncertainty.
• The approaches are applied in wireless scheduling, robotic control, financial optimization, and mean-field games to ensure robust performance in uncertain environments.

Searching arXiv for recent and foundational papers on risk-sensitive stochastic optimal control. Risk-sensitive stochastic optimal control studies control laws for stochastic systems when the objective is not limited to an expected cumulative cost or reward, but instead incorporates tail behavior, variability, or dynamically updated notions of risk. In the literature represented here, the subject appears in several mathematically distinct forms: exponential-of-cost or entropic criteria for finite- and infinite-horizon problems, Conditional Value-at-Risk (CVaR), dynamic convex or coherent risk measures, and explicit risk constraints such as bounded probabilities of failure. Across discrete-time MDPs, controlled diffusions, mean-field systems, and forward-backward stochastic systems, a recurrent theme is that the risk-neutral formulation is recovered in small-parameter limits such as $\theta\to0$, $\mu\to0$, or $\gamma\to0$, where variance enters at first order in the expansion of the criterion (Bensoussan et al., 2017, Broek et al., 2012, Djehiche et al., 2014).

1. Risk criteria and problem classes

A central formulation uses an exponential transform of cumulative cost. In finite-horizon discrete time, one example is

$$J_T^\pi=\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\},$$

with infinite-horizon average analogue

$$J^\pi=\limsup_{T\to\infty}\frac1{\gamma T}\log\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\}.$$

This multiplicative criterion is used, for example, in queueing control for wireless transmission scheduling (Singh et al., 2017). In continuous time, a standard cost-minimization form is

$$J(t,x;u)=\frac1\mu\ln \mathbb E\Bigl[\exp\Bigl\{\mu\!\int_t^T f\bigl(s,X^{t,x;u}(s),u(s)\bigr)\,ds+\mu\,h\bigl(X^{t,x;u}(T)\bigr)\Bigr\}\Bigr],$$

which is equivalent to a recursive formulation through a backward component of an FBSDE (Dong et al., 5 Feb 2026). Mean-field variants replace the state law by its marginal distribution or a functional of that law, yielding risk-sensitive McKean–Vlasov control problems (Bensoussan et al., 2017).

Long-run formulations on finite state-action MDPs are often expressed through entropic utility. For a bounded random variable $Z$ and risk parameter $\alpha\neq0$,

$$\mathrm{Ent}(Z,\alpha)=\frac1\alpha\ln\mathbb E[e^{\alpha Z}],$$

and the long-run average reward is

$$J_\alpha(x,\pi)=\liminf_{N\to\infty}\frac1N\,\mathrm{Ent}_x^\pi\Bigl(\sum_{t=0}^{N-1}c(X_t,a_t),\alpha\Bigr).$$

At $\mu\to0$0 this reduces to the classical expected average reward (Bäuerle et al., 2024). The same entropic structure is used in another finite-MDP treatment with risk parameter $\mu\to0$1, where the discounted approximation

$\mu\to0$2

serves as the basis for vanishing-discount analysis (Pitera et al., 19 Jan 2026).

Risk sensitivity is not restricted to exponential criteria. A second major line of work optimizes CVaR: $\mu\to0$3 with uncertainty entering through initial conditions, process noise, and uncertain parameters (Wang et al., 2020). A third line uses dynamic convex or coherent one-step risk maps $\mu\to0$4 and composes them recursively,

$\mu\to0$5

to obtain time-consistent multi-period risk evaluation (Coache et al., 2021, Chow et al., 2015). A fourth line imposes explicit chance constraints, such as

$\mu\to0$6

and then reformulates them through an auxiliary martingale state variable (Huynh et al., 2013).

A common simplification is to equate risk sensitivity with a static mean-variance penalty. The literature here is broader. It includes entropic criteria, CVaR optimization, recursive dynamic risk measures, and bounded failure probabilities, and several works treat time consistency as a separate structural requirement rather than an automatic consequence of aversion to variance (Coache et al., 2021, Chow et al., 2015, Huynh et al., 2013).

2. Dynamic programming, Bellman equations, and HJB structure

The dynamic-programming equations for risk-sensitive control differ from the additive Bellman recursion of the risk-neutral case. In discrete-time finite-state models with exponential criteria, one obtains multiplicative Bellman equations. For the wireless queueing model with buffer size $\mu\to0$7, there exist $\mu\to0$8 and positive $\mu\to0$9 satisfying

$\gamma\to0$0

and the minimizing action is optimal. Relative value iteration normalizes the iterates by $\gamma\to0$1 and provides a constructive route to the optimal policy (Singh et al., 2017).

For long-run average entropic control on finite MDPs, Bäuerle, Pitera, and Stettner analyze an averaged risk-sensitive Bellman equation

$\gamma\to0$2

with $\gamma\to0$3 defined up to an additive constant and $\gamma\to0$4 equal to the optimal average reward. The associated Bellman operator is a contraction in the span-seminorm under the stated mixing assumptions, and stationary maximizers are optimal for the long-run criterion (Bäuerle et al., 2024).

In continuous time, dynamic programming produces nonlinear HJB equations. For the finite-horizon diffusion problem with exponential criterion, the value function $\gamma\to0$5 solves, in the viscosity sense,

$\gamma\to0$6

with terminal condition $\gamma\to0$7 (Dong et al., 5 Feb 2026). The quadratic term in $\gamma\to0$8 is the characteristic risk-sensitive modification.

Mean-field control lifts this structure to the space of probability measures. The infinite-dimensional HJB equation for the value functional $\gamma\to0$9 involves Lions derivatives $$J_T^\pi=\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\},$$0 and integrates drift, diffusion, and running cost against the current law $$J_T^\pi=\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\},$$1. In the linear-exponential-quadratic case, the infinite-dimensional problem reduces to coupled Riccati ODEs for $$J_T^\pi=\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\},$$2 and $$J_T^\pi=\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\},$$3 (Bensoussan et al., 2017).

Under a specific matching condition, path-integral methods linearize the risk-sensitive HJB. For a diffusion

$$J_T^\pi=\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\},$$4

quadratic control cost, and

$$J_T^\pi=\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\},$$5

the logarithmic transform $$J_T^\pi=\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\},$$6 with $$J_T^\pi=\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\},$$7 converts the nonlinear PDE into the linear backward equation

$$J_T^\pi=\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\},$$8

which admits a Feynman–Kac representation (Broek et al., 2012). This suggests that, for that class of models, risk sensitivity can be handled without abandoning sampling-based forward simulation.

3. Maximum principle, adjoint systems, and the DPP–MP connection

Pontryagin-type analysis provides an alternative to dynamic programming and is particularly important when the value function is nonsmooth, the control domain is nonconvex, or the problem is not Markovian. For the finite-horizon diffusion problem with cost

$$J_T^\pi=\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\},$$9

the problem is equivalent to a decoupled FBSDE in which the backward equation has quadratic generator

$$J^\pi=\limsup_{T\to\infty}\frac1{\gamma T}\log\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\}.$$0

First- and second-order adjoint BSDEs then produce a generalized Hamiltonian $$J^\pi=\limsup_{T\to\infty}\frac1{\gamma T}\log\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\}.$$1, and the optimal control satisfies a pointwise maximum condition involving both first- and second-order adjoints (Dong et al., 5 Feb 2026).

The same paper establishes the link between the maximum principle and dynamic programming in a viscosity framework. Along an optimal trajectory, the adjoint processes enter the super- and sub-jets of the value function: $$J^\pi=\limsup_{T\to\infty}\frac1{\gamma T}\log\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\}.$$2 This jet-based formulation extends the DPP–MP relation beyond the $$J^\pi=\limsup_{T\to\infty}\frac1{\gamma T}\log\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\}.$$3 setting (Dong et al., 5 Feb 2026). Under smoothness of the value function, the connection becomes pointwise: $$J^\pi=\limsup_{T\to\infty}\frac1{\gamma T}\log\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\}.$$4 and the HJB minimizer coincides with the Hamiltonian minimizer (Dong et al., 9 Jul 2025).

Mean-field systems introduce derivatives with respect to the law. In risk-sensitive mean-field-type control, the adjoint process satisfies a backward SDE containing both $$J^\pi=\limsup_{T\to\infty}\frac1{\gamma T}\log\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\}.$$5 and the Lions derivative $$J^\pi=\limsup_{T\to\infty}\frac1{\gamma T}\log\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\}.$$6, while the dynamic-programming side uses an infinite-dimensional HJB master equation. Bensoussan, Djehiche, Tembine, and Yam show the relation

$$J^\pi=\limsup_{T\to\infty}\frac1{\gamma T}\log\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\}.$$7

connecting the adjoint to the gradient of the value functional along the optimal measure flow (Bensoussan et al., 2017).

When mean-field dependence induces time inconsistency and Bellman optimality is unavailable, the stochastic maximum principle remains applicable. Djehiche, Tembine, and Tempone derive a risk-sensitive SMP for mean-field-type dynamics without requiring smoothness of a value function. The resulting Hamiltonian contains an exponential-tilt term $$J^\pi=\limsup_{T\to\infty}\frac1{\gamma T}\log\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\}.$$8, and the adjoint BSDEs are driven under a tilted measure (Djehiche et al., 2014). For partially observed coupled FBSDEs with Brownian and Poisson noise, the recursive risk-sensitive problem can be transformed into a complete-information problem with quadratic-exponential generator, leading to a global stochastic maximum principle and a modified Zakai equation in the associated filtering problem (Lin et al., 7 Apr 2025).

4. Structural policies, monotonicity, and long-run stability

Risk-sensitive criteria often preserve or induce strong structural properties. In the single-client wireless queueing model, the optimal scheduling policy is of threshold type: $$J^\pi=\limsup_{T\to\infty}\frac1{\gamma T}\log\mathbb E^\pi\exp\Bigl\{\gamma\sum_{t=1}^T c(t)\Bigr\}.$$9 The proof proceeds through the monotonicity of the decision differential

$$J(t,x;u)=\frac1\mu\ln \mathbb E\Bigl[\exp\Bigl\{\mu\!\int_t^T f\bigl(s,X^{t,x;u}(s),u(s)\bigr)\,ds+\mu\,h\bigl(X^{t,x;u}(T)\bigr)\Bigr\}\Bigr],$$0

which is shown by induction to be nondecreasing in the queue length. The optimal threshold increases when the transmission cost $$J(t,x;u)=\frac1\mu\ln \mathbb E\Bigl[\exp\Bigl\{\mu\!\int_t^T f\bigl(s,X^{t,x;u}(s),u(s)\bigr)\,ds+\mu\,h\bigl(X^{t,x;u}(T)\bigr)\Bigr\}\Bigr],$$1 increases, and a fixed threshold $$J(t,x;u)=\frac1\mu\ln \mathbb E\Bigl[\exp\Bigl\{\mu\!\int_t^T f\bigl(s,X^{t,x;u}(s),u(s)\bigr)\,ds+\mu\,h\bigl(X^{t,x;u}(T)\bigr)\Bigr\}\Bigr],$$2 remains optimal throughout an interval $$J(t,x;u)=\frac1\mu\ln \mathbb E\Bigl[\exp\Bigl\{\mu\!\int_t^T f\bigl(s,X^{t,x;u}(s),u(s)\bigr)\,ds+\mu\,h\bigl(X^{t,x;u}(T)\bigr)\Bigr\}\Bigr],$$3 characterized by the inequalities $$J(t,x;u)=\frac1\mu\ln \mathbb E\Bigl[\exp\Bigl\{\mu\!\int_t^T f\bigl(s,X^{t,x;u}(s),u(s)\bigr)\,ds+\mu\,h\bigl(X^{t,x;u}(T)\bigr)\Bigr\}\Bigr],$$4 and $$J(t,x;u)=\frac1\mu\ln \mathbb E\Bigl[\exp\Bigl\{\mu\!\int_t^T f\bigl(s,X^{t,x;u}(s),u(s)\bigr)\,ds+\mu\,h\bigl(X^{t,x;u}(T)\bigr)\Bigr\}\Bigr],$$5 (Singh et al., 2017).

Long-run average risk-sensitive control on finite MDPs exhibits a different structural issue: robustness of optimal stationary policies with respect to the risk-aversion parameter. For each stationary policy $$J(t,x;u)=\frac1\mu\ln \mathbb E\Bigl[\exp\Bigl\{\mu\!\int_t^T f\bigl(s,X^{t,x;u}(s),u(s)\bigr)\,ds+\mu\,h\bigl(X^{t,x;u}(T)\bigr)\Bigr\}\Bigr],$$6, the region of optimality

$$J(t,x;u)=\frac1\mu\ln \mathbb E\Bigl[\exp\Bigl\{\mu\!\int_t^T f\bigl(s,X^{t,x;u}(s),u(s)\bigr)\,ds+\mu\,h\bigl(X^{t,x;u}(T)\bigr)\Bigr\}\Bigr],$$7

is closed and, in the formulation of Bäuerle, Pitera, and Stettner, a finite union of closed intervals. Moreover, $$J(t,x;u)=\frac1\mu\ln \mathbb E\Bigl[\exp\Bigl\{\mu\!\int_t^T f\bigl(s,X^{t,x;u}(s),u(s)\bigr)\,ds+\mu\,h\bigl(X^{t,x;u}(T)\bigr)\Bigr\}\Bigr],$$8 is continuous, bounded, non-decreasing in $$J(t,x;u)=\frac1\mu\ln \mathbb E\Bigl[\exp\Bigl\{\mu\!\int_t^T f\bigl(s,X^{t,x;u}(s),u(s)\bigr)\,ds+\mu\,h\bigl(X^{t,x;u}(T)\bigr)\Bigr\}\Bigr],$$9, and real-analytic on $Z$0. Thus, if a unique stationary optimizer exists at $Z$1, it remains optimal on a neighborhood of $Z$2 (Bäuerle et al., 2024).

The vanishing-discount limit yields a risk-sensitive Blackwell property. For each fixed coordinate $Z$3 of the discounted optimal policy $Z$4, there exists $Z$5 such that, for all $Z$6, the stationary rule $Z$7 is optimal for the average problem at the fixed risk parameter (Bäuerle et al., 2024, Pitera et al., 19 Jan 2026). This does not imply that discounted optimal policies themselves are stationary. On the contrary, the entropic discounted problem may require non-stationary optimal policies, and one of the cited examples shows that no discounted-optimal stationary policy exists for $Z$8 even though the Blackwell limit identifies a stationary average-optimal policy (Bäuerle et al., 2024).

A plausible implication is that policy stability in risk-sensitive control must be interpreted along at least two different axes: perturbation of the risk parameter and vanishing discount. The distinction from ultimate stationarity, where $Z$9 is fixed and the risk parameter tends to zero, is explicit in the finite-MDP analysis and is not merely terminological (Pitera et al., 19 Jan 2026).

5. Time consistency, risk constraints, and partial information

Time consistency is a defining concern in multi-stage risk-sensitive control. In the dynamic-risk-measure framework, time consistency is enforced by recursive composition of one-step conditional risk measures. Under a policy $\alpha\neq0$0, the value function becomes a conditional risk-to-go,

$\alpha\neq0$1

and policy optimization proceeds through a dynamic programming principle that respects the recursive risk semantics (Coache et al., 2021). Chow and Pavone use the same principle for constrained control with a second cost stream $\alpha\neq0$2 and a risk budget $\alpha\neq0$3, augmenting the state by the residual budget and solving

$\alpha\neq0$4

subject to the single-period update

$\alpha\neq0$5

The feasible state becomes $\alpha\neq0$6 rather than $\alpha\neq0$7 alone (Chow et al., 2015).

Chance constraints reveal why this augmentation is necessary. In continuous-time diffusion control with failure boundary $\alpha\neq0$8, the constraint

$\alpha\neq0$9

can be embedded into an auxiliary martingale $$\mathrm{Ent}(Z,\alpha)=\frac1\alpha\ln\mathbb E[e^{\alpha Z}],$$0 satisfying $$\mathrm{Ent}(Z,\alpha)=\frac1\alpha\ln\mathbb E[e^{\alpha Z}],$$1, $$\mathrm{Ent}(Z,\alpha)=\frac1\alpha\ln\mathbb E[e^{\alpha Z}],$$2, $$\mathrm{Ent}(Z,\alpha)=\frac1\alpha\ln\mathbb E[e^{\alpha Z}],$$3, and $$\mathrm{Ent}(Z,\alpha)=\frac1\alpha\ln\mathbb E[e^{\alpha Z}],$$4 almost surely. The enlarged state $$\mathrm{Ent}(Z,\alpha)=\frac1\alpha\ln\mathbb E[e^{\alpha Z}],$$5 converts the problem into a stochastic target problem. Because

$$\mathrm{Ent}(Z,\alpha)=\frac1\alpha\ln\mathbb E[e^{\alpha Z}],$$6

residual risk budgets observed at intermediate times remain exactly aligned with the original global chance constraint, thereby restoring time consistency (Huynh et al., 2013).

Partial observation introduces another layer. In adaptive CVaR-MPC, the unknown parameters are appended to the state, a particle filter propagates particles $$\mathrm{Ent}(Z,\alpha)=\frac1\alpha\ln\mathbb E[e^{\alpha Z}],$$7, and the CVaR objective is evaluated over the joint uncertainty in $$\mathrm{Ent}(Z,\alpha)=\frac1\alpha\ln\mathbb E[e^{\alpha Z}],$$8 and process noise (Wang et al., 2020). In the partially observed FBSDE with Poisson jumps, a Girsanov transformation and an exponential transformation reduce the original risk-sensitive problem to a full-information recursive control problem with a quadratic-exponential backward generator; in the associated filtering problem, the unnormalized filter satisfies a modified Zakai equation (Lin et al., 7 Apr 2025).

A common misconception is that time consistency is automatically inherited from any one-period risk metric. The cited literature indicates the opposite: time consistency generally requires either recursive composition of one-step risk maps or an explicit state augmentation that tracks residual risk tolerance (Chow et al., 2015, Huynh et al., 2013).

6. Numerical methods and application domains

Computational methods for risk-sensitive control range from exact transforms in special models to approximate dynamic programming, stochastic search, and inference-based policy optimization. Path-integral control solves the transformed linear PDE by forward simulation of uncontrolled dynamics with Feynman–Kac weights, and the optimal feedback becomes

$$\mathrm{Ent}(Z,\alpha)=\frac1\alpha\ln\mathbb E[e^{\alpha Z}],$$9

In multimodal problems, the resulting control law superposes modes through probability-weighted contributions, and the cited analysis shows how risk sensitivity changes the weighting without changing the symmetry-breaking time in the symmetric two-slit example (Broek et al., 2012).

For nonlinear stochastic systems with Gaussian noise, the ILEG method iteratively linearizes the dynamics, quadratizes the cost, and solves a linear exponential-quadratic subproblem. The backward pass is governed by a risk-sensitive Riccati equation containing the term

$$J_\alpha(x,\pi)=\liminf_{N\to\infty}\frac1N\,\mathrm{Ent}_x^\pi\Bigl(\sum_{t=0}^{N-1}c(X_t,a_t),\alpha\Bigr).$$0

Positive risk sensitivity leads to larger feedback gains, whereas negative values produce lower gains and a more feedforward strategy (Farshidian et al., 2015). In discrete-time convex control, RS-MPC modifies prescient planning by optimizing over disturbance realizations. For $$J_\alpha(x,\pi)=\liminf_{N\to\infty}\frac1N\,\mathrm{Ent}_x^\pi\Bigl(\sum_{t=0}^{N-1}c(X_t,a_t),\alpha\Bigr).$$1 the resulting planning problem is convex; for $$J_\alpha(x,\pi)=\liminf_{N\to\infty}\frac1N\,\mathrm{Ent}_x^\pi\Bigl(\sum_{t=0}^{N-1}c(X_t,a_t),\alpha\Bigr).$$2 it becomes a difference-of-convex program handled approximately by the convex-concave procedure, and the same calculation yields a lower bound on the optimal cost (Moehle, 2021).

Sampling-based methods now cover both model-predictive and policy-gradient settings. The RS3 framework for CVaR-MPC parameterizes control trajectories by an exponential-family sampling distribution and performs stochastic-gradient ascent on a shaped objective involving empirical CVaR. Under the stated stochastic-approximation conditions, the parameter sequence converges almost surely to a stationary point, and the empirical CVaR estimator obeys an exponential concentration bound. The implementation details reported include typical values $$J_\alpha(x,\pi)=\liminf_{N\to\infty}\frac1N\,\mathrm{Ent}_x^\pi\Bigl(\sum_{t=0}^{N-1}c(X_t,a_t),\alpha\Bigr).$$3, $$J_\alpha(x,\pi)=\liminf_{N\to\infty}\frac1N\,\mathrm{Ent}_x^\pi\Bigl(\sum_{t=0}^{N-1}c(X_t,a_t),\alpha\Bigr).$$4, horizon $$J_\alpha(x,\pi)=\liminf_{N\to\infty}\frac1N\,\mathrm{Ent}_x^\pi\Bigl(\sum_{t=0}^{N-1}c(X_t,a_t),\alpha\Bigr).$$5, confidence level $$J_\alpha(x,\pi)=\liminf_{N\to\infty}\frac1N\,\mathrm{Ent}_x^\pi\Bigl(\sum_{t=0}^{N-1}c(X_t,a_t),\alpha\Bigr).$$6, Gaussian policies with fixed covariance, Polyak averaging, and GPU-parallel Monte Carlo rollouts (Wang et al., 2020). In a different direction, Rao-Blackwellized Markovian score climbing formulates entropic control as maximum likelihood in a state-space model, uses conditional SMC as an MCMC kernel over trajectories, and obtains unbiased policy-gradient estimates with variance decaying as $$J_\alpha(x,\pi)=\liminf_{N\to\infty}\frac1N\,\mathrm{Ent}_x^\pi\Bigl(\sum_{t=0}^{N-1}c(X_t,a_t),\alpha\Bigr).$$7 (Abdulsamad et al., 2023).

Applications are correspondingly varied. Queueing control yields threshold transmission policies in wireless scheduling (Singh et al., 2017). CVaR-MPC and dynamic-risk RL are demonstrated on pendulum, cartpole, quadcopter, statistical arbitrage, option hedging with friction, and cliff-walking robot control (Wang et al., 2020, Coache et al., 2021). Risk-sensitive impedance optimization for uncertain contact interactions in legged locomotion uses an EKF-augmented risk-sensitive DDP and reports, among other outcomes, a 25% lower peak impact force in the single-leg swing example and improved trotting success rates from 47% to 65% and from 72% to 91.6% under different terrain uncertainties (Hammoud et al., 2020). Financial applications include HARA-utility portfolio choice under correlated noises, reformulated as an exponential-of-integral control problem and solved by a Riccati equation in the regime $$J_\alpha(x,\pi)=\liminf_{N\to\infty}\frac1N\,\mathrm{Ent}_x^\pi\Bigl(\sum_{t=0}^{N-1}c(X_t,a_t),\alpha\Bigr).$$8 (Yang et al., 2019), as well as linear-quadratic portfolio optimization in the SMP–DPP comparison framework (Dong et al., 9 Jul 2025).

Taken together, these methods show that risk-sensitive stochastic optimal control is not a single algorithmic doctrine but a family of mathematically distinct control paradigms. What unifies them is the replacement of linear expectation by nonlinear risk evaluation, the resulting modification of Bellman or Pontryagin structures, and the systematic appearance of additional state variables, adjoint terms, or transformed dynamics needed to preserve optimality, tractability, or time consistency.