Earlier we established that the quantilal policy can be computed in polynomial time to any given approximation (see "Proposition 5"). Now we show that an exact quantilal policy can be computed in polynomial time (in particular there is always a rational quantilal policy).

We assume geometric time discount throughout.

Lemma

Consider $ξ \in Δ S$ . Define the linear operators $E : R^{S \times A} \to R^{S}$ and $T : R^{S \times A} \to R^{S}$ by

$E_{t, s a} := [[t = s]]$

$T_{t, s a} := T (t | s, a)$

(Note that this $T$ is the transpose of the $T$ defined in "Proposition A.3" of the previous essay.)

Then, $ξ \in Im Z$ if and only if there is $ϕ \in Δ (S \times A)$ s.t.

$E ϕ = ξ$

$(E - λ T) ϕ = (1 - λ) ζ_{0}$

Proof

(This is actually well known, but we spell out the proof to be self-contained.)

Suppose that $ξ \in Im Z$ . We already know that this implies that there is a stationary policy $π : S k \to A$ s.t. $Z π = ξ$ (we abuse notation in the obvious way): see the proofs of "Proposition 2" and "Proposition 3". Define the linear operator $T^{π} : R^{S} \to R^{S}$ by

$T_{t s}^{π} := E a \sim π (s) [T (t | s, a)]$

It follows that

$ξ = (1 - λ) \infty \sum n = 0 λ^{n} T^{π n} ζ_{0} = (1 - λ) {(1 - λ T^{π})}^{- 1} ζ_{0}$

$(1 - λ T^{π}) ξ = (1 - λ) ζ_{0}$

Define $ϕ$ by

$ϕ (s, a) := ξ (s) π (a ∣ s)$

We have

$T^{π} ξ = \sum s \in S E a \sim π (s) [T (s, a)] ξ (s) = \sum \begin{matrix} s \in S a \in A \end{matrix} π (a ∣ s) T (s, a) ξ (s) = \sum \begin{matrix} s \in S a \in A \end{matrix} T (s, a) ϕ (s, a) = T ϕ$

Also, obviously $E ϕ = ξ$ . We get

$(E - λ T) ϕ = ξ - λ T^{π} ξ = (1 - λ T^{π}) ξ = (1 - λ) ζ_{0}$

Conversely, suppose that $ϕ$ is as above. Since $E ϕ = ξ$ , there is $π : S k \to A$ s.t. for any $s \in S$ , if $ξ (s) \neq 0$ then

$π (a ∣ s) = \frac{ϕ (s, a)}{ξ (s)}$

Again, we have

$Z π = (1 - λ) {(1 - λ T^{π})}^{- 1} ζ_{0}$

Also, for the same reason as before

$(E - λ T) ϕ = (1 - λ T^{π}) ξ$

By the assumption, the left hand side equals $(1 - λ) ζ_{0}$ . We conclude

$ξ = (1 - λ) {(1 - λ T^{π})}^{- 1} ζ_{0} = Z π$

Theorem

Assuming all parameters are rational like before, there is a polynomial time algorithm that computes a quantilal policy.

Proof

The algorithm starts by solving the following linear program. The indeterminates are $ϕ \in R^{S \times A}$ and $QV \in R$ . The goal is maximizing $QV$ . The constraints are

$\forall s \in S, a \in A : ϕ (s, a) \geq 0$

$\sum \begin{matrix} s \in S a \in A \end{matrix} ϕ (s, a) = 1$

$(E - λ T) ϕ = (1 - λ) ζ_{0}$

$\forall s \in S ∖ supp Z σ, a \in A : ϕ (s, a) = 0$

$\forall s \in supp Z σ : QV \leq \sum t \in S R (t) \sum a \in A ϕ (t, a) - \frac{η}{Z σ (s)} \sum a \in A ϕ (s, a)$

Then, the algorithm computes $π : S k \to A$ s.t. for any $s \in S$ , if $\sum_{b \in A} ϕ (s, b) > 0$ then

$π (a ∣ s) := \frac{ϕ (s, a)}{\sum_{b \in A} ϕ (s, b)}$

For $s \in S$ s.t. $\sum_{b \in A} ϕ (s, b) = 0$ , $π (s)$ is arbitrary.

Now we need to explain why this algorithm is correct.

Observe that, the first 3 constraints mean that $ξ \in R^{S}$ defined by $ξ (s) := \sum_{b \in A} ϕ (s, b)$ lies in $Im Z$ (by Lemma 1) and, moreover, $ϕ (s, a) = ξ (s) π (a ∣ s)$ for $π : S k \to A$ s.t. $ξ = Z π$ . It remains to show that the linear program amounts to maximizing $E ξ [R] - η exp D_{\infty} (ξ | | Z σ)$ inside $Im Z$ . Indeed, the 4th constraint just

...

Quantilization

See also