Risk aware minimum principle for optimal control of stochastic differential equations
Jukka Isoh\"at\"al\"a, William B. Haskell

TL;DR
This paper develops a risk aware optimal control framework for stochastic differential equations, extending the classical stochastic Pontryagin's minimum principle by incorporating a risk adjustment process based on a nonlinear risk function.
Contribution
It introduces a risk aware minimum principle that generalizes the risk neutral case with a new risk adjustment process, applicable to control problems with risk preferences.
Findings
The risk aware minimum principle involves an additional stochastic process as a risk adjustment.
Necessary and sufficient conditions for optimality are established for controls on probability measures.
Application to portfolio allocation demonstrates how risk awareness introduces a risk premium term.
Abstract
We present a probabilistic formulation of risk aware optimal control problems for stochastic differential equations. Risk awareness is in our framework captured by objective functions in which the risk neutral expectation is replaced by a risk function, a nonlinear functional of random variables that account for the controller's risk preferences. We state and prove a risk aware minimum principle that is a parsimonious generalization of the well-known risk neutral, stochastic Pontryagin's minimum principle. As our main results we give necessary and also sufficient conditions for optimality of control processes taking values on probability measures defined on a given action space. We show that remarkably, going from the risk neutral to the risk aware case, the minimum principle is simply modified by the introduction of one additional real-valued stochastic process that acts as a risk…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Risk aware minimum principle for optimal control of stochastic differential
equations
Jukka Isohätälä and William B. Haskell
Abstract
We present a probabilistic formulation of risk aware optimal control problems for stochastic differential equations. Risk awareness is in our framework captured by objective functions in which the risk neutral expectation is replaced by a risk function, a nonlinear functional of random variables that account for the controller’s risk preferences. We state and prove a risk aware minimum principle that is a parsimonious generalization of the well-known risk neutral, stochastic Pontryagin’s minimum principle. As our main results we give necessary and also sufficient conditions for optimality of control processes taking values on probability measures defined on a given action space. We show that remarkably, going from the risk neutral to the risk aware case, the minimum principle is simply modified by the introduction of one additional real-valued stochastic process that acts as a risk adjustment factor for given cost rate and terminal cost functions. This adjustment process is explicitly given as the expectation, conditional on the filtration at the given time, of an appropriately defined functional derivative of the risk function evaluated at the random total cost. For our results we rely on the Fréchet differentiability of the risk function, and for completeness, we prove under mild assumptions the existence of Fréchet derivatives of some common risk functions. We give a simple application of the results for a portfolio allocation problem and show that the risk awareness of the objective function gives rise to a risk premium term that is characterized by the risk adjustment process described above. This suggests uses of our results in e.g. pricing of risk modeled by generic risk functions in financial applications.
1 Introduction
We consider the problem of optimal control of stochastic differential equations of the form
[TABLE]
over a finite time horizon, , , and where is a random initial value, and are the state and control processes, respectively, taking values on spaces and , . The process is a standard -dimensional Brownian motion, , and and are deterministic functions , .
Our focus here is on the problem of risk aware control of the diffusion process. The conventional optimal control theory of stochastic processes considers risk neutral problems, understood here as the minimization of expected costs accrued over the solution time interval,
[TABLE]
where is a cost rate function, and is a terminal cost function. In the risk aware control problems we consider here, the expectation in the objective is supplanted by a risk function that describes controller’s preferences that are not sufficiently modeled by the expected value. Formally, the risk aware problem is stated as
[TABLE]
where we suppose that the risk function is some generic mapping from random variables, representing total costs, to real values quantifying the magnitude of the risk associated with a given random variable. Convex or coherent risk measures form an important subset of the functions that our results attempt to cover [5, 31, 32].
In the discrete time case, dynamic programming formulations of the risk aware problem have proved elusive. This is intuitively unsurprising, as the construction of the Bellman equation hinges on the linearity of the expectation. Naturally this issue persists also in the continuous time context. The continuous time setting, however, affords an alternative to dynamic programming in the form of probabilistic formulations of the control problem111To be clear, there appears to be a non-zero, though very small number of works relating to probabilistic methods for discrete time stochastic optimal control; the only example that the present authors are aware of is [15].. Whereas in the dynamic programming world the control problem is stated in terms of partial differential equations [51, 52, 30], probabilistic formulations characterize the optimal controls in terms of solutions to stochastic differential equations [73]. In this work, we specifically focus on the stochastic Pontryagin’s minimum principle and its generalization to the risk aware case222Throughout we use the term minimum principle, since we phrase our control problem as the minimization of costs. The term maximum principle, commonly used in the literature, should be seen as an essentially synonymous term that is more appropriate when the problem is stated as a maximization of rewards..
The risk neutral stochastic minimum principle, simply stated, asserts that an optimal control minimizes, almost surely and at almost every point in time, an appropriately defined Hamiltonian function that in turn depends on adjoint processes satisfying a backward stochastic differential equation. These necessary conditions for optimality derive from variational equations describing the response of the cost functional at the optimal control to an infinitesimal change in control. This local nature of the minimum principle also provides a heuristic, a priori justification for preferring it over dynamic programming in risk aware problems: Bellman’s principle of optimality underlying the dynamic programming method is a statement about the structure of the objective of the control problem that relies on the linearity and the tower property of the expectation. The minimum principle on the other hand relates the optimal controls to the local behavior of state space trajectories and the cost functions. As such, the minimum principle does not impose requirements, here linearity, on the structure of the risk function in the same way as dynamic programming does. Instead, central to deriving a risk aware minimum principle is being able to evaluate the response of a risk function to changes in its input random variables.
Literature review
The stochastic minimum principle has a long history. Its early derivations can be found in the works [47, 13, 14, 11], with the modern version often being attributed to [59]. These results have spawned numerous refinements. Here we mention extensions to probability measure valued controls given in [56, 9, 8], as this type of a control framework used in this paper. Generalizations of the minimum principle to optimal control of continuous time partially observed processes, a topic closely related to risk aware optimization, have also been constructed [70, 6, 3]. The minimum principle has proven to be a viable alternative to dynamic programming e.g. when the controls might not be Markov, in the sense that they cannot be expressed as functions of the state variables at any given point in time. This is the case for McKean-Vlasov problems, for which probabilistic methods appear particularly well adapted [18, 19, 20]. The minimum principle is extensively covered in [73], with numerous additional references. Dynamic programming and the minimum principle are considered in parallel in [75], and a comprehensive review of the two methods can be found in [73, Chapter 5]. For applications of the minimum principle, and backward stochastic differential equations, we refer the reader to [27, 64].
Much of the recent work on the topic of control under uncertainty, broadly understood as random variability not accounted for by an expectation under full observations, has been done using dynamic risk measures [1] or nonlinear expectations such as Peng’s -expectation [60, 61] and its generalization, the -framework [62, 63]. Compared to static risk functions, these approaches impose additional structure, most notably time-consistency that allows for the use of e.g. the dynamic programming principle. While it is well-known that -expectations give rise to convex risk functions, the converse is generally true only for risk functions that are time-consistent [66]. In our approach, we consider objectives that are given in terms of static, law invariant risk measures, and in particular we do not impose time-consistency on the risk function. Moreover, since the risk function is not expressed as a -expectation, we do not need to consider forward-backward stochastic differential equation as the starting point, as was done in e.g. [57] where a minimum principle was derived for stochastic differential equations driven by Lévy processes. Optimality conditions using a similar variational approach were given for forward-backward differential equations in [72]. Dynamic risk measures were used in [10], where specifically the problem of optimal derivatives design was considered. A dynamic programming formulation for the -framework has been developed in [40, 39].
Finally, we note that in addition to the probabilistic and dynamic programming approaches, convex analytic and linear programming techniques form a third, loose set of methods for both risk neutral and risk aware control. For the risk neutral case, we refer the reader to [69, 68] for early development and [12, 45, 46] for refinements. A risk aware version has been developed in [42], where a state space augmentation scheme, inherited from earlier discrete time results [37], was used to construct a formulation of the risk aware problem. While this approach leads to a tractable computational method for solving the control problem, it does not provide a useful characterization of the optimal control in the way that the minimum principle does.
Contributions and organization of the paper
The contributions of this paper can be summed up as follows: (i) We generalize the control problem informally stated in Eqs. (1.1, 1.2) to feature measure valued control processes. Albeit the control model and the notion of a solution we utilize has been considered by some authors under the name of relaxed controls, we opt for a new term of vague controls. We justify the nomenclature by demonstrating key differences between relaxed and vague controls, and further show why the latter notion of a solution can be particularly useful. (ii) We introduce law invariant risk functions into a framework that allows a natural notion of functional differentiability that can subsequently be applied in deriving variational conditions for optimality of controls. (iii) Using these results, we formulate and prove a risk aware generalization of the stochastic Pontryagin’s minimum principle, and in doing so, we give a characterization of the optimal control of a risk aware problem. We find that in comparison to the risk neutral problem, the minimum principle is modified by a risk adjustment process that is related to the functional derivative of the risk function, evaluated at the terminal cost. Finally, (iv), we demonstrate by means of solving a simple example that in financial applications, risk awareness creates non-trivial but intuitive risk pricing effects.
In the next section, we will describe the notations used in the paper, and state the control problem we consider. Section 3 describes the risk functions that model the risk aware objectives. We outline some necessary differentiability properties of the functions that will subsequently be needed for the probabilistic formulation of the problem that is given in the following Section 4. This section derives necessary and sufficient conditions for the optimality of a control process. We present an application of the theory in Section 5 where we characterize the optimal controls of a simple portfolio allocation problem. Section 6 concludes with discussion and some remarks. Technical proofs are deferred to Appendix A.
2 Model
Throughout the paper we will use the following notations and definitions: For any probability space , a Banach space and , we denote , or for short, as the set of random variables such that , where stands for the expectation with respect to the measure . If is clear from the context, we simply use the symbol . In addition, denotes the space of -essentially bounded random variables. We shall use to denote the norm on , . For a real Banach space , we use to denote its continuous dual, and for the duality pairing.
Borel probability measures on a topological space are denoted by , and the Borel -algebra on is denoted by . The Dirac measure centered at is denoted by . By , , we mean probability measures such that for all ; denotes probability measures with bounded support. The law or distribution of a random variable , , is denoted by , that is, for all ; if the probability measure is clear from the context, we use the symbol instead. The extended reals will be denoted and elements of , , are by default interpreted as column vectors, i.e. .
For a given filtered probability space , a normed space and a , we shall use or for short to denote -valued -predictable continuous processes on such that
[TABLE]
In addition, denotes the space of -predictable processes on such that
[TABLE]
Two processes are considered equivalent if . Finally, we set and .
Continuous functions from a topological space to a normed space are denoted , and we equip this space with the usual supremum norm. If , we abbreviate this by . The subspaces of bounded and compactly supported functions are denoted and , respectively. Superscripted function spaces , , etc., , denote spaces of times continuously differentiable functions with derivatives respectively in , , etc. For every differentiable function , , the Jacobian of is denoted , so that and for all , ; in particular, the gradient of a real-valued function is a row vector. For multivariate functions, we use to indicate that the derivative is taken with respect to the argument taking values in the space . For convenience, for all and , , we denote , where stands for the transpose.
We generalize Eq. (1.1) to feature measure valued controls. Instead of an adapted stochastic process taking values on an action space , the controls shall here in general be probability measure valued processes , . We introduce the notion of vague controls (throughout and shall be our given state and action spaces, however, we will also consider solutions on extended state spaces, and hence the definitions below should be understood to hold for any analogously defined finite dimensional state and action spaces).
Definition 2.1**.**
(Vague controlled solution) Let , , and , and let , be given drift and diffusion functions that are continuous on and measurable on . A* vague controlled solution to the problem * comprises a filtered probability space and a process , , , for all , such that: (i) the filtration is complete and right-continuous, (ii) is -adapted with continuous sample paths, is an -Brownian motion, and is -progressively measurable, (iii) the distribution of is , and (iv) the processes satisfy, -almost surely,
[TABLE]
Moreover, we call the solution -admissible, , if we additionally have that (v)
[TABLE]
We shall use to denote vague controlled solutions of the problem .
Definition 2.2**.**
A strict controlled solution is a vague controlled solution such that is a Dirac measure for all .
For brevity, we write to refer to a vague controlled solution, but it is important to bear in mind that the solutions are in fact -tuples. If necessary, we label the state process by the control, i.e. write . Clearly, strict controlled solutions can be identified with controlled solutions where the control process takes values on rather than .
Vague controlled solutions are in the current literature frequently referred to as relaxed controlled solutions, however, these two concepts differ in some key aspects. In fact, up to the knowledge of the authors, vague controlled solutions have never been called anything else but relaxed controls, and the differences between the definitions are not always explicitly noted. Examples of works where vague controls are used include [53, 8, 4, 3]. We note, as [4], that vague controlled stochastic differential equations can be related to controlled stochastic processes driven by non-orthogonal martingale measures, whereas the more canonical relaxed controlled model can be identified with equations driven by orthogonal martingale measures [24]. See e.g. [71] for more discussion on martingale measures. It also bears pointing out that the topology conventionally assigned to relaxed controls, see e.g. [29], may be too coarse for vague controlled problems to guarantee the continuity of the mapping from controls to the stochastic trajectories, which has implications for e.g. applying the chattering lemma [26, Theorem 2.2] to vague controls. Indeed, as Example 2.3 below demonstrates, it may not always be possible to find strict controls and associated solutions of Eq. (2.1) that approximate a given vague controlled solution.
To elucidate the difference between these notions of solutions, consider , where are for simplicity taken to be bounded. Applying Itô’s lemma to , , we have that the process , defined
[TABLE]
is a martingale for any . A relaxed controlled solution corresponding to the drift and diffusion functions is conventionally defined as a filtered probability space together with a stochastic process , , for all , satisfying items (i-iii) of Definition 2.1, but characterized by the condition that the processes ,
[TABLE]
are martingales for all . Comparing Eqs. (2.6) and (2.5) we see that the order of integration against the control and squaring the diffusion coefficient are interchanged. Thus, informally, a vague controlled solution corresponds to processes where for any , the amplitude of the noise is the -average of , whereas in the relaxed controlled case, the noise is the -root mean square of the diffusion function.
It is well-known that a strict optimal control may fail to exist while one can always be found within the set of relaxed controls. This is due to the convexity of the space of probability measures, a property that has in the past often been exploited in optimal control of stochastic differential equations [25, 17, 38]. An additional motivation for considering generalizations of strict controls comes from the fact that little is known about the nature of the optimal control in the risk aware case. In discrete time, risk aware formulations featuring generic risk functions in the objective have been successfully described333These works used a somewhat inelegant state space augmentation scheme that can here be avoided; see also Remark 4.3. using the convex analytic formulation [37], later expanded to the continuous-time case as well [42]. Such problems often, though certainly not exclusively, feature relaxed controls as the optimal solution [36, 74, 23] and it is therefore not unreasonable to expect that a generalization of strict controls may be appropriate here as well.
We note that relaxed controlled solutions are more widely represented in the literature than vague controlled solutions. This is in part due to the fact that relaxed controlled solutions can be viewed as the closure of strict controls, under a suitably defined topology [25]. This is not the case for vague controls. The following example demonstrates that there are vague controlled solutions whose finite dimensional distributions cannot be approximated by those of strict or relaxed controls. A similar example has been featured earlier in [7].
Example 2.3**.**
Consider , and , for all , and . Then for all strict controls (in fact, for all relaxed controls as well), is an -Brownian motion, but there exists a vague controlled solution such that and for all . Consequently, considering e.g. a control problem of , it is clear that a vague controlled solution may attain a strictly lower optimum value that can be found using strict controls.
Our main reason for considering vague controls is that the optimality conditions obtained from a stochastic minimum principle are considerably simpler and thus easier to use in practice. In the classical risk neutral case, and when the control set is non-convex and the diffusion coefficient depends on the control, first and second order adjoint equations are needed to characterize the optimal control, see e.g. the classic work by Peng [59] and more recent results for relaxed controls in [9, 49]. The issues resulting from the need for second order expansions are exacerbated in the risk aware setting, where the second order expansions will also require us to compute second order functional derivatives of the risk function . For vague controls, first order expansions turn out to be sufficient, which is also the case in risk neutral problems considered in [8, 3]. We note that the sufficiency of first order expansions is not entirely surprising, since this is also the case for strict controls when the control set is convex, see e.g. [13]. We demonstrate this below in Example 2.4. Indeed, vague controls could be viewed as measure valued strict controls, in which case the control set is naturally convex. Finally, as strict controls are a subset of vague controls, optimality of a strict control is readily shown by demonstrating that a vague control process necessarily takes values on Dirac measures.
Example 2.4**.**
Consider the problem of [73, Example 4.1]. We set , and , for all , , and consider minimizing over strict controls. Clearly, is optimal. In the context of strict controls, one considers spike perturbations (cf. Eq. (4.3) of [73]) to an optimal control to establish conditions for optimality. In [73, Example 4.1], it is shown that if is a state space process corresponding to such a perturbation, and is optimal (here, zero), then . However, if we consider a vague control formed by a convex combination of the optimal control and an arbitrary progressively measurable so that for all , we find that
[TABLE]
Therefore, perturbations to vague controls result in an response in the state space paths (in the above sense), whereas for strict controls, we only have . This suggests that computing the first order response may indeed be sufficient for establishing necessary conditions for optimality of vague controlled solutions.
The natural downside to considering vague controls is, as Example 2.3 demonstrates, that the optimal vague control may be something that cannot be approximated by strict controls. This may be an issue in practice, if a vague control cannot realistically be implemented. This is in contrast to the case of usual relaxed controls, for which it is typically possible to construct an -optimal strict control from an optimal relaxed control.
We assume standard continuity and boundedness conditions that guarantee the existence of solutions to Eq. (2.1), given a probability space, a Brownian motion, and a control process. We also state conditions for the cost rate function, and hence, we first need to introduce the total cost random variable. For every we define the total cost as
[TABLE]
where is the cost rate function and is the terminal cost. In the risk neutral case, it generally suffices to ensure that , however here, we shall need to compute the risk of which generally involves evaluating an functional at , where . In order to accommodate a wider range of possible values of , somewhat more elaborate conditions (compared to the risk neutral case) on the bounds of and their growth rates shall be needed. In addition, as the optimality conditions given in Section 4 will be derived from variational inequalities, we require that the relevant functions are all also differentiable. Formally, our baseline assumptions are as follows.
Assumption 2.5**.**
The initial distribution , drift and diffusion functions , , cost rate and terminal cost functions , , and admissible control processes are such that there are constants , , , , , , , , satisfying: (i) if , then is compact; (ii) for all ,
[TABLE]
(iii) for all , the functions and are continuously differentiable, and the derivatives are bounded by ; (iv) for all ,
[TABLE]
(v) for all , the functions and are continuously differentiable, and satisfy, for all ,
[TABLE]
(vi) the initial distribution ; (vii) all control processes are -admissible, i.e. satisfy Eq. (2.4) for .
Definition 2.6**.**
Let . We say that a vague controlled solution is -feasible and denote , if there exists , , , , , satisfying Assumption 2.5 and the following inequalities:
[TABLE]
To give an intuition on the meanings and uses of these constants (Proposition 2.7 below gives a more formal statement), and shall respectively represent the order up to which the costs and the state space variables , , are integrable. We allow for unbounded cost rates and terminal costs, in fact even superlinear growth is admissible ( in Eq. (2.9)), but in order to guarantee that costs are in , bounds on the integrability of the state and action variables need to be imposed. Eqs. (2.11) amount to sufficient conditions for such integrability to hold.
We expect a typical use-case of our results is such where one is given drift and diffusion functions and , a cost structure in the form of the cost rate and terminal cost functions and , and a risk function as a map with a fixed , mapping from costs to risks. The growth rates of these functions dictate the values of , , , , , and . The feasibility conditions of Eqs. (2.11) can then be understood as determining admissible and , representing the level of randomness in the initial condition and the range of control values that yield -finite costs.
Given a filtered probability space with a Brownian motion and a progressively measurable -valued control process, stochastic differential equations satisfying the Assumptions 2.5 and inequalities of Eqs. (2.11) for a given have strong solutions. Together, these comprise a -feasible vague controlled solution, and moreover, if , then the costs .
Proposition 2.7**.**
Let and suppose Assumptions 2.5 and Eq. (2.11) hold. Let be a filtered probability space, a complete and right continuous filtration, and a -dimensional -Brownian motion. (i) If is an -progressively measurable -valued stochastic process that satisfies Eq. (2.4) for , then there exists a pathwise unique solution to the stochastic differential equation (2.1) such that
[TABLE]
so that is in or in other words is a -feasible vague controlled solution. (ii) If additionally and are -Lipschitz for all , then the mapping is continuous.
In order to state the risk aware control problem, we need to first establish some basic properties of risk functions. We collate our discussions on their properties in the next section, where we first describe the subset of risk functions that can be used to evaluate the risk associated with when .
3 Risk functions
Risk aware objective function
Given the definition of feasible vague controlled solutions, , , and the cost functional , the risk neutral control problem could now be simply stated as
[TABLE]
where we have written the expectation as to highlight the fact that the probability space, and in particular the probability measure used to compute the expectation, is a part of the vague controlled solution . This problem statement does not trivially generalize to the risk aware case: Here, we presume we are given a risk function , , defined on some unspecified probability space , mapping an random variable to a real-valued measure of risk that quantifies the variability associated with this random variable. Since in general the probability space for a given is fixed, we cannot use to evaluate the risk of when the probability space potentially varies with each ).
To remedy this issue, note first that the risk neutral problem, Problem , makes sense since the expectation does not depend on the particulars of the underlying probability space, but rather only on the distributions of the random variables. This is to say, for any two -random variables and , defined on different probability spaces and , we have that whenever the laws of and agree. In order to generalize Problem to the risk aware case, we restrict ourselves to risk functions having this same, law invariance property:
Definition 3.1**.**
Let be a probability space. A mapping , , is *law invariant *if there is a such that for all .
Law invariant risk functions have been extensively studied in the literature, in particular they admit well-known and widely exploited representation theorems [48, 33, 43]. Here however, the law invariance property allows us to state the risk aware version of Problem . For any law invariant , , we define Problem as
[TABLE]
We adopt the view that a law invariant risk function can be equivalently seen as a mapping from -random variables to reals, or as a function from -measures to reals. This latter representation of risk functions has been used also in previous works, see e.g. [37, 41, 42]. We emphasize that here, we consider the expression of risk for random variables and measures on equal footing: While viewing exclusively as a function from measures to reals is appealing in its simplicity, in doing so we would firstly lose some convexity and coherence properties that are better defined for -functionals (see e.g. Definition 3.3 below). Indeed, it is quite often true that if a risk function is convex, then its representation as a function , for all is concave [2] – this has obvious implications for minimization of such functionals. Secondly, we will in the following need some notion of differentiability of risk functions. Functional differentiation is more readily defined on the Banach spaces , and moreover, an appropriate theory has recently been developed in the context of mean field games and McKean-Vlasov problems [19, 20]. In their context, differentiability with respect to distributions was needed for treating the mean field, i.e. distribution dependent terms in the model equations.
In the following, we will go back and forth between representations of a risk function as a mapping over random variables or measures. What we mean by this is formalized in the following definition:
Definition 3.2**.**
Let be a probability space, , and let be a metric space. (i) Suppose is a law invariant mapping. A function is a -representation of if for all . (ii) Suppose . If there is a probability space and a function such that for all , then we say is an -representation of .
In order to impose more structure on the set of risk functions we consider, some of the following properties, frequently considered in the literature [5, 31], are assumed. These properties are more naturally defined for the -representation of the risk function.
Definition 3.3**.**
Let be a probability space and denote , . (i) Monotonicity: for all such that almost surely, . (ii) Convexity: for all and . (iii) Positive homogeneity: for all and . (iv) Translation invariance: for all and . (v) If the risk function satisfies (i–iv), it is called coherent.
Differentiability of risk functions
We begin by recalling the following, standard definitions of functional derivatives.
Definition 3.4**.**
Let and be real Banach spaces. (i) For any , the subdifferential of at , denoted \text{\partial}f(X), is the set . The function is subdifferentiable at if . (ii) For any , the directional derivative of at in direction , denoted , is defined as
[TABLE]
if the limit exists. Further, we will say that the function is Gâteaux differentiable at if the above limit exists for all and if the mapping is linear. (iii) The function is Fréchet differentiable at if there is a continuous linear operator , the Fréchet derivative, such that
[TABLE]
where denotes the norm on .
Remark 3.5*.*
A coherent risk function that is nonlinear cannot be everywhere Gâteaux or Fréchet differentiable. Specifically, cannot be Fréchet differentiable at , if positive homogeneity, Definition 3.3(iii), holds. Then , which is not linear; this was earlier pointed out in [28, Proposition 3.1]. Relaxing the assumption that the Gâteaux derivative must be linear would remove the issue, but everywhere Fréchet differentiability of is nonetheless not possible. In Section 5 we demonstrate, by way of an example, that a risk function can be shown to be differentiable at the cost random variable . We also show that e.g. the entropic risk measure, frequently encountered in the literature, is everywhere Fréchet differentiable, and that additionally, it may be possible to approximate a risk function with another, everywhere Fréchet differentiable functional.
We can now define a useful notion of a derivative of a law invariant risk function. Here, we use the definition used in e.g. [18, 19, 20], which we extend slightly to cover spaces, , not just . The definition relies on the Fréchet differentiability of the -representation of the function.
Definition 3.6**.**
Let , , , and suppose there is a probability space and an )-representation of , denoted . (i) We say the function is -differentiable at if its )-representation is Fréchet differentiable at any point such that .
(ii) The function is continuously -differentiable, if the Fréchet derivative of as seen as a function , , is continuous.
(iii) Given , we say the function is an *-derivative *of at , if the Fréchet derivative of , is such that for -almost all , implying that for all such that . We will denote a representative -derivative by .
We have the following result concerning the existence of -derivatives. It demonstrates that -derivatives commonly exist, and are not limited to exceptional cases of risk functions.
Proposition 3.7**.**
Suppose , , , is continuously -differentiable. Then an -derivative exists, and is unique in the sense that if and are -derivatives at , then for -almost every .
Our main use of the -derivative is in evaluating the first-order response of functions of probability measures. If , then for any random variables , , whose laws equal and , respectively, we get the following expansion directly from the definitions of the Fréchet- and -derivatives:
[TABLE]
where .
Remark 3.8*.*
The need for the notion of -differentiability ultimately arises from the use of vague controls and weak solutions of the stochastic differential equations, that is, vague controlled solutions in the sense of Definition 2.1. If it were possible to always consider a fixed probability space, there would not be a need for the notion of -differentiability, and we could instead solely use the Fréchet derivative on a fixed space to construct the first order responses of the form given in Eq. (3.2).
Differentiability can subsequently be used to construct a notion of convexity of a real-valued function of probability measures , where is a Banach space and , without needing to impose vector space structure on .
Definition 3.9**.**
An -differentiable function , , , with the -derivative is -convex if
[TABLE]
and where are any random variables over some probability space such that and .
It is straight-forward to verify that for a law invariant, -differentiable risk function with an -derivative , convexity in the sense of Definition 3.3(ii) implies -convexity, i.e. the notion of convexity in Definition 3.9.
For brevity of notations, in the following we will for all law-invariant functions , , denote its -representation by the same symbol – which function we mean will always be clear from its arguments. With the above definitions, we can now state the necessary assumptions regarding the risk functions we consider.
Assumption 3.10**.**
The risk function is such that: (i) , , and is law invariant. (ii) The risk function has an -derivative on some open subset . (iii) The law of the cost functional is in , i.e. for all .
These assumptions simply assert that is differentiable over a sufficiently large set of random variables. Note that -convexity is not yet assumed; it will be needed when we state conditions that are sufficient for optimality of controls.
The probabilistic formulation of the risk aware problem relies on Assumption 3.10, and in particular on the existence of Fréchet derivatives of the risk function. In general, the question of the Fréchet differentiability of a function defined over an infinite dimensional Banach space is a rather complicated one, and presently, there does not appear to be a well-developed theory of Fréchet differentiability of risk functions. When the underlying Banach spaces are Asplund spaces, say in particular if we consider the Hilbert space , Fréchet differentiability is guaranteed at least over a dense -subset of the space, see e.g. [65]. This is somewhat unsatisfactory, since here we would like to be able to say whether or not a risk function is differentiable at a specific random variable we have in mind. A broad treatment of the differentiability of risk functions is beyond the scope of this paper, however, in Section 5 we present examples of non-trivial risk functions (i.e. risk functions that are not simply the expectation) that are in fact differentiable over a sufficiently large subset of the space.
Remark 3.11*.*
While the question of the existence of Fréchet derivatives is open, more is known about the Gâteaux differentiability of risk functions. For any risk function , , we denote , and we say is proper if . We then have that a proper, coherent risk function is continuous and subdifferentiable in the interior of its domain [67]. In addition, if is continuous at and the subdifferential is a singleton, then is Gâteaux differentiable at , and the mapping is continuous (in fact is differentiable in the somewhat stronger sense of Hadamard [16]). The Gâteaux differentiability of distortion risk measures was shown in [55]. Although excluded from the published version, the Fréchet differentiability was also discussed in an earlier working paper version of the work, see [54]. We refer the reader to the work [50] for recent advances in Fréchet differentiability of convex Lipschitz functions, such as coherent risk functions over .
4 Risk aware minimum principle
Main results
We begin by stating our risk aware generalization of the stochastic Pontryagin’s minimum principle for Problem . We denote , and , and define the Hamiltonian as
[TABLE]
Note that compared to the risk neutral case, the term involving the cost rate function has been modified to feature an additional adjoint variable . We shall elaborate on this significant point later in more detail. We will give both necessary and sufficient conditions for the -optimality of a control . For sufficiency, we need an additional convexity assumption.
Assumption 4.1**.**
Suppose Assumptions 2.5 and 3.10 hold, and that additionally: (i) the functions and
[TABLE]
are convex for all , and (ii) the risk function is -convex.
The risk aware minimum principle can then be stated as follows.
Theorem 4.2** (Risk aware minimum principle).**
(i) Suppose , , satisfies Assumption 3.10. If is -optimal, then there exists unique -adapted continuous processes and , and a unique -predictable that satisfy the backward stochastic differential equation
[TABLE]
and the representation
[TABLE]
Moreover, the Hamiltonian of Eq. (4.1) is optimized in the sense that
[TABLE]
(ii) Suppose the stronger assumption, Assumption 4.1 holds. If , and if there exist processes , , satisfying Eqs. (4.2, 4.3, 4.4), then is -optimal.
Remark 4.3*.*
In some previous works on risk aware optimization utilizing generic risk functions [37, 41, 42], a state space augmentation scheme was used to derive a computationally viable form of the risk aware problem. However here, no augmentation is necessary. This is in contrast to the earlier result where the state space augmentation was an inextricable part of the end results. It should also be emphasized that these earlier papers focused on a convex analytic formulation of the problem whereas here, we consider a purely probabilistic approach.
Remark 4.4*.*
It has also not escaped us that the Clark-Ocone theorem, c.f. [22, Theorem 4.1], may be further used to characterize the process in terms of the Malliavin derivatives of . However, we leave the exploration of this connection to future work.
Intuitively, the risk aware minimum principle can be seen as a modification of the risk neutral Pontryagin’s minimum principle: Going from the risk neutral to the risk aware case, an additional process is introduced which acts as a rescaling or adjustment factor for given cost rate and terminal cost functions and . Moreover, as per Eq. (4.3), the values , of the process represent the controller’s time expectation of the derivative of the risk function evaluated at the total cost . Indeed, if is the expectation, the risk neutral minimum principle (see e.g. [8, Section 3.2]) is recovered with the process disappearing in a natural way.
Corollary 4.5**.**
Suppose that the assumptions of Theorem 4.2 hold, and additionally, and is the expectation. Then the statement of the theorem holds, with the Hamiltonian replaced by
[TABLE]
and where the process is constant, for all .
Proof.
Follows from Theorem 4.2 due to the fact that if , then the -derivative is identically one, and by Eq. (4.3), we have for all . Thus, we may also set in the definition of the Hamiltonian , Eq. (4.1) to recover the risk neutral minimum principle. ∎
Remark 4.6*.*
The process in the statement of Theorem 4.2 also satisfies a backward stochastic differential equation that is obtained in an intermediate step when proving the minimum principle. Specifically, there is a unique -predictable process , , such that
[TABLE]
Therefore together, Eqs. (2.1), (4.2), and (4.6) form a forward-backward system of stochastic differential equations with and state and adjoint state variables, respectively.
Remark 4.7*.*
Returning to Example 2.3, and setting and for all , and , we can easily see that Assumption 4.1 is satisfied. The Hamiltonian becomes , and by Eq. (4.4), -almost surely for almost all , if and if . However, the minimization of the Hamiltonian does not determine when . At first glance this would seem to imply that the conditions given in Theorem 4.2 are not in fact sufficient to fix the optimal control. But since , and , , by the uniqueness of the solutions we must have that and for all , which then implies and in turn that and for all . Therefore in order to find the optimal control it may be insufficient to only minimize the Hamiltonian, and instead one needs to determine the adjoint processes as well.
Proofs of the main results
The rest of this section is dedicated to proving the risk aware minimum principle, Theorem 4.2. We present our intermediate steps in reaching the main result, but defer the details of their proofs to Appendix A.3.
We adopt the following short-hand: For every Borel measurable function and every and , we denote
[TABLE]
In addition to the original stochastic differential equation, Eq. (2.1) describing a controlled process , we introduce the additional, coupled differential equation for a -valued process, the running costs, defined as
[TABLE]
We can then re-write the total cost as
[TABLE]
We shall use to indicate the range of the process .
In order to establish optimality conditions for vague controlled solutions, we need first and foremost some means of comparing pairs of solutions. This poses a slight technical challenge, as the state and control space processes for any given pair may be defined on different probability spaces. A natural way of comparing weak solutions of stochastic differential equations would be to compare the finite dimensional distributions of the state space processes (and the distributions of the cost variables ). However, since by Assumptions 2.5 and Proposition 2.7, strong solutions exists for given filtered probability spaces and control process, we can do slightly better. Specifically, we can construct an extended probability space simultaneously supporting both vague controlled solutions, and on which we can compare the pathwise laws of the solutions.
Lemma 4.8**.**
Suppose Assumption 2.5 holds, and that and , and let and be the corresponding Brownian motions. Then there exists a filtered probability space supporting an -Brownian motion , and processes and satisfying
[TABLE]
for all , and such that their laws equal those of and .
For simplicity, we shall implicitly suppose that pairs of vague controlled solutions are defined on the same probability space. In addition, for every pair of vague controlled solutions , the convex combination of their control processes shall be denoted by the short-hand , that is, for all , and ,
[TABLE]
We will the control as a perturbation of the original, reference control , and our goal is to derive optimality conditions from variational equations representing the response of the solution to .
We begin with a few auxiliary results, variations of which have appeared in the literature. The following lemma states that solutions corresponding to perturbed controls are, uniformly in time, good approximations of the unperturbed solutions.
Lemma 4.9**.**
For all and ,
[TABLE]
where is as in Assumption 2.5. In addition, we have for the terminal cost
[TABLE]
The following lemma provides the means for computing the first-order response of solutions to perturbations of the control process.
Lemma 4.10**.**
Let be arbitrary. Then there exists an -valued process that is the unique strong solution of
[TABLE]
Moreover, defining as
[TABLE]
we have
[TABLE]
and, for all ,
[TABLE]
The next results connect the response of the dynamics to the perturbation, described by the process and characterized by the above lemmas, to the risk aware objectives. Let us for brevity denote for all and for any law invariant risk function , with an -derivative
[TABLE]
where
[TABLE]
If is -optimal, then by definition for any and we have that
[TABLE]
We will use Eq. (4.18) as a starting point for deriving our optimality conditions.
Lemma 4.11**.**
Suppose Assumption 3.10 holds. Let be -optimal and arbitrary, and let the process be as in the statement of Lemma 4.10. Then
[TABLE]
where is as defined in Eq. (4.17).
We can now construct the adjoint processes appearing in Eqs. (4.2, 4.6), and use them to restate the optimality condition of Eq. (4.19). The proof of the lemma follows roughly the same ideas as used in the risk neutral case, see e.g. [13, 14, 11, 59], and relies primarily on the martingale representation theorem. In the risk aware case, we need to additionally handle the nonlinearity of the risk aware objective, which gives rise to the risk adjustment process.
Lemma 4.12**.**
Suppose Assumptions 3.10 hold, and that
[TABLE]
is -optimal. Then there are unique -adapted continuous processes and , and unique -predictable processes and satisfying the backward stochastic differential equations
[TABLE]
where is as defined in Eq. (4.1), and Eq. (4.19) implies that for all ,
[TABLE]
Finally, we show that existence of the adjoints and minimization of the Hamiltonian is indeed sufficient to establish optimality.
Lemma 4.13**.**
Suppose Assumption 4.1 holds, , and there exists processes , , satisfying Eqs. (4.2, 4.3, 4.4). Then
[TABLE]
for every .
We can now collect the above together and give the proof of our main result, Theorem 4.2.
Proof of Theorem 4.2.
The first part of the theorem now follow directly from Lemma 4.12 and Eq. (4.21), while the second is a direct consequence of Lemma 4.13. The representation of Eq. (4.6) follows directly from Lemma 4.12. ∎
5 Examples of differentiable risk functions and
a portfolio allocation problem
The purpose of this section is to present an application of the results of previous sections, and hence the problem we consider is selected for simplicity while attempting to retain a reasonable degree of practical significance.
Risk functions
As examples of law invariant risk functions, we use the mean-deviation, the (smoothed) mean-semideviation, and entropic risk functionals.
Definition 5.1**.**
Let be a probability space. (i) Mean-deviation risk function is defined as the mapping
[TABLE]
where . (ii) Mean-semideviation risk function and the -smoothed mean-semideviation risk function , , are defined as
[TABLE]
where and are the positive part and -smoothed positive part functions, and for all and . (iii) Entropic risk function is the risk measure defined as
[TABLE]
where .
We note that the mean-deviation risk function is convex, positively homogeneous, and translation invariant, that is, it satisfies Definition 3.3 items (ii), (iii), and (iv). The mean-semideviation risk measure was considered in e.g. [67], and it too is convex, positively homogeneous, and translation invariant, but is additionally monotonic, satisfying Definition 3.3(i). As noted in Remark 3.5, the positive homogeneity of these functionals implies that they cannot be everywhere Fréchet differentiable. We demonstrate in the example problem below that this is not necessarily an issue for our purposes. Moreover, the -smoothed mean-semideviation risk function uniformly approximates , that is,
[TABLE]
but its restriction to is in fact everywhere Fréchet differentiable (this will be established in Lemma 5.2 below). The smoothed mean-semideviation is also convex and monotonic which, along with the above estimate, follows directly from the properties444Specifically, from the inequality , and the monotonicity and convexity of . of the -smoothed positive part function [21]. Our definition of was inspired by the construction of a smoothed conditional value-at-risk risk functional in [44]. The entropic risk function on the other hand satisfies monotonicity, convexity, and translation invariance properties, or items (i), (ii) and (iv) of Definition 3.3. It serves as an example of a commonly used risk function that is everywhere Fréchet differentiable.
Lemma 5.2**.**
(i) The mean-deviation risk function is Fréchet differentiable at every that is not almost surely constant, with the derivative being
[TABLE]
Moreover, the derivative does not exist at such that . It additionally has the -derivative that reads, for all that are not a Dirac measures,
[TABLE]
(ii) The -restriction of the -smoothed mean-semideviation risk function , , is Fréchet differentiable at every , and has the Fréchet- and -derivatives
[TABLE]
respectively, and where for all .
(iii) The entropic risk measure is Fréchet differentiable at every , with the Fréchet- and -derivatives and , ,
[TABLE]
Remark 5.3*.*
If the -norm in Eq. (5.1) is replaced by its square, it is easy to verify that the resulting risk function is everywhere Fréchet differentiable.
Portfolio allocation problem
As a practical example, we consider a simplified portfolio allocation problem. An agent manages a portfolio consisting of a risk free bond, yielding a constant return rate , and a risky stock whose price evolves according to , , , . Let be the net value of the agent’s portfolio where and represent the agent’s bond and stock holdings at any , respectively. Let be the proportion of the agent’s portfolio allocated to the risky asset, so that follows the stochastic differential equation
[TABLE]
with a given initial condition . Trading is costless and unconstrained so that is a choice variable for each . We suppose is constrained to the interval where 0<\underline{\phi}<\text{\bar{\phi}}<\infty, the agent optimizes the allocation so that the risk of the utility of is minimized. Here, the agent values their profits or losses using a logarithmic utility, so that their total cost evaluates to .
Re-writing Eq. (5.6) for the logarithm of , for all , and generalizing to a relaxed controlled process, we have that
[TABLE]
where is given. Let and be the drift and diffusion coefficients of Eq. (5.7), and let . Assumption 2.5 is now satisfied, with , , , , , , and . Since the initial condition is deterministic, may be selected to be arbitrarily large. It is easy to verify that Eq. (2.11) holds for any , so that we may consider -feasible solutions .
The risk aware control problem, Problem , becomes
[TABLE]
We note that for instance the mean-deviation risk function of Eq. (5.1) is -differentiable at .
Proposition 5.4**.**
There is no such that is almost surely bounded.
Proof.
Since for any the drift and diffusion are bounded, and the latter is always non-zero, can take arbitrarily large values. ∎
Since is not bounded, it cannot be constant, and therefore is -differentiable at the terminal cost. In addition, the e.g. the mean-deviation risk function or the restriction of the -smoothed mean-semideviation risk function together with the cost satisfy Assumption 3.10.
We can now use the risk aware minimum principle to characterize an optimal allocation process. For simplicity, we assume that the -derivative of the risk function is positive (this is the case for e.g. the -smoothed mean-semideviation when ). Non-positive values of the derivative can also be easily accommodated, but the added complexity would detract from the intuition of this example, which is to illustrate how risk awareness can manifest itself in real world applications.
Proposition 5.5**.**
Suppose , , is convex, satisfies Assumption 3.10, and has a positive -derivative, i.e. for all , . The optimal portfolio allocation for Problem is a strict control such that for all where
[TABLE]
and where
[TABLE]
is a risk premium in which
[TABLE]
for all .
We note that interestingly, the risk awareness of the objective function has now given rise to the additional risk premium process defined in Eq. (5.8). To wit, the risk premium vanishes if is the expectation, since then as noted in Corollary 4.5, for all implying that for all . Thus, the risk aware minimum principle may open new possibilities in e.g. risk pricing theory.
6 Conclusions
In Theorem 4.2 we have given a risk aware generalization of the stochastic minimum principle. A notable feature of the result is the way risk is captured via the risk adjustment process, essentially the marginal risk at a given time , Eq. (4.3). We argue that at least some form of a risk adjustment process is an inevitable consequence of the risk awareness, or effectively of the nonlinearity of the risk function. In our risk aware context, it is natural to expect that the optimal control should account for changes in the way the risk responds to changes in the terminal cost, given the information at any time . Indeed, the raison d’etre of dynamic risk measures is their property of time-consistency which prescribes the dependence of the risk function on the filtration. In the result we obtained, this risk accounting is represented by the -conditional expectation of the -derivative of the risk function evaluated at the terminal cost.
Although by not requiring that the risk functions are time-consistent we have provided a rather general version of a risk aware minimum principle, we have on the other hand opened ourselves to the possibility that the optimal controls might not be time-consistent. By this we mean that if the optimization problem were restarted at some time , the optimal value and control might change, and the controller could be better off by switching to a different control policy. However, since our risk aware minimum principle characterizes the optimal control in terms of the risk adjustment process, it is now possible to find new, sufficient conditions for time consistency of the controls. Moreover, it may now also be possible to consider constrained optimal control problems, where the purpose of the constraint is to enforce time-consistency of optimal controls.
Our minimum principle also gives, up to the knowledge of the authors, the first characterization of the risk aware optimal control that can be used to derive conditions under which an optimal control is strict or Markov. A simple application of Jensen’s inequality was used in the example problem to show that in that instance, a strict optimal control exists. Generalizations of this statement are not hard to imagine. The question of existence of Markov controls may be possible to explore using recent results on forward-backward stochastic differential equations. For instance [35, 34] present conditions under which the adjoint processes can be expressed as functions of the time and state variables, which could allow writing the optimal control as a function of time and state variables only.
Finally, one of the key assumptions in the risk aware minimum principle is the Fréchet differentiability of the risk function . For our results to hold, it is necessary that the risk function be differentiable over the random variables representing the total cost. Establishing more precisely what risk functions are Fréchet differentiable over a sufficiently large subset of random variables would widen the applicability of the results given in this paper.
Acknowledgments
The authors acknowledge the funding provided by the Singapore Ministry of Education, Tier II grant MOE2015-T2-2-148, Practical algorithms for large-scale sequential optimization.
Appendix A Proofs of the results
A.1 Proofs for Section 2
Proof of Example 2.4.
The main inequality of the example follows from a straight-forward application of the definition of the perturbed control and the Burkholder-Davis-Gundy inequality, [58, Theorem 1.76]. Explicitly,
[TABLE]
∎
Proof of Proposition 2.7.
The drift and diffusion functions and are by Assumption 2.5(iii) -Lipschitz. In addition, by using the growth conditions of Assumption 2.5(ii), they satisfy the following boundedness conditions:
[TABLE]
where we have used the -admissibility of the control, that is, Assumption 2.5(vii) and Eq. (2.4), and the upper bound of Eq. (2.11b), . So being, [58, Theorem 3.17] states that a unique strong solution of Eq. (2.1) exists.
We can now estimate the costs using the growth conditions of Assumption 2.5(iv)
[TABLE]
To reach the final inequalities, we have used Eq. (2.11d) giving (clearly the weaker assumption would have sufficed, but the stronger form shall be used later), and additionally using Eq. (2.11a), , so that the finiteness of the terms is implied by and the -admissibility of the control. We see that , and the proof of the first part is complete. ∎
A.2 Proofs for Section 3
Proof of Proposition 3.7.
This result is proven in [19, Proposition 5.25] for the case of ; here we are merely pointing out that the statement naturally holds also in the “smaller” spaces , . Let be an -representation of , whose Fréchet derivative is continuous. Since the embedding of into is continuous, the Fréchet derivative is continuous on as well. Therefore, there is an almost surely unique -derivative such that . As an element of , is also in , . ∎
A.3 Proofs for Section 4
For the detailed proofs, we need to extend our notations somewhat. Let and for all . For all differentiable functions , we define so that for all , , .
Let , and for all , . Let and . The arrays and are defined so that
[TABLE]
for all , and , , where in the former definition and in the latter and . In addition, for all , we define as such that
[TABLE]
for all , .
We will also repeatedly use the following identity and estimates:
[TABLE]
In addition, we shall frequently apply the Burkholder-Davis-Gundy (BDG) inequality (see e.g. [58, Theorem 1.76]), and we will use , , to denote the constant in the upper bound given in the inequality.
Proof of Proposition 4.8.
Let , , , and . The filtered probability space is then constructed from by conditioning on the event that the paths of the Brownian motions and are the same: We set , , , and for all . We can then define the processes and for all . These are -progressive by virtue of and being - and -progressive, respectively. In addition, we can define the -Brownian motion as for all . The drift and diffusion coefficients defined by Eq. (4.8) satisfy Assumptions 2.5 and by 2.7, a solution exists on . The and marginals of are again and , and hence the laws of the state space and control processes on the extended space agree with those on the original spaces. ∎
Proof of Lemma 4.9.
We estimate the distance between the original and the perturbed process as follows. Let be for now arbitrary. Using the triangle inequality, the elementary estimate of Eq. (A.1e), and Jensen’s inequality,
[TABLE]
We estimate individually each of the terms on the right of the above inequality. Starting with the diffusion terms, by the BDG inequality and by using the definition of as , for all along with Assumption 2.5(i), i.e. the growth condition on , and similar estimates as above,
[TABLE]
We set this inequality aside to be used a moment later, and consider next the penultimate term in Eq. (A.2). Using again the BDG inequality and Assumption 2.5(iii), and the inequality
[TABLE]
for all measurable , , , and any (pre-emptively, we select ), we obtain
[TABLE]
The drift terms in Eq. (A.2) are estimated similarly,
[TABLE]
and
[TABLE]
Collecting estimates of Eqs. (A.3, A.4, A.5, A.6) and applying them to Eq. (A.2), and after rearranging, we get,
[TABLE]
The expectation in is finite, since by Proposition 2.7 and (Assumptions 2.5 state ), and by Eq. (2.11b) and the control is -admissible. Using Grönwall’s inequality (see e.g. [58, Corollary 6.60]), we find that
[TABLE]
from where Eq. (4.9a) follows.
To prove Eq. (4.9b), consider the running cost processes, and . We have that
[TABLE]
The latter term is , which can be verified using similar estimates and assumptions as before,
[TABLE]
The finiteness of the expectation on the second to last line now follows from the fact and -admissibility of the control, when one notes that by Eqs. (2.11a, 2.11d), , .
To complete the proof of Eq. (4.9b), it then remains to show that the first term on the right hand side of Eq. (A.9) is also . The boundedness of , i.e. Assumption 2.5(v) implies that
[TABLE]
and where is defined in Eq. (A.1d). Thus,
[TABLE]
The first term on the right is by virtue of Eq. (4.9a) which we established earlier, and the fact that from Eq. (2.11a). The remaining two are treated as follows. We define
[TABLE]
Using Eqs. (2.11a, 2.11c, 2.11d), we have that
[TABLE]
and consequently,
[TABLE]
We can then use Hölder’s inequality
[TABLE]
The latter factor is , again by Eq. (4.9a), and since , . We only need to show , , which is straight-forward (note that Eqs. (2.11) also imply and ):
[TABLE]
where we have as usual used the fact and the -admissibility of the control. Therefore Eq. (4.9b) holds.
Finally, we turn to Eq. (4.10). We have that
[TABLE]
The latter expectation is in by Eq. (4.9a), and the former is finite since by Eqs. (2.11c, 2.11d),
[TABLE]
and . Eq. (4.10) holds, and the proof is complete. ∎
Proof of Lemma 4.10.
The drift and diffusion coefficients appearing in Eq. (4.11) are Lipschitz, since by Assumption 2.5(iii) the gradients of and are bounded. In addition, the terms in Eq. (4.11) that do not depend on satisfy
[TABLE]
where we have used the growth conditions of Assumption 2.5(ii), Eq. (2.11b), , and the -admissibility of the control. A unique strong solution of Eq. (4.11) now exists by e.g. [58, Theorem 3.17], which also satisfies Eq. (4.13a).
To prove Eq. (4.13b), let be to be determined. We use the growth conditions on and , Assumptions 2.5(iv, v), to estimate as follows.
[TABLE]
We select , that is, so that the expectation involving is guaranteed to be finite (this follows from Eq. (4.13a)). In order to ensure that the two other expectations are also finite, we need to fix so that
[TABLE]
where the upper bounds are set by , and the -admissibility of the control. Largest choice therefore satisfies
[TABLE]
Note that here depends on , but since as a function of , the right hand side is continuous, decreasing, and maps to for some , a solution exists.
We want to show that . Using Eqs. (2.11c) and (2.11d),
[TABLE]
This implies that , from which we obtain . This establishes Eq. (4.13b).
Let us define
[TABLE]
Note now that we can write
[TABLE]
where we have defined
[TABLE]
Analogously, we find that
[TABLE]
where
[TABLE]
We can then write, for arbitrary ,
[TABLE]
Using arguments we used in the proof of the previous lemma, we can estimate
[TABLE]
Returning to Eq. (A.15), applying the estimates of Eqs. (A.16) and (A.17), and rearranging and using Grönwall’s inequality (see steps leading to Eqs. (A.7, A.8)), we obtain
[TABLE]
To show that Eq. (4.14a) holds, it then remains to show that
[TABLE]
These limits are obtained from the definitions of and by using Eqs. (4.9a) and (4.13a), and the continuity and boundedness of the gradients of and . Explicitly,
[TABLE]
The first term is by Eq. (4.9a), and the second is finite by Eq. (4.13a) and boundedness of , and tends to zero as , since is continuous. This completes the estimates of the right hand side of Eq. (A.15), and so Eq. (4.14a) is proven.
Moving on to proving Eq. (4.14b), we proceed as above, and use estimates analogous to those used in the lead up to Eq. (A.10), so that
[TABLE]
The terms on the three first lines on the right of the last inequality can now be shown to be using Eq. (4.14a) and an application of Hölder’s inequality mimicking the steps in Eqs. (A.11, A.12, A.13). Similarly applying Hölder’s inequality to the remaining term on the last line yields
[TABLE]
and, by continuity of , this term is in , and Eq. (4.14b) follows. ∎
Proof of Lemma 4.11.
Using the -differentiability of and Eq. (3.2) and the short-hand of Eq. (4.17), we have that
[TABLE]
where
[TABLE]
By Lemma 4.9,
[TABLE]
and therefore . From the optimality condition of Eq. (4.18),
[TABLE]
Dividing this by , taking the limit while using a similar estimate as in Eq. (A.14) and applying Lemma 4.10, we obtain the equation claimed in the statement of this lemma. ∎
Proof of Lemma 4.12.
We give the proof for , but comment at relevant places on changes needed to accommodate the case. The statement of the lemma amounts to expressing Eq. (4.19) by using processes that are constructed to satisfy Eq. (4.20). For brevity, we set , , for all .
Let be the fundamental solution of Eq. (4.11), i.e. , , , where is the identity matrix, and
[TABLE]
The drift and diffusion functions, and , , are -Lipschitz in for all since by Assumption 2.5(iii) the gradients of and are bounded. By an application of e.g. [58, Theorem 3.17], we find that Eq. (A.18) has a unique strong solution satisfying
[TABLE]
In addition, we define the process as the unique strong solution of the stochastic differential equation
[TABLE]
Such a solution exists by the same argument as used for Eq. (A.18), and moreover,
[TABLE]
holds. It is easily verified that for all by applying Itô’s lemma to and . Finally, one additional, -valued process will be necessary. We define as such that
[TABLE]
Let us then define the random variable as such that
[TABLE]
We begin by showing that for a to be determined later. For this task, we additionally define
[TABLE]
Using Eq. (2.11), we find that
[TABLE]
A straight-forward calculation yields additionally the following
[TABLE]
that is, . Let be arbitrary, and set
[TABLE]
We claim that
[TABLE]
Since , we have and the above implies that . To prove Eq. (A.24), we first show that
[TABLE]
We explicitly prove only the latter inclusion, the former is established in very much the same way. Basic estimates show that
[TABLE]
Using Hölder’s inequality,
[TABLE]
The first factor is finite by Eq. (A.19). To show the same for the second one, it suffices to show that we can select a so that
[TABLE]
By the standard estimate of Eq. (2.12), and the admissibility condition of Eq. (2.4) and constraints of Eq. (2.11), the largest we can take is . Th choice is valid if , which is indeed the case:
[TABLE]
This is sufficient to establish Eq. (A.27).
Turning to proving Eq. (A.24), based on the above it is enough to show that for all . Let be any such random variable. Then, again using Hölder’s inequality,
[TABLE]
Selecting , the first factor in the above inequality is finite, since . Note that
[TABLE]
since . Moreover, with this choice, the power on the second factor becomes ,
[TABLE]
and since , . Eq. (A.24) is now proven.
We can now apply the martingale representation theorem for -random variables (), given e.g. in [58, Theorem 2.42], to and . This provides us with unique -predictable processes and , taking respectively values in and , such that
[TABLE]
These representations are unique, and
[TABLE]
Moreover, we define the processes and as the -conditional expectations of and , which now by [58, Corollary 2.44] satisfy
[TABLE]
We note that if , in the application of the martingale representation theorem we may instead pick an arbitrary instead of .
We next define the processes , and as such that
[TABLE]
The process solves Eq. (4.20). This is already shown above for . To show that satisfies its respective backward stochastic differential equation, we apply Itô’s lemma to as given in Eq. (A.35) to obtain
[TABLE]
To verify the terminal condition in Eq. (4.20), note that from the definitions of and ,
[TABLE]
We can now establish that and , or in fact, a slightly strengthened version thereof. To proceed, we unfortunately need to add to the notational clutter: Let , and set . Consider first the process , and let us estimate the terms in its definition, Eq. (A.35) individually. For the first term we obtain
[TABLE]
Selecting , and using Eqs. (A.20) and (A.34), we find that the above is finite. Note that since . The second term is treated as follows.
[TABLE]
where and . We select , as this is by Eq. (A.34) the largest choice still ensuring the finiteness of the first factor. Next, we set as this is sufficient to guarantee the finiteness of the second factor, cf. Eq. (A.29). By Eqs. (A.19) and (A.20), may be arbitrarily large, and we then only need to verify that :
[TABLE]
where the final inequality is a simple consequence of , or in this case, . We now have that
[TABLE]
Regarding the process , we estimate each of terms in its definition, Eq. (A.36) individually. For the first and second terms, an almost identical calculation as above for the first and second terms of , but using Eq. (A.33) instead of Eq. (A.34), shows
[TABLE]
The last term in , , can be treated in the same way, noting the boundedness of for all . Putting the above together, we have that
[TABLE]
and since , or . Therefore, and .
Finally, we prove Eq. (4.21). The solution of Eq. (4.11) can be written using the processes and as
[TABLE]
Consider next the processes and taking respectively values in and , and defined as
[TABLE]
where is as defined in Eq. (4.12). From Eq. (A.37) we immediately find that and satisfy
[TABLE]
Note now that the expectation of equals the right-hand side of the inequality of Eq. (4.19):
[TABLE]
To compute the above, we differentiate to obtain555The following identities were used in simplifying the expressions in this chain of equations: (i) ; (ii) ; (iii) ; (iv) ; (v) .,
[TABLE]
Evaluating this at , taking the expectation, and using Eq. (A.38), we get
[TABLE]
where
[TABLE]
Eq. (4.21) follows now immediately from Eqs. (4.19) and (A.39), if . This is the case if the integrands in the expression are in , see e.g. [58, Theorem 2.6]. Using the estimates of Eqs. (4.13) for , and the bounds on and , the square integrability can be verified with a straight-forward application of Hölder’s inequality. For example, for the first term,
[TABLE]
and the rest follow analogously. If , the last term is somewhat special, since we cannot apply Hölder’s inequality in the same way (we have no -norm equivalent bound on ). However, the estimate of Eq. (4.13b) is slightly stronger than that of Eq. (4.13a) precisely to accommodate this edge case. Therefore, , and the proof is complete. ∎
Proof of Lemma 4.13.
let be arbitrary. We have from the -convexity of and convexity of that
[TABLE]
By using the construction of the process , the above becomes
[TABLE]
We can evaluate the above expectation by first differentiating , using the and differential equations (2.1, 4.7, 4.20), evaluating the integrals at , and then taking expectations:
[TABLE]
so that
[TABLE]
The expectation of the integrals against the Brownian motion is zero [58, Theorem 2.6], since the integrands are in .
Let us denote
[TABLE]
Since we have assumed that is jointly convex in the state and control variables, we have that for any ,
[TABLE]
On the other hand, using the differentiability of on ,
[TABLE]
so that
[TABLE]
Using the above, along with the assumption that minimizes for -almost every , we have that
[TABLE]
-almost always. Applying this estimate in Eq. (A.40), we get
[TABLE]
implying that
[TABLE]
and the proof is complete. ∎
A.4 Proofs for Section 5
Proof of Lemma 5.2.
(i) Note that if and only if is almost surely constant. The Fréchet derivative of the first term in Eq. (5.1), the expectation, is clearly . Focusing then on the derivative of the second, norm term, we first note that the derivative of is , which suggests that
[TABLE]
This can be verified through a direct calculation: By straight-forward algebraic manipulation, one obtains
[TABLE]
Taking the limit , the following is quickly recovered
[TABLE]
The right-hand side is clearly zero. Noting that , Eq. (5.3) follows. The non-differentiability at almost surely constant random variables follows from the positive homogeneity and translation invariance of : At , , we have , but at , we have that which is not linear. Eq. (5.4) is easily found from the form of the Fréchet derivative of Eq. (5.3).
(ii) We first note that
[TABLE]
Since , from the second equality it follows that
[TABLE]
We verify Eq. (5.5) by a direct calculation. Consider now
[TABLE]
Next, using the identity of Eq. (A.41), followed by Hölder’s inequality, and the estimate of Eq. (A.42), we get that
[TABLE]
This is sufficient to show that for all , and so is Fréchet differentiable on with the given derivative for all . The form of the -derivative is easily verified from .
(iii) It suffices to show that the limit in Eq. (3.1) is attained uniformly over such that . We now have that by Taylor series expanding the exponential and using the fact almost everywhere. By the chain rule of differentiation, follows. The -derivative is similarly easily found. ∎
Proof of Proposition 5.5.
We first note that Assumptions 2.5 are easily verified for the stochastic differential equations of Problem . Suppose is -optimal. The Hamiltonian of Eq. (4.1) becomes
[TABLE]
By Theorem 4.2, we know that there exists a process where by Eqs. (4.2, 4.3, 4.6), y_{t}^{\prime\,\pi}=\mathbb{E}\bigl{[}\mathrm{D}\rho(\mathscr{L}(-x_{T}^{\pi}))(-x_{T}^{\pi})\bigm{|}\mathcal{F}_{t}\bigr{]}, , and , . This yields Eqs. (5.9) and (5.10). By the uniqueness of solutions of Lipschitz backward differential equations, see e.g. [58, Theorem 5.17], we have that and for all , -almost surely. From the assumption of positivity of we infer that and for all . We can thus assume in the following that and .
Since as a function of the control, is strictly convex for all , by an elementary application of Jensen’s inequality we see that a minimizer of Eq. (4.4) is found in Dirac measures: For any , we have that
[TABLE]
for all , where . If is a minimizer of and , then using the convexity of , we have the Dirac measure such that . Therefore a minimizer is always found within the set of Dirac measures, and we can consider the problem
[TABLE]
This immediately yields as a minimizer the function \phi^{\ast}:$$\mathbb{Y}\times\mathbb{Z}\to\mathbb{A} such that
[TABLE]
Since and the terminal cost function are convex in and , respectively, and is -convex by the assumption of the proposition, Assumption 4.1 holds and by Theorem 4.2(ii) the above properties are also sufficient for to be -optimal. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] B. Acciaio and I. Penner , Dynamic risk measures , in Advanced Mathematical Methods for Finance, G. Di Nunno and B. Øksendal, eds., Springer, Berlin Heidelberg, 2011, pp. 1–34.
- 2[2] B. Acciaio and G. Svindland , Are law-invariant risk functions concave on distributions? , Dependence Modeling, 1 (2013).
- 3[3] N. U. Ahmed and C. D. Charalambous , Stochastic minimum principle for partially observed systems subject to continuous and jump diffusion processes and driven by relaxed controls , SIAM Journal on Control and Optimization, 51 (2013), pp. 3235–3257.
- 4[4] D. Andersson and B. Djehiche , A maximum principle for relaxed stochastic control of linear SD Es with application to bond portfolio optimization , Mathematical Methods of Operations Research, 72 (2010), pp. 273–310.
- 5[5] P. Artzner, F. Delbaen, J.-M. Eber, and D. Heath , Coherent measures of risk , Mathematical Finance, 9 (1999), pp. 203–228.
- 6[6] F. Baghery and B. Øksendal , A maximum principle for stochastic control with partial information , Stochastic Analysis and Applications, 25 (2007), pp. 705–717.
- 7[7] K. Bahlali, M. Mezerdi, and B. Mezerdi , On the relaxed mean-field stochastic control problem , Stochastics and Dynamics, 18 (2018), p. 1850024.
- 8[8] S. Bahlali , Necessary and sufficient optimality conditions for relaxed and strict control problems , SIAM Journal on Control and Optimization, 47 (2008), pp. 2078–18.
