# Robustness¶

Contents

## Overview¶

This lecture modifies a Bellman equation to express a decision maker’s doubts about transition dynamics

His specification doubts make the decision maker want a *robust* decision rule

*Robust* means insensitive to misspecification of transition dynamics

The decision maker has a single *approximating model*

He calls it *approximating* to acknowledge that he doesn’t completely trust it

He fears that outcomes will actually be determined by another model that he cannot describe explicitly

All that he knows is that the actual data-generating model is in some (uncountable) set of models that surrounds his approximating model

He quantifies the discrepancy between his approximating model and the genuine data-generating model by using a quantity called *entropy*

(We’ll explain what entropy means below)

He wants a decision rule that will work well enough no matter which of those other models actually governs outcomes

This is what it means for his decision rule to be “robust to misspecification of an approximating model”

This may sound like too much to ask for, but \(\ldots\)

\(\ldots\) a *secret weapon* is available to design robust decision rules

The secret weapon is max-min control theory

A value-maximizing decision maker enlists the aid of an (imaginary) value-minimizing model chooser to construct *bounds* on the value attained by a given decision rule under different models of the transition dynamics

The original decision maker uses those bounds to construct a decision rule with an assured performance level, no matter which model actually governs outcomes

Note

In reading this lecture, please don’t think that our decision maker is paranoid when he conducts a worst-case analysis. By designing a rule that works well against a worst-case, his intention is to construct a rule that will work well across a *set* of models.

### Sets of Models Imply Sets Of Values¶

Our “robust” decision maker wants to know how well a given rule will work when he does not *know* a single transition law \(\ldots\)

\(\ldots\) he wants to know *sets* of values that will be attained by a given decision rule \(F\) under a *set* of transition laws

Ultimately, he wants to design a decision rule \(F\) that shapes these *sets* of values in ways that he prefers

With this in mind, consider the following graph, which relates to a particular decision problem to be explained below

The figure shows a *value-entropy correspondence* for a particular decision rule \(F\)

The shaded set is the graph of the correspondence, which maps entropy to a set of values associated with a set of models that surround the decision maker’s approximating model

Here

*Value*refers to a sum of discounted rewards obtained by applying the decision rule \(F\) when the state starts at some fixed initial state \(x_0\)*Entropy*is a nonnegative number that measures the size of a set of models surrounding the decision maker’s approximating model- Entropy is zero when the set includes only the approximating model, indicating that the decision maker completely trusts the approximating model
- Entropy is bigger, and the set of surrounding models is bigger, the less the decision maker trusts the approximating model

The shaded region indicates that for **all** models having entropy less than or equal to the number on the horizontal axis, the value obtained will be somewhere within the indicated set of values

Now let’s compare sets of values associated with two different decision rules, \(F_r\) and \(F_b\)

In the next figure,

- The red set shows the value-entropy correspondence for decision rule \(F_r\)
- The blue set shows the value-entropy correspondence for decision rule \(F_b\)

The blue correspondence is skinnier than the red correspondence

This conveys the sense in which the decision rule \(F_b\) is *more robust* than the decision rule \(F_r\)

*more robust*means that the set of values is less sensitive to*increasing misspecification*as measured by entropy

Notice that the less robust rule \(F_r\) promises higher values for small misspecifications (small entropy)

(But it is more fragile in the sense that it is more sensitive to perturbations of the approximating model)

Below we’ll explain in detail how to construct these sets of values for a given \(F\), but for now \(\ldots\)

Here is a hint about the *secret weapons* we’ll use to construct these sets

- We’ll use some min problems to construct the lower bounds
- We’ll use some max problems to construct the upper bounds

We will also describe how to choose \(F\) to shape the sets of values

This will involve crafting a *skinnier* set at the cost of a lower *level* (at least for low values of entropy)

### Inspiring Video¶

If you want to understand more about why one serious quantitative researcher is interested in this approach, we recommend Lars Peter Hansen’s Nobel lecture

## The Model¶

For simplicity, we present ideas in the context of a class of problems with linear transition laws and quadratic objective functions

To fit in with *our earlier lecture on LQ control*, we will treat loss minimization rather than value maximization

To begin, recall the infinite horizon LQ problem, where an agent chooses a sequence of controls \(\{u_t\}\) to minimize

subject to the linear law of motion

As before,

- \(x_t\) is \(n \times 1\), \(A\) is \(n \times n\)
- \(u_t\) is \(k \times 1\), \(B\) is \(n \times k\)
- \(w_t\) is \(j \times 1\), \(C\) is \(n \times j\)
- \(R\) is \(n \times n\) and \(Q\) is \(k \times k\)

Here \(x_t\) is the state, \(u_t\) is the control, and \(w_t\) is a shock vector.

For now we take \(\{ w_t \} := \{ w_t \}_{t=1}^{\infty}\) to be deterministic — a single fixed sequence

We also allow for *model uncertainty* on the part of the agent solving this optimization problem

In particular, the agent takes \(w_t = 0\) for all \(t \geq 0\) as a benchmark model, but admits the possibility that this model might be wrong

As a consequence, she also considers a set of alternative models expressed in terms of sequences \(\{ w_t \}\) that are “close” to the zero sequence

She seeks a policy that will do well enough for a set of alternative models whose members are pinned down by sequences \(\{ w_t \}\)

Soon we’ll quantify the quality of a model specification in terms of the maximal size of the expression \(\sum_{t=0}^{\infty} \beta^{t+1}w_{t+1}' w_{t+1}\)

## Constructing More Robust Policies¶

If our agent takes \(\{ w_t \}\) as a given deterministic sequence, then, drawing on intuition from earlier lectures on dynamic programming, we can anticipate Bellman equations such as

(Here \(J\) depends on \(t\) because the sequence \(\{w_t\}\) is not recursive)

Our tool for studying robustness is to construct a rule that works well even if an adverse sequence \(\{ w_t \}\) occurs

In our framework, “adverse” means “loss increasing”

As we’ll see, this will eventually lead us to construct the Bellman equation

Notice that we’ve added the penalty term \(- \theta w'w\)

Since \(w'w = \| w \|^2\), this term becomes influential when \(w\) moves away from the origin

The penalty parameter \(\theta\) controls how much we penalize the maximizing agent for “harming” the minmizing agent

By raising \(\theta\) more and more, we more and more limit the ability of maximizing agent to distort outcomes relative to the approximating model

So bigger \(\theta\) is implicitly associated with smaller distortion sequences \(\{w_t \}\)

### Analyzing the Bellman equation¶

So what does \(J\) in (3) look like?

As with the *ordinary LQ control model*, \(J\) takes the form \(J(x) = x' P x\) for some symmetric positive definite matrix \(P\)

One of our main tasks will be to analyze and compute the matrix \(P\)

Related tasks will be to study associated feedback rules for \(u_t\) and \(w_{t+1}\)

First, using matrix calculus, you will be able to verify that

where

and \(I\) is a \(j \times j\) identity matrix. Substituting this expression for the maximum into (3) yields

Using similar mathematics, the solution to this minimization problem is \(u = - F x\) where \(F := (Q + \beta B' \mathcal D (P) B)^{-1} \beta B' \mathcal D(P) A\)

Substituting this minimizer back into (6) and working through the algebra gives \(x' P x = x' \mathcal B ( \mathcal D( P )) x\) for all \(x\), or, equivalently,

where \(\mathcal D\) is the operator defined in (5) and

The operator \(\mathcal B\) is the standard (i.e., non-robust) LQ Bellman operator, and \(P = \mathcal B(P)\) is the standard matrix Riccati equation coming from the Bellman equation — see this discussion

Under some regularity conditions (see [HS08]), the operator \(\mathcal B \circ \mathcal D\) has a unique positive definite fixed point, which we denote below by \(\hat P\)

A robust policy, indexed by \(\theta\), is \(u = - \hat F x\) where

We also define

The interpretation of \(\hat K\) is that \(w_{t+1} = \hat K x_t\) on the worst-case path of \(\{x_t \}\), in the sense that this vector is the maximizer of (4) evaluated at the fixed rule \(u = - \hat F x\)

Note that \(\hat P, \hat F, \hat K\) are all determined by the primitives and \(\theta\)

Note also that if \(\theta\) is very large, then \(\mathcal D\) is approximately equal to the identity mapping

Hence, when \(\theta\) is large, \(\hat P\) and \(\hat F\) are approximately equal to their standard LQ values

Furthermore, when \(\theta\) is large, \(\hat K\) is approximately equal to zero

Conversely, smaller \(\theta\) is associated with greater fear of model misspecification, and greater concern for robustness

## Robustness as Outcome of a Two-Person Zero-Sum Game¶

What we have done above can be interpreted in terms of a two-person zero-sum game in which \(\hat F, \hat K\) are Nash equilibrium objects

Agent 1 is our original agent, who seeks to minimize loss in the LQ program while admitting the possibility of misspecification

Agent 2 is an imaginary malevolent player

Agent 2’s malevolence helps the original agent to compute bounds on his value function across a set of models

We begin with agent 2’s problem

### Agent 2’s Problem¶

Agent 2

- knows a fixed policy \(F\) specifying the behavior of agent 1, in the sense that \(u_t = - F x_t\) for all \(t\)
- responds by choosing a shock sequence \(\{ w_t \}\) from a set of paths sufficiently close to the benchmark sequence \(\{0, 0, 0, \ldots\}\)

A natural way to say “sufficiently close to the zero sequence” is to restrict the summed inner product \(\sum_{t=1}^{\infty} w_t' w_t\) to be small

However, to obtain a time-invariant recusive formulation, it turns out to be convenient to restrict a discounted inner product

Now let \(F\) be a fixed policy, and let \(J_F(x_0, \mathbf w)\) be the present-value cost of that policy given sequence \(\mathbf w := \{w_t\}\) and initial condition \(x_0 \in \mathbb R^n\)

Substituting \(-F x_t\) for \(u_t\) in (1), this value can be written as

where

and the initial condition \(x_0\) is as specified in the left side of (10)

Agent 2 chooses \({\mathbf w}\) to maximize agent 1’s loss \(J_F(x_0, \mathbf w)\) subject to (9)

Using a Lagrangian formulation, we can express this problem as

where \(\{x_t\}\) satisfied (11) and \(\theta\) is a Lagrange multiplier on constraint (9)

For the moment, let’s take \(\theta\) as fixed, allowing us to drop the constant \(\beta \theta \eta\) term in the objective function, and hence write the problem as

or, equivalently,

subject to (11)

What’s striking about this optimization problem is that it is once again an LQ discounted dynamic programming problem, with \(\mathbf w = \{ w_t \}\) as the sequence of controls

The expression for the optimal policy can be found by applying the usual LQ formula (see here)

We denote it by \(K(F, \theta)\), with the interpretation \(w_{t+1} = K(F, \theta) x_t\)

The remaining step for agent 2’s problem is to set \(\theta\) to enforce the constraint (9), which can be done by choosing \(\theta = \theta_{\eta}\) such that

Here \(x_t\) is given by (11) — which in this case becomes \(x_{t+1} = (A - B F + CK(F, \theta)) x_t\)

### Using Agent 2’s Problem to Construct Bounds on the Value Sets¶

#### The Lower Bound¶

Define the minimized object on the right side of problem (12) as \(R_\theta(x_0, F)\).

Because “minimizers minimize” we have

where \(x_{t+1} = (A - B F + CK(F, \theta)) x_t\) and \(x_0\) is a given initial condition.

This inequality in turn implies the inequality

where

The left side of inequality (14) is a straight line with slope \(-\theta\)

Technically, it is a “separating hyperplane”

At a particular value of entropy, the line is tangent to the lower bound of values as a function of entropy

In particular, the lower bound on the left side of (14) is attained when

To construct the *lower bound* on the set of values associated with all perturbations \({\mathbf w}\) satisfying the entropy constraint (9) at a given entropy level, we proceed as follows:

- For a given \(\theta\), solve the minimization problem (12)
- Compute the minimizer \(R_\theta(x_0, F)\) and the associated entropy using (15)
- Compute the lower bound on the value function \(R_\theta(x_0, F) - \theta \ {\rm ent}\) and plot it against \({\rm ent}\)
- Repeat the preceding three steps for a range of values of \(\theta\) to trace out the lower bound

Note

This procedure sweeps out a set of separating hyperplanes indexed by different values for the Lagrange multiplier \(\theta\)

#### The Upper Bound¶

To construct an *upper bound* we use a very similar procedure

We simply replace the *minimization* problem (12) with the *maximization* problem

where now \(\tilde \theta >0\) penalizes the choice of \({\mathbf w}\) with larger entropy.

(Notice that \(\tilde \theta = - \theta\) in problem (12))

Because “maximizers maximize” we have

which in turn implies the inequality

where

The left side of inequality (17) is a straight line with slope \(\tilde \theta\)

The upper bound on the left side of (17) is attained when

To construct the *upper bound* on the set of values associated all perturbations \({\mathbf w}\) with a given entropy we proceed much as we did for the lower bound

- For a given \(\tilde \theta\), solve the maximization problem (16)
- Compute the maximizer \(V_{\tilde \theta}(x_0, F)\) and the associated entropy using (18)
- Compute the upper bound on the value function \(V_{\tilde \theta}(x_0, F) + \tilde \theta \ {\rm ent}\) and plot it against \({\rm ent}\)
- Repeat the preceding three steps for a range of values of \(\tilde \theta\) to trace out the upper bound

#### Reshaping the set of values¶

Now in the interest of *reshaping* these sets of values by choosing \(F\), we turn to agent 1’s problem

### Agent 1’s Problem¶

Now we turn to agent 1, who solves

where \(\{ w_{t+1} \}\) satisfies \(w_{t+1} = K x_t\)

In other words, agent 1 minimizes

subject to

Once again, the expression for the optimal policy can be found here — we denote it by \(\tilde F\)

### Nash Equilibrium¶

Clearly the \(\tilde F\) we have obtained depends on \(K\), which, in agent 2’s problem, depended on an initial policy \(F\)

Holding all other parameters fixed, we can represent this relationship as a mapping \(\Phi\), where

The map \(F \mapsto \Phi (K(F, \theta))\) corresponds to a situation in which

- agent 1 uses an arbitrary initial policy \(F\)
- agent 2 best responds to agent 1 by choosing \(K(F, \theta)\)
- agent 1 best responds to agent 2 by choosing \(\tilde F = \Phi (K(F, \theta))\)

As you may have already guessed, the robust policy \(\hat F\) defined in (7) is a fixed point of the mapping \(\Phi\)

In particular, for any given \(\theta\),

- \(K(\hat F, \theta) = \hat K\), where \(\hat K\) is as given in (8)
- \(\Phi(\hat K) = \hat F\)

A sketch of the proof is given in the appendix

## The Stochastic Case¶

Now we turn to the stochastic case, where the sequence \(\{w_t\}\) is treated as an iid sequence of random vectors

In this setting, we suppose that our agent is uncertain about the *conditional probability distribution* of \(w_{t+1}\)

The agent takes the standard normal distribution \(N(0, I)\) as the baseline conditional distribution, while admitting the possibility that other “nearby” distributions prevail

These alternative conditional distributions of \(w_{t+1}\) might depend nonlinearly on the history \(x_s, s \leq t\)

To implement this idea, we need a notion of what it means for one distribution to be near another one

Here we adopt a very useful measure of closeness for distributions known as the *relative entropy*, or Kullback-Leibler divergence

For densities \(p, q\), the Kullback-Leibler divergence of \(q\) from \(p\) is defined as

Using this notation, we replace (3) with the stochastic analogue

Here \(\mathcal P\) represents the set of all densities on \(\mathbb R^n\) and \(\phi\) is the benchmark distribution \(N(0, I)\)

The distribution \(\phi\) is chosen as the least desirable conditional distribution in terms of next period outcomes, while taking into account the penalty term \(\theta D_{KL}(\psi, \phi)\)

This penalty term plays a role analogous to the one played by the deterministic penalty \(\theta w'w\) in (3), since it discourages large deviations from the benchmark

### Solving the Model¶

The maximization problem in (22) appears highly nontrivial — after all, we are maximizing over an infinite dimensional space consisting of the entire set of densities

However, it turns out that the solution is tractable, and in fact also falls within the class of normal distributions

First, we note that \(J\) has the form \(J(x) = x' P x + d\) for some positive definite matrix \(P\) and constant real number \(d\)

Moreover, it turns out that if \((I - \theta^{-1} C' P C)^{-1}\) is nonsingular, then

where

and the maximizer is the Gaussian distribution

Substituting the expression for the maximum into Bellman equation (22) and using \(J(x) = x'Px + d\) gives

Since constant terms do not affect minimizers, the solution is the same as (6), leading to

To solve this Bellman equation, we take \(\hat P\) to be the positive definite fixed point of \(\mathcal B \circ \mathcal D\)

In addition, we take \(\hat d\) as the real number solving \(d = \beta \, [d + \kappa(\theta, P)]\), which is

The robust policy in this stochastic case is the minimizer in (25), which is once again \(u = - \hat F x\) for \(\hat F\) given by (7)

Substituting the robust policy into (24) we obtain the worst case shock distribution:

where \(\hat K\) is given by (8)

Note that the mean of the worst-case shock distribution is equal to the same worst-case \(w_{t+1}\) as in the earlier deterministic setting

### Computing Other Quantities¶

Before turning to implementation, we briefly outline how to compute several other quantities of interest

#### Worst-Case Value of a Policy¶

One thing we will be interested in doing is holding a policy fixed and computing the discounted loss associated with that policy

So let \(F\) be a given policy and let \(J_F(x)\) be the associated loss, which, by analogy with (22), satisfies

Writing \(J_F(x) = x'P_Fx + d_F\) and applying the same argument used to derive (23) we get

To solve this we take \(P_F\) to be the fixed point

and

If you skip ahead to the appendix, you will be able to verify that \(-P_F\) is the solution to the Bellman equation in agent 2’s problem discussed above — we use this in our computations

## Implementation¶

The QuantEcon.jl package provides a type called `RBLQ`

for implementation of robust LQ optimal control

Here’s the relevant code, from file `robustlq.jl`

```
#=
Provides a type called RBLQ for solving robust linear quadratic control
problems.
@author : Spencer Lyon <spencer.lyon@nyu.edu>
@date : 2014-08-19
References
----------
http://quant-econ.net/jl/robustness.html
=#
"""
Represents infinite horizon robust LQ control problems of the form
min_{u_t} sum_t beta^t {x_t' R x_t + u_t' Q u_t }
subject to
x_{t+1} = A x_t + B u_t + C w_{t+1}
and with model misspecification parameter theta.
##### Fields
- `Q::Matrix{Float64}` : The cost(payoff) matrix for the controls. See above
for more. `Q` should be k x k and symmetric and positive definite
- `R::Matrix{Float64}` : The cost(payoff) matrix for the state. See above for
more. `R` should be n x n and symmetric and non-negative definite
- `A::Matrix{Float64}` : The matrix that corresponds with the state in the
state space system. `A` should be n x n
- `B::Matrix{Float64}` : The matrix that corresponds with the control in the
state space system. `B` should be n x k
- `C::Matrix{Float64}` : The matrix that corresponds with the random process in
the state space system. `C` should be n x j
- `beta::Real` : The discount factor in the robust control problem
- `theta::Real` The robustness factor in the robust control problem
- `k, n, j::Int` : Dimensions of input matrices
"""
type RBLQ
A::Matrix
B::Matrix
C::Matrix
Q::Matrix
R::Matrix
k::Int
n::Int
j::Int
bet::Real
theta::Real
end
function RBLQ(Q::ScalarOrArray, R::ScalarOrArray, A::ScalarOrArray,
B::ScalarOrArray, C::ScalarOrArray, bet::Real, theta::Real)
k = size(Q, 1)
n = size(R, 1)
j = size(C, 2)
# coerce sizes
A = reshape([A;], n, n)
B = reshape([B;], n, k)
C = reshape([C;], n, j)
R = reshape([R;], n, n)
Q = reshape([Q;], k, k)
RBLQ(A, B, C, Q, R, k, n, j, bet, theta)
end
"""
The D operator, mapping P into
D(P) := P + PC(theta I - C'PC)^{-1} C'P.
##### Arguments
- `rlq::RBLQ`: Instance of `RBLQ` type
- `P::Matrix{Float64}` : `size` is n x n
##### Returns
- `dP::Matrix{Float64}` : The matrix P after applying the D operator
"""
function d_operator(rlq::RBLQ, P::Matrix)
C, theta, I = rlq.C, rlq.theta, eye(rlq.j)
S1 = P*C
dP = P + S1*((theta.*I - C'*S1) \ (S1'))
return dP
end
"""
The D operator, mapping P into
B(P) := R - beta^2 A'PB(Q + beta B'PB)^{-1}B'PA + beta A'PA
and also returning
F := (Q + beta B'PB)^{-1} beta B'PA
##### Arguments
- `rlq::RBLQ`: Instance of `RBLQ` type
- `P::Matrix{Float64}` : `size` is n x n
##### Returns
- `F::Matrix{Float64}` : The F matrix as defined above
- `new_p::Matrix{Float64}` : The matrix P after applying the B operator
"""
function b_operator(rlq::RBLQ, P::Matrix)
A, B, Q, R, bet = rlq.A, rlq.B, rlq.Q, rlq.R, rlq.bet
S1 = Q + bet.*B'*P*B
S2 = bet.*B'*P*A
S3 = bet.*A'*P*A
F = S1 \ S2
new_P = R - S2'*F + S3
return F, new_P
end
"""
Solves the robust control problem.
The algorithm here tricks the problem into a stacked LQ problem, as described in
chapter 2 of Hansen- Sargent's text "Robustness." The optimal control with
observed state is
u_t = - F x_t
And the value function is -x'Px
##### Arguments
- `rlq::RBLQ`: Instance of `RBLQ` type
##### Returns
- `F::Matrix{Float64}` : The optimal control matrix from above
- `P::Matrix{Float64}` : The positive semi-definite matrix defining the value
function
- `K::Matrix{Float64}` : the worst-case shock matrix `K`, where
`w_{t+1} = K x_t` is the worst case shock
"""
function robust_rule(rlq::RBLQ)
A, B, C, Q, R = rlq.A, rlq.B, rlq.C, rlq.Q, rlq.R
bet, theta, k, j = rlq.bet, rlq.theta, rlq.k, rlq.j
# Set up LQ version
I = eye(j)
Z = zeros(k, j)
Ba = [B C]
Qa = [Q Z
Z' -bet.*I.*theta]
lq = LQ(Qa, R, A, Ba, bet=bet)
# Solve and convert back to robust problem
P, f, d = stationary_values(lq)
F = f[1:k, :]
K = -f[k+1:end, :]
return F, K, P
end
"""
Solve the robust LQ problem
A simple algorithm for computing the robust policy F and the
corresponding value function P, based around straightforward
iteration with the robust Bellman operator. This function is
easier to understand but one or two orders of magnitude slower
than self.robust_rule(). For more information see the docstring
of that method.
##### Arguments
- `rlq::RBLQ`: Instance of `RBLQ` type
- `P_init::Matrix{Float64}(zeros(rlq.n, rlq.n))` : The initial guess for the
value function matrix
- `;max_iter::Int(80)`: Maximum number of iterations that are allowed
- `;tol::Real(1e-8)` The tolerance for convergence
##### Returns
- `F::Matrix{Float64}` : The optimal control matrix from above
- `P::Matrix{Float64}` : The positive semi-definite matrix defining the value
function
- `K::Matrix{Float64}` : the worst-case shock matrix `K`, where
`w_{t+1} = K x_t` is the worst case shock
"""
function robust_rule_simple(rlq::RBLQ,
P::Matrix=zeros(Float64, rlq.n, rlq.n);
max_iter=80,
tol=1e-8)
# Simplify notation
A, B, C, Q, R = rlq.A, rlq.B, rlq.C, rlq.Q, rlq.R
bet, theta, k, j = rlq.bet, rlq.theta, rlq.k, rlq.j
iterate, e = 0, tol + 1.0
F = similar(P) # instantiate so available after loop
while iterate <= max_iter && e > tol
F, new_P = b_operator(rlq, d_operator(rlq, P))
e = sqrt(sum((new_P - P).^2))
iterate += 1
copy!(P, new_P)
end
if iterate >= max_iter
warn("Maximum iterations in robust_rul_simple")
end
I = eye(j)
K = (theta.*I - C'*P*C)\(C'*P)*(A - B*F)
return F, K, P
end
"""
Compute agent 2's best cost-minimizing response `K`, given `F`.
##### Arguments
- `rlq::RBLQ`: Instance of `RBLQ` type
- `F::Matrix{Float64}`: A k x n array representing agent 1's policy
##### Returns
- `K::Matrix{Float64}` : Agent's best cost minimizing response corresponding to
`F`
- `P::Matrix{Float64}` : The value function corresponding to `F`
"""
function F_to_K(rlq::RBLQ, F::Matrix)
# simplify notation
R, Q, A, B, C = rlq.R, rlq.Q, rlq.A, rlq.B, rlq.C
bet, theta = rlq.bet, rlq.theta
# set up lq
Q2 = bet * theta
R2 = - R - F'*Q*F
A2 = A - B*F
B2 = C
lq = LQ(Q2, R2, A2, B2, bet=bet)
neg_P, neg_K, d = stationary_values(lq)
return -neg_K, -neg_P
end
"""
Compute agent 1's best cost-minimizing response `K`, given `F`.
##### Arguments
- `rlq::RBLQ`: Instance of `RBLQ` type
- `K::Matrix{Float64}`: A k x n array representing the worst case matrix
##### Returns
- `F::Matrix{Float64}` : Agent's best cost minimizing response corresponding to
`K`
- `P::Matrix{Float64}` : The value function corresponding to `K`
"""
function K_to_F(rlq::RBLQ, K::Matrix)
R, Q, A, B, C = rlq.R, rlq.Q, rlq.A, rlq.B, rlq.C
bet, theta = rlq.bet, rlq.theta
A1, B1, Q1, R1 = A+C*K, B, Q, R-bet*theta.*K'*K
lq = LQ(Q1, R1, A1, B1, bet=bet)
P, F, d = stationary_values(lq)
return F, P
end
"""
Given `K` and `F`, compute the value of deterministic entropy, which is sum_t
beta^t x_t' K'K x_t with x_{t+1} = (A - BF + CK) x_t.
##### Arguments
- `rlq::RBLQ`: Instance of `RBLQ` type
- `F::Matrix{Float64}` The policy function, a k x n array
- `K::Matrix{Float64}` The worst case matrix, a j x n array
- `x0::Vector{Float64}` : The initial condition for state
##### Returns
- `e::Float64` The deterministic entropy
"""
function compute_deterministic_entropy(rlq::RBLQ, F, K, x0)
B, C, bet = rlq.B, rlq.C, rlq.bet
H0 = K'*K
C0 = zeros(Float64, rlq.n, 1)
A0 = A - B*F + C*K
return var_quadratic_sum(A0, C0, H0, bet, x0)
end
"""
Given a fixed policy `F`, with the interpretation u = -F x, this function
computes the matrix P_F and constant d_F associated with discounted cost J_F(x) =
x' P_F x + d_F.
##### Arguments
- `rlq::RBLQ`: Instance of `RBLQ` type
- `F::Matrix{Float64}` : The policy function, a k x n array
##### Returns
- `P_F::Matrix{Float64}` : Matrix for discounted cost
- `d_F::Float64` : Constant for discounted cost
- `K_F::Matrix{Float64}` : Worst case policy
- `O_F::Matrix{Float64}` : Matrix for discounted entropy
- `o_F::Float64` : Constant for discounted entropy
"""
function evaluate_F(rlq::RBLQ, F::Matrix)
R, Q, A, B, C = rlq.R, rlq.Q, rlq.A, rlq.B, rlq.C
bet, theta, j = rlq.bet, rlq.theta, rlq.j
# Solve for policies and costs using agent 2's problem
K_F, P_F = F_to_K(rlq, F)
I = eye(j)
H = inv(I - C'*P_F*C./theta)
d_F = log(det(H))
# compute O_F and o_F
sig = -1.0 / theta
AO = sqrt(bet) .* (A - B*F + C*K_F)
O_F = solve_discrete_lyapunov(AO', bet*K_F'*K_F)
ho = (trace(H - 1) - d_F) / 2.0
tr = trace(O_F*C*H*C')
o_F = (ho + bet*tr) / (1 - bet)
return K_F, P_F, d_F, O_F, o_F
end
```

Here is a brief description of the methods of the type

`d_operator()`

and`b_operator()`

implement \(\mathcal D\) and \(\mathcal B\) respectively`robust_rule()`

and`robust_rule_simple()`

both solve for the triple \(\hat F, \hat K, \hat P\), as described in equations (7) – (8) and the surrounding discussion`robust_rule()`

is more efficient`robust_rule_simple()`

is more transparent and easier to follow

`K_to_F()`

and`F_to_K()`

solve the decision problems of agent 1 and agent 2 respectively`compute_deterministic_entropy()`

computes the left-hand side of (13)`evaluate_F()`

computes the loss and entropy associated with a given policy — see this discussion

## Application¶

Let us consider a monopolist similar to this one, but now facing model uncertainty

The inverse demand function is \(p_t = a_0 - a_1 y_t + d_t\)

where

and all parameters are strictly positive

The period return function for the monopolist is

Its objective is to maximize expected discounted profits, or, equivalently, to minimize \(\mathbb E \sum_{t=0}^\infty \beta^t (- r_t)\)

To form a linear regulator problem, we take the state and control to be

Setting \(b := (a_0 - c) / 2\) we define

For the transition matrices we set

Our aim is to compute the value-entropy correspondences shown above

The parameters are

The standard normal distribution for \(w_t\) is understood as the agent’s baseline, with uncertainty parameterized by \(\theta\)

We compute value-entropy correspondences for two policies

- The no concern for robustness policy \(F_0\), which is the ordinary LQ loss minimizer
- A “moderate” concern for robustness policy \(F_b\), with \(\theta = 0.02\)

The code for producing the graph shown above, with blue being for the robust policy, is given in robustness/robust_monopolist.jl

We repeat it here for convenience

```
#=
The robust control problem for a monopolist with adjustment costs. The
inverse demand curve is:
p_t = a_0 - a_1 y_t + d_t
where d_{t+1} = \rho d_t + \sigma_d w_{t+1} for w_t ~ N(0,1) and iid.
The period return function for the monopolist is
r_t = p_t y_t - gam (y_{t+1} - y_t)^2 / 2 - c y_t
The objective of the firm is E_t \sum_{t=0}^\infty \beta^t r_t
For the linear regulator, we take the state and control to be
x_t = (1, y_t, d_t) and u_t = y_{t+1} - y_t
@author : Spencer Lyon <spencer.lyon@nyu.edu>
@date : 2014-07-05
References
----------
Simple port of the file examples/robust_monopolist.py
http://quant-econ.net/robustness.html#application
=#
using QuantEcon
using Plots
pyplot()
using Grid
# model parameters
a_0 = 100
a_1 = 0.5
rho = 0.9
sigma_d = 0.05
bet = 0.95
c = 2
gam = 50.0
theta = 0.002
ac = (a_0 - c) / 2.0
# Define LQ matrices
R = [0 ac 0
ac -a_1 0.5
0. 0.5 0]
R = -R # For minimization
Q = [gam / 2.0]'
A = [1. 0. 0.
0. 1. 0.
0. 0. rho]
B = [0. 1. 0.]'
C = [0. 0. sigma_d]'
## Functions
function evaluate_policy(theta, F)
rlq = RBLQ(Q, R, A, B, C, bet, theta)
K_F, P_F, d_F, O_F, o_F = evaluate_F(rlq, F)
x0 = [1.0 0.0 0.0]'
value = - x0'*P_F*x0 - d_F
entropy = x0'*O_F*x0 + o_F
return value[1], entropy[1] # return scalars
end
function value_and_entropy(emax, F, bw, grid_size=1000)
if lowercase(bw) == "worst"
thetas = 1 ./ linspace(1e-8, 1000, grid_size)
else
thetas = -1 ./ linspace(1e-8, 1000, grid_size)
end
data = Array(Float64, grid_size, 2)
for (i, theta) in enumerate(thetas)
data[i, :] = collect(evaluate_policy(theta, F))
if data[i, 2] >= emax # stop at this entropy level
data = data[1:i, :]
break
end
end
return data
end
## Main
# compute optimal rule
optimal_lq = LQ(Q, R, A, B, C, zero(B'A), bet)
Po, Fo, Do = stationary_values(optimal_lq)
# compute robust rule for our theta
baseline_robust = RBLQ(Q, R, A, B, C, bet, theta)
Fb, Kb, Pb = robust_rule(baseline_robust)
# Check the positive definiteness of worst-case covariance matrix to
# ensure that theta exceeds the breakdown point
test_matrix = eye(size(Pb, 1)) - (C' * Pb * C ./ theta)[1]
eigenvals, eigenvecs = eig(test_matrix)
@assert all(eigenvals .>= 0)
emax = 1.6e6
# compute values and entropies
optimal_best_case = value_and_entropy(emax, Fo, "best")
robust_best_case = value_and_entropy(emax, Fb, "best")
optimal_worst_case = value_and_entropy(emax, Fo, "worst")
robust_worst_case = value_and_entropy(emax, Fb, "worst")
# we reverse order of "worst_case"s so values are ascending
data_pairs = ((optimal_best_case, optimal_worst_case),
(robust_best_case, robust_worst_case))
egrid = linspace(0, emax, 100)
egrid_data = Array{Float64}[]
for data_pair in data_pairs
for data in data_pair
x, y = data[:, 2], data[:, 1]
curve(z) = InterpIrregular(x, y, BCnearest, InterpLinear)[z]
push!(egrid_data, curve(egrid))
end
end
plot(egrid, egrid_data, color=[:red :red :blue :blue])
plot!(egrid, egrid_data[1], fillrange=egrid_data[2],
fillcolor=:red, fillalpha=0.1, color=:red, legend=:none)
plot!(egrid, egrid_data[3], fillrange=egrid_data[4],
fillcolor=:blue, fillalpha=0.1, color=:blue, legend=:none)
plot!(xlabel="Entropy", ylabel="Value")
```

Here’s another such figure, with \(\theta = 0.002\) instead of \(0.02\)

Can you explain the different shape of the value-entropy correspondence for the robust policy?

## Appendix¶

We sketch the proof only of the first claim in this section, which is that, for any given \(\theta\), \(K(\hat F, \theta) = \hat K\), where \(\hat K\) is as given in (8)

This is the content of the next lemma

**Lemma.** If \(\hat P\) is the fixed point of the map \(\mathcal B \circ \mathcal D\) and \(\hat F\) is the robust policy as given in (7), then

*Proof:* As a first step, observe that when \(F = \hat F\), the Bellman equation associated with the LQ problem (11) – (12) is

(revisit this discussion if you don’t know where (29) comes from) and the optimal policy is

Suppose for a moment that \(- \hat P\) solves the Bellman equation (29)

In this case the policy becomes

which is exactly the claim in (28)

Hence it remains only to show that \(- \hat P\) solves (29), or, in other words,

Using the definition of \(\mathcal D\), we can rewrite the right-hand side more simply as

Although it involves a substantial amount of algebra, it can be shown that the latter is just \(\hat P\)

(Hint: Use the fact that \(\hat P = \mathcal B( \mathcal D( \hat P))\))