---
title: Sound Value Iteration (SVI)
url: https://www.emergentmind.com/topics/sound-value-iteration-svi
type: topic
---

# Sound Value Iteration (SVI)

Sound Value Iteration (SVI) denotes value-iteration procedures that compute sound lower and upper bounds for quantitative verification and planning objectives, most prominently unbounded reachability probabilities and expected rewards. Unlike classical value iteration, which approximates a fixed point from below and does not provide a sound stopping criterion, SVI maintains certified brackets and terminates once the gap satisfies a prescribed precision bound. The term appears in several closely related settings: Markov chains and MDPs [1804.05001], simple stochastic games and MDPs with end components [2411.11549], [2509.14112], and trial-based heuristic search value iteration for the indefinite-horizon maximal reachability probability problem in POMDPs [2406.02871].

## 1. Formal setting and fixed-point semantics

In the original probabilistic model-checking setting, a finite Markov chain is a tuple \((S,P,s_I)\) with finite state set \(S\), initial state \(s_I\in S\), transition matrix \(P\colon S\times S\to[0,1]\), and a set of target states \(G\subseteq S\). For \(k\in\mathbb N\cup\{\infty\}\), the step-bounded and unbounded reachability probabilities are
\[
\mathsf{Reach}^{\le k}_s(G)
=\Pr_{\,s}\bigl(\text{reach }G\text{ in at most }k\text{ steps}\bigr),
\qquad
\mathsf{Reach}_s(G)=\lim_{k\to\infty}\mathsf{Reach}^{\le k}_s(G).
\]
For MDPs, maximum reachability is
\[
\mathsf{Reach}^{\max}_s(G)=\sup_{\sigma}\Pr^\sigma_s(\diamond G).
\]
Standard value iteration approximates the least fixed-point of
\[
f(x)_s=\sum_{t}P(s,t)x_t,\quad x|_{G}=1,\;x|_{S\setminus G}=0
\]
from below; for MDPs the matrix-vector product is replaced by a Bellman backup \(\max_{\alpha}\sum_tP(s,\alpha,t)\cdot x_t\) [1804.05001].

The same fixed-point perspective persists in later SVI variants. In simple stochastic games, the reachability value is
\[
V(s)\;=\;\sup_{\sigma}\,\inf_{\tau}\;P_s^{\sigma,\tau}\bigl(\lozenge F\bigr)\;=\;\inf_{\tau}\,\sup_{\sigma}\;P_s^{\sigma,\tau}(\lozenge F),
\]
and classical VI computes lower approximations by alternating \(\max\) and \(\min\) Bellman updates depending on state ownership [2411.11549]. In the POMDP MRPP setting, the belief-space Bellman operator is
\[
Q(b,a)
\;=\;
R(b,a)\;+\;\sum_{o\in\Omega}P(o\mid b,a)\;V\!\bigl(b_a^o\bigr),
\qquad
[\B V](b)
= \max_{a\in A} Q(b,a),
\]
with the unique fixed point \(V^*\) satisfying \(V^*(b_0)=\max_\pi P^\pi(\lozenge T)\) [2406.02871].

This common fixed-point structure explains why SVI is best understood as a soundification of value iteration rather than as a single model-specific algorithm. The core design question is how to preserve monotone lower approximations while also deriving safe upper approximations that support a valid stopping rule.

## 2. Original SVI for Markov chains and MDPs

The 2018 formulation of SVI was presented as an alternative to interval iteration that “does not require the a priori computation of starting vectors” [1804.05001]. Its key decomposition for Markov chains is
\[
\mathsf{Reach}(G)
=\underbrace{\Pr(\diamond^{\le k}G)}_{x_k}
+\underbrace{\Pr(\text{stay in }S\setminus G\text{ for }k\text{ steps})}_{y_k}\;
\underbrace{\Pr_{\min/\max}(G)}_{\text{unknown remainder}}.
\]
Here \(x_k(s)=\Pr_s(\diamond^{\le k}G)\) is obtained by \(k\) iterations of \(f\) from the zero vector, while \(y_k(s)=\Pr_s(\text{no }G\text{ in }\le k\text{ steps})\) is obtained by \(k\) iterations of
\[
h(y)_s=\sum_tP(s,t)\,y_t
\]
from the all-ones vector [1804.05001].

As soon as \(y_k(s)<1\) for all \(s\notin G\), SVI derives local ratio bounds
\[
\forall s\colon\quad
\frac{x_k(s)}{1-y_k(s)}\;\le\;\mathsf{Reach}_s(G)
\;\le\;\max_{t}\frac{x_k(t)}{1-y_k(t)},
\]
and therefore defines
\[
\ell_k=\min_{s\notin G}\frac{x_k(s)}{1-y_k(s)},\qquad
u_k=\max_{s\notin G}\frac{x_k(s)}{1-y_k(s)}.
\]
This yields the sound bracket
\[
x_k + y_k\ell_k
\;\le\;\mathsf{Reach}(G)\;\le\;x_k + y_k u_k.
\]
The stopping criterion
\[
y^k_{s_I}\,(U_k - L_k)\;<\;2\,\varepsilon
\]
guarantees final error at most \(\varepsilon\) [1804.05001].

The algorithmic presentation in the same work precomputes
\[
S_0=\{s\mid\Pr_s(G)=0\},\qquad
G_1=G\cup\{s\mid\Pr_s(G)=1\},\qquad
Q=S\setminus(S_0\cup G_1),
\]
initializes \(x^0\), \(y^0\), and iteratively updates \(\ell\) and \(u\) by
\[
\ell\gets\max\!\Bigl(\ell,\;\min_{s\in Q}\tfrac{x^k_s}{1-y^k_s}\Bigr),\qquad
u\gets\min\!\Bigl(u,\;\max_{s\in Q}\tfrac{x^k_s}{1-y^k_s}\Bigr)
\]
once \(\max_{s\in Q}y^k_s<1\) [1804.05001].

For MDPs, the same paper states that one replaces the matrix-vector product by a Bellman backup and maintains “a scheduler” choice that maximizes the combined local bound at each iteration, plus “a small linear program to tighten the upper bound without violating optimality of that choice” [1804.05001]. A common misconception is to equate SVI with interval iteration. The original construction is explicitly different: its upper and lower bounds are derived on the fly from the current iterates rather than supplied a priori.

## 3. Soundness, convergence, and expected rewards

The central invariant of SVI is the maintenance of a sound bracket. In the Markov-chain formulation, once \(y^k_s<1\) for all \(s\in Q\), defining
\[
L_k=\min_{s\in Q}\frac{x^k_s}{1-y^k_s},\qquad
U_k=\max_{s\in Q}\frac{x^k_s}{1-y^k_s}
\]
implies
\[
x^k_{s_I} + y^k_{s_I}L_k\;\le\;\Pr_{s_I}(G)\;\le\;
x^k_{s_I} + y^k_{s_I}U_k.
\]
As \(k\to\infty\), \(y^k\to0\) on the set of states from which \(G\) is (almost) surely reached, and the bracket width \(y^k_{s_I}(U_k-L_k)\to0\) [1804.05001].

The computational profile of the original algorithm is correspondingly simple. Each iteration costs one sparse-matrix-vector multiply for \(x\) and one for \(y\), for total \(O(|E|)\), plus an \(O(|S|)\) scan to recompute \(\ell\) and \(u\). The same source reports that SVI “often needs far fewer iterations than interval iteration because its local bounds \(\tfrac{x^k_s}{1-y^k_s}\) typically converge quickly to the actual \(\Pr_s(G)\), whereas interval iteration uses global worst–best initial bounds (0 and 1) and thus wastes many iterations shrinking a large gap” [1804.05001].

The extension to expected rewards follows the same decomposition principle. If each MC state \(s\) carries reward \(r(s)\) and the objective is expected total reward until hitting \(G\), then
\[
g(x)_s=\begin{cases}
0 & s\in G,\\
r(s)\;+\;\sum_tP(s,t)\,x_t & s\notin G
\end{cases}
\]
and the remainder is bounded by
\[
\min_s\frac{g^k(0)_s}{1-y^k_s}\le\mathbb E_s\le\max_s\frac{g^k(0)_s}{1-y^k_s}.
\]
The abstract of the original paper states that “lifting this technique to expected rewards is trivial for both Markov chains and MDPs” [1804.05001].

These results situate SVI within fixed-point verification rather than purely numerical approximation. The lower sequence remains monotone, the upper sequence remains sound, and the termination test is tied directly to a certified residual quantity instead of to a heuristic difference between successive iterates.

## 4. End components, stochastic games, and geometric-series acceleration

Later work extended SVI beyond the original Markov-chain and MDP setting. The 2024 and 2025 papers titled “Sound Value Iteration for Simple Stochastic Games” state that SVI had not been applicable to simple stochastic games, nor to MDPs with end components, and that the main technical challenge is the proper treatment of end components [2411.11549], [2509.14112].

In the SG formulation, SVI maintains step-bounded reach and stay probabilities. For a fixed strategy pair \((\sigma,\tau)\),
\[
\rho_k^{\sigma,\tau}(s)\;=\;P_s^{\sigma,\tau}(\lozenge^{\le k}F),\quad
\sigma_k^{\sigma,\tau}(s)\;=\;P_s^{\sigma,\tau}\bigl(\square^{\le k}(S\setminus(F\cup Z))\bigr),
\]
yielding bounds of the form
\[
\rho_k(s)\;+\;\sigma_k(s)\,l_k \;\le\;V(s)\;\le\;
\rho_k(s)\;+\;\sigma_k(s)\,u_k.
\]
The associated pseudocode in the 2025 account uses arrays \(pF\) and \(pX\), updates strategies to optimize \(pF[\,\cdot\,]+pX[\,\cdot\,]\cdot U\) for the Maximizer and \(pF[\,\cdot\,]+pX[\,\cdot\,]\cdot L\) for the Minimizer, and then tightens
\[
L\leftarrow \max\!\Bigl(L,\min_{s\in X}\frac{pF[s]}{1-pX[s]}\Bigr),\qquad
U\leftarrow \min\!\Bigl(U,\max_{s\in X}\frac{pF[s]}{1-pX[s]}\Bigr)
\]
once all \(pX[s]<1\) [2509.14112].

The distinctive claim of this extension is that SVI “exploits a geometric-series argument to handle probabilistic loops in a sound and often faster way” [2509.14112]. The complication is that end components create sure cycles, so basic upper-bound updates may stall. The 2024 presentation states that, because of non-determinism, one cannot simply set
\[
\mathsf b_k=\max_{s'}\frac{\rho_k(s')}{1-\sigma_k(s')},
\]
and therefore introduces “decision values” to preserve monotonicity of the chosen action [2411.11549].

The mechanism for end components combines two ideas. First, a recursive \(\mathit{BestExitSet}(Y,f)\) procedure collects best exits of an end component \(Y\) with respect to a current over-approximation \(f\ge V\); trap end components with no Maximizer exit are absorbed into the sink set \(Z\) [2411.11549]. Second, a phantom “delay” action \(d\) preserves \((pF,pX)\) whenever every real action would worsen the local bound \(U(s)\), so that over-approximations become monotone non-increasing [2509.14112]. Both papers also describe topological or SCC-based variants that maintain local bounds per strongly-connected component and freeze an SCC once its lower and upper bounds coincide [2411.11549], [2509.14112].

A plausible implication is that the SG/EC extensions shift SVI from a purely global bracketing scheme to one that must explicitly control local strategy choices inside cyclic structures. The formal motivation given in the sources is exactly that end components admit multiple fixpoints for the upper iteration and therefore require additional structure beyond the original ratio bound.

## 5. Trial-based heuristic-search SVI for undiscounted POMDPs

The 2024 paper “Sound Heuristic Search Value Iteration for Undiscounted POMDPs with Reachability Objectives” studies the indefinite-horizon maximal reachability probability problem in POMDPs [2406.02871]. A POMDP is given as
\[
(S,A,\Omega,T,Z,b_0),
\]
where \(S\) is a finite set of hidden states, \(A\) a finite set of actions, \(\Omega\) a finite set of observations, \(T(s,a,s')\) the transition kernel, \(Z(s',a,o)\) the observation kernel, and \(b_0\in\Delta(S)\) the initial belief. After action \(a\) and observation \(o\), the posterior belief is
\[
b_a^o(s')
=\frac{Z(s',a,o)\,\sum_{s\in S} T(s,a,s')\,b(s)}
{\sum_{s''} Z(s'',a,o)\,\sum_{s} T(s,a,s'')\,b(s)}.
\]
With target set \(T\subseteq S\), reachability reward
\[
R_{\rm rp}(s,a)=
\begin{cases}
1 & s\in T,\ \text{and one transitions into an absorbing target},\\
0 & \text{otherwise,}
\end{cases}
\]
and \(\gamma=1\), the expected cumulative reward equals the probability of eventually reaching \(T\):
\[
V^\pi(b_0)
=
\EE\Bigl[\sum_{t=0}^\infty R_{\rm rp}(b_t,\pi(b_t))\Bigm|\;b_0,\pi\Bigr]
=
P^\pi_{\M}(\lozenge T).
\]
The objective is an \(\epsilon\)-optimal policy \(\hat\pi\) such that
\[
P^{\pi^*}(\lozenge T)\;-\;P^{\hat\pi}(\lozenge T)\;\le\;\epsilon
\]
[2406.02871].

SVI in this setting maintains two-sided bounds
\[
L(b)\le V^*(b)\le U(b).
\]
The lower bound is represented by a finite set \(\Gamma\) of \(\alpha\)-vectors,
\[
L(b)=\max_{\alpha\in\Gamma}\alpha^\top b,
\]
seeded initially by “blind-policy” vectors or by a small finite-horizon rollout. The upper bound is represented by a point set \(\Upsilon\subseteq B\times[0,1]\),
\[
U(b)=\hull_{\Upsilon}(b),
\]
seeded by the fully-observable MDP solution \(V_{\rm MDP}\) at the simplex corners. Local Bellman backups update both sides:
\[
L'(b)
= \max_a\Bigl\{R(b,a)+\sum_oP(o\mid b,a)\,L(b_a^o)\Bigr\},\qquad
U'(b)
= \max_a\Bigl\{R(b,a)+\sum_oP(o\mid b,a)\,U(b_a^o)\Bigr\}.
\]
Soundness is immediate by monotonicity of \(\B\) and the fact that the initial seeds satisfy \(L\le V^*\le U\) [2406.02871].

The search procedure builds a directed belief-graph \(G\) rooted at \(b_0\). Each trial is a depth-first walk from \(b_0\) of maximum length \(d_{\rm trial}\). At a visited node \(b\), action selection first forms
\[
A_{\rm cand}=\{\,a:\,U(b,a)\ge \max_{a'}U(b,a')- \xi\},
\]
then selects a UCB action
\[
a^*
=\arg\max_{a\in A_{\rm cand}}
\Bigl\{
U(b,a)
+
c_a\sqrt{\frac{N(b)}{1+N(b,a)}}
\Bigr\}.
\]
Observation selection uses weighted excess uncertainty:
\[
WEU(b,t)= U(b)-L(b)-\epsilon,
\qquad
h_o
=P(o\mid b,a^*)\,WEU(b_a^o,t+1)
+
c_z\sqrt{\frac{N(b,a^*)}{1+N(b_a^o)}}.
\]
The algorithm chooses the maximizing \(o^*\) while avoiding beliefs already visited on the current trial, expands the resulting successor if new, increments counts, and backtracks with local lower- and upper-bound backups [2406.02871].

The indefinite horizon introduces loops. The paper states that “the belief-tree is in fact a DAG with possible cycles,” so SVI merges duplicate beliefs into a single node in \(G\). During a trial, observations leading to already-visited nodes are disallowed. In addition, local upper-bound backups may stall in the undiscounted setting because of an “end-component issue.” To guarantee improvability of \(U\), every \(K\) trials the algorithm freezes frontier nodes at their hull-values and runs a full value iterate on the finite graph \(G\) until the least fixed point is reached; this “strictly decreases upper bounds inside each strongly-connected component” [2406.02871].

The convergence statement is correspondingly conditional: under the assumption that an optimal belief-based policy can be implemented with finite memory, the lower bound \(L_n(b_0)\) after \(n\) trials converges from below to \(V^*(b_0)\),
\[
\lim_{n\to\infty} \bigl[V^*(b_0)\;-\;L_n(b_0)\bigr]=0.
\]
Per trial, the stated complexity is
\[
O\bigl(d_{\rm trial}\times|\!A|\times|\Omega|\bigr),
\]
while every \(K\) trials a global exact VI on \(|G|\) nodes costs
\[
O\bigl(|G|\,|A|\,|\Omega|\bigr)
\]
[2406.02871].

## 6. Empirical behavior, adjacent methods, and interpretation

The reported empirical results consistently portray SVI as a sound alternative to plain VI that is often particularly effective on probabilistic cycles. The following summary reproduces the settings and headline findings reported in the cited sources.

| Source | Setting | Reported findings |
|---|---|---|
| [1804.05001] | Storm; 130 benchmarks; \(\varepsilon=10^{-6}\) | “often 20 % fewer”; “on average ~20 % faster” |
| [2509.14112] | SG/MDP cyclic examples | retention loop \(p=0.98\): “BVI: 682 iterations; SVI: 1 iteration”; small SG: “BVI: 685 iterations; SVI: 2 iterations” |
| [2406.02871] | MRPP POMDP benchmarks | \(U-L<10^{-3}\); “\(10\times\) fewer beliefs”; “\(5–50\times\) faster on large grids” |

In the original 2018 evaluation, SVI was implemented in the Storm model checker and tested on “130 benchmarks (PRISM MCs/MDPs, CTMCs, Markov automata, multi-objective queries).” Compared against classical interval iteration, with and without Gauss–Seidel or topological SCC optimizations, SVI “consistently required fewer iterations (often 20 % fewer) and was on average ~20 % faster” [1804.05001]. The 2025 SG paper reports particularly strong improvements on cyclic examples: for a “Markov chain with retention loop \(p=0.98\),” bounded VI required 682 iterations while SVI required 1 iteration, and on a “Small SG example” bounded VI required 685 iterations while SVI required 2 iterations [2509.14112]. In the POMDP MRPP benchmarks, the 2024 trial-based method is reported to achieve two-sided bounds \([L(b_0),U(b_0)]\) with \(U-L<10^{-3}\), expand \(10\times\) fewer beliefs than breadth-first methods, run \(5–50\times\) faster on large grids, and converge in all benchmarks to the best known reachability probability while providing a rigorous \(\epsilon\)-certificate \(U(b_0)-L(b_0)\le\epsilon\) [2406.02871].

SVI also sits within a broader family of sound VI procedures. A closely related but distinct method is Optimistic Value Iteration (OVI), which obtains a lower bound via standard VI, guesses an upper bound by setting \(u(s)=v(s)(1+\epsilon)\) for relative error or \(u(s)=v(s)+\epsilon\) for absolute error, and then verifies the guess using Park induction: if \(\Phi(u)\le u\), then the least fixed point lies below \(u\) [1910.01100]. This comparison matters because it corrects another common conflation: SVI and OVI are both sound variants of value iteration, but they use different upper-bound mechanisms. The original SVI derives local bounds from the current iterates without requiring a priori start vectors [1804.05001], whereas OVI explicitly “guess[es]” an upper bound and proves its correctness afterward [1910.01100].

Taken together, the literature presents SVI as a sequence of increasingly specialized sound fixed-point algorithms. The invariant \(L\le V\le U\) is shared across formulations, but the technical machinery varies with the model class: on-the-fly ratio bounds in Markov chains and MDPs, best-exit recursion and delay actions in stochastic games with end components, and \(\alpha\)-vector/hull representations with trial-based graph search in undiscounted POMDP reachability. This suggests that “SVI” is best read as a methodological pattern—sound bracketing around value iteration—whose concrete realization depends on the structure of the underlying stochastic model.

Source: https://www.emergentmind.com/topics/sound-value-iteration-svi