---
title: Ball-Shaped Ambiguity Sets
url: https://www.emergentmind.com/topics/ball-shaped-ambiguity-sets
type: topic
---

# Ball-Shaped Ambiguity Sets

Searching arXiv for recent and relevant papers on ball-shaped ambiguity sets to ground the article.
Ball-shaped ambiguity sets are uncertainty regions defined by a radius constraint around a nominal object, but the ambient space in which the “ball” is drawn varies by problem class. In distributionally robust control, the ball may be centered at a nominal mean–covariance pair; in robust MDPs, it is often an \(L_1\)-ball in the probability simplex around a nominal transition law; in kernel methods, it is an MMD ball in an RKHS over embedded distributions; in PDE-based uncertainty propagation, it is frequently a Wasserstein ball around an empirical distribution; and in infinite-dimensional probability theory, it can denote a translate of a fixed-radius ball with maximal probability content. Across these settings, the common role of the ball is to parameterize uncertainty by a center, a radius, and a geometry, thereby converting poorly specified distributional uncertainty into a tractable design variable or a measurable uncertainty region [2512.10906].

## 1. Geometric forms and ambient spaces

The expression “ball-shaped ambiguity set” is not tied to a single metric or representation. What is shared is a constraint of the form “distance to a nominal object is bounded,” where the nominal object may be a probability distribution, a moment pair, an embedded measure, or a geometric center, and the distance may be induced by a norm, a divergence, or an RKHS metric.

| Setting | Representative ball constraint | Representative use |
|---|---|---|
| Moment-based control | \( \|\mu-\bar\mu\|_2^2\le r_1,\ \|\Sigma-\bar\Sigma\|_p\le r_2 \) | Distributionally robust regret-optimal control |
| Robust MDPs | \( \{p\in\Delta^S:\|p-\bar p_{s,a}\|_1\le \psi_{s,a}\} \) | Safe policy evaluation and synthesis |
| Gaussian planning | \( \|\mu_{\mathbb P}-\hat\mu\|_2 + c\sqrt{\lambda_{\max}(\Sigma_{\mathbb P})}\le \hat r \) | Chance-constrained reachability to a Euclidean ball |
| Kernel dynamics | \( \{\mu: MMD(\mu,\hat\mu)\le \rho\} \) | Multistep ambiguity propagation in RKHS |
| PDE uncertainty propagation | \( \{F: W_1(\widehat F,F)\le \rho\} \) | Data-driven ambiguity propagation under hyperbolic dynamics |
| Banach-space maximal balls | \( B_r(x_0)=x_0+B_r \) maximizing \(\mu(B_r(x))\) | Fixed-shape sets of maximal probability |

This taxonomy indicates that ball geometry is often chosen to match the representation used by the underlying model. In moment-based DRO, the geometry is over first and second moments; in robust RL, over transition probabilities; in kernelized dynamics, over kernel mean embeddings; and in probabilistic planning, over coupled mean–covariance descriptions of Gaussian beliefs. This suggests that “ball-shaped” is best understood as a structural template rather than a commitment to Euclidean balls in state space [1902.07605] [2510.04807] [2304.14057] [2003.06735] [2309.02846].

## 2. Moment balls in distributionally robust control

A recent control-theoretic formulation studies finite-horizon, linear-quadratic stochastic control when the disturbance distribution is unknown but its mean and covariance are only known approximately. The disturbance trajectory is stacked as \(w=(x_0,w_0,\dots,w_{T-1})\in\mathbb R^n\), the dynamics admit the compact representation \(x=Fu+Gw\), and the quadratic cost is
\[
J(u,w)=x^\top Qx+u^\top Ru,
\]
with \(Q\succeq 0\) and \(R\succ 0\). The controller class is strictly causal affine disturbance-feedback,
\[
u=\phi(w)=Kw+v,
\]
with \(K\) block lower triangular in the appropriate strictly causal sense. The regret is measured relative to the best noncausal controller \(o(w)=Ow\), where
\[
O:=-(R+F^\top QF)^{-1}F^\top QG,
\]
and simplifies to
\[
R(u,w)=(u-Ow)^\top D(u-Ow),\qquad D:=R+F^\top QF\succ 0.
\]
The resulting design problem is
\[
\inf_{\phi\in\mathcal U}\sup_{P\in\mathcal P}\mathbb E_P\!\left[(\phi(w)-Ow)^\top D(\phi(w)-Ow)\right].
\]
The ambiguity set is ball-shaped around a nominal moment pair \((\bar\mu,\bar\Sigma)\):
\[
\mathcal P=\Big\{P\in\mathcal M(\mathbb R^n)\ \Big|\ \|\mu-\bar\mu\|_2^2\le r_1,\ \|\Sigma-\bar\Sigma\|_p\le r_2\Big\},
\]
where \(\mu=\mathbb E_P[w]\), \(\Sigma=\mathbb E_P[(w-\mu)(w-\mu)^\top]\), and \(\|\cdot\|_p\) is the Schatten \(p\)-norm. The paper identifies \(p=1\) with a nuclear norm ball, \(p=2\) with a Frobenius norm ball, and \(p=\infty\) with a spectral norm ball. Because only moments are constrained, the formulation allows temporal correlation and non-Gaussianity [2512.10906].

The central technical result is an exact convex reformulation. Writing \(\Delta:=K-O\) and \(C(K):=(K-O)^\top D(K-O)\), the optimal policy has the form
\[
\phi^\star(w)=K^\star(w-\bar\mu)+O\bar\mu,
\]
where \(K^\star\) solves
\[
K^\star\in\arg\min_{K\in\mathcal U}\left\{\operatorname{Tr}\!\big(\bar\Sigma\,C(K)\big)+r_1\|C(K)\|_\infty+r_2\|C(K)\|_q\right\},
\]
with \(q\) the dual exponent of \(p\). Mean uncertainty therefore induces a spectral-norm penalty \(r_1\|C(K)\|_\infty\), while covariance uncertainty induces a Schatten-\(q\)-norm penalty \(r_2\|C(K)\|_q\). The paper interprets this as a regularized version of nominal LQ stochastic control, with \(r_1=r_2=0\) recovering the ambiguity-free case, \(r_1\to\infty\) corresponding to robust regret control, and \(r_2\to\infty,\ p=\infty\) yielding classical LQR-like behavior. This establishes a direct connection between ball radii and robustness regularization [2512.10906].

The same work shows that the convex program is SDP-representable, but emphasizes that interior-point methods scale poorly with horizon and system size because of heavy memory and second-order computational cost. It therefore derives a dual projected subgradient method on a product of covariance balls,
\[
\mathcal S=\{\Sigma\succeq 0:\|\Sigma\|_1\le r_1\}\times \{\Sigma\succeq 0:\|\Sigma-\bar\Sigma\|_p\le r_2\},
\]
with update
\[
K^i\in\arg\min_{K\in\mathcal U}\langle G(K),S^i\rangle,\qquad S^{i+1}=\Pi_{\mathcal S}(S^i+\eta^iG(K^i)).
\]
If \(\bar\Sigma\succ 0\), this reduces to projected gradient ascent. The projection onto Schatten balls is performed by eigendecomposition followed by projection of eigenvalues onto an \(\ell_p\)-ball, preserving positive semidefiniteness. In the reported experiments on a damped double integrator with AR(1) disturbances, the proposed Nuc-Regret, Frob-Regret, and Spec-Regret methods show that performance first improves as the radius increases from zero and then becomes over-conservative at large radii; Spec-Regret matches the oracle causal controller at its best tuned radius in the uncorrelated case \((\rho=0)\); and at \(T=80\) the SDP takes over 16 minutes on average while the first-order method finishes in under 8 seconds [2512.10906].

## 3. \(L_1\)-balls in robust MDPs and Bayesian tightening

In robust MDPs, ball-shaped ambiguity sets are typically sets of transition probabilities in the simplex. The standard rectangular construction at each state–action pair takes the form
\[
P_{s,a}=\{p\in\Delta^S:\|p-\bar p_{s,a}\|_1\le \psi_{s,a}\},
\]
and enters the robust Bellman operator
\[
(T_Pv)(s):=\max_{a\in A}\min_{p\in P_{s,a}}\bigl(r_{s,a}+\gamma\,pv\bigr).
\]
This geometry underlies both frequentist and Bayesian safe-policy constructions. The Hoeffding-style confidence ball reviewed in the Bayesian robust-MDP papers is
\[
H_{s,a}=\left\{p\in\Delta^S:\|p-\bar p_{s,a}\|_1\le \sqrt{\frac{2}{n_{s,a}}\log\frac{SA2^S}{\delta}}\right\},
\]
with the guarantee
\[
P_D\!\left[\hat v_H^\pi\le v_{P^\star}^\pi,\ \forall \pi\in\Pi\mid P^\star\right]\ge 1-\delta.
\]
The stated limitation is that such sets are conservative because they enforce safety uniformly over all policies and all value functions [1902.07605].

The Bayesian Confidence Interval or Bayesian Credible Region construction retains the \(L_1\)-ball shape but centers it at the posterior mean,
\[
B_{s,a}=\{p\in\Delta^S:\|p-\bar p_{s,a}\|_1\le \psi^B_{s,a}\},\qquad
\bar p_{s,a}=E_{P^\star}[p^\star_{s,a}\mid D],
\]
and chooses the radius as the smallest posterior credible radius satisfying
\[
\psi^B_{s,a}=\min_{\psi\in\mathbb R_+}\left\{\psi: P\!\left[\|p^\star_{s,a}-\bar p_{s,a}\|_1>\psi\mid D\right]<\frac{\delta}{SA}\right\}.
\]
The implementation described in the paper is based on posterior sampling and a quantile computation, and the safety guarantee remains
\[
P_{P^\star}\!\left[\hat v_B^\pi\le v_{P^\star}^\pi,\ \forall \pi\in\Pi\mid D\right]\ge 1-\delta.
\]
The article-length significance of this result is not a new geometry but a tighter Bayesian calibration of an existing ball geometry [1902.07605] [1811.06512].

RSVF further relaxes the requirement that the ambiguity set be a confidence interval. For a fixed value function \(v\), it defines the safety-sufficient halfspace
\[
\mathcal K_{s,a}(v)=\{p\in\Delta^S: pv\le g_{s,a}(v)\},
\]
where
\[
g_{s,a}(v)=\max\left\{g: P_{P^\star}[g\le (p^\star_{s,a})v\mid D]\ge 1-\frac{\delta}{SA}\right\}.
\]
The key geometric statement is that safety is guaranteed if the ambiguity set intersects each relevant halfspace. RSVF then fits a ball
\[
\mathcal L_{s,a}(V)=\{p\in\Delta^S:\|p-\theta_{s,a}(V)\|_1\le \psi_{s,a}(V)\}
\]
by optimizing both center and radius:
\[
\psi_{s,a}(V)=\min_{p\in\Delta^S} f(p),\qquad \theta_{s,a}(V)\in\arg\min_{p\in\Delta^S} f(p),
\]
with
\[
f(p)=\max_{v\in V}\min_{q\in\mathcal K_{s,a}(v)}\|q-p\|_1.
\]
The resulting robust return remains safe, but the paper’s conceptual point is that the ball is no longer a generic posterior confidence region; it is a value-adapted uncertainty set whose location and size are chosen to guarantee only the decision-relevant lower bound [1902.07605] [1811.06512].

This line of work also clarifies a common misconception: ball-shaped ambiguity sets in robust RL need not be centered at the empirical or posterior mean. A ball in the simplex can instead be centered at a point chosen by an optimization over supporting hyperplanes induced by relevant value functions. Conversely, recent work on robust \(Q\)-learning for finite ambiguity sets explicitly positions itself as going beyond ball-based uncertainty by allowing a finite, user-specified set of transition measures
\[
\mathcal P(x,a)=\{\mathbb P^{(1)}(x,a),\ldots,\mathbb P^{(N)}(x,a)\},
\]
rather than a neighborhood around one nominal model. This contrast shows that ball-shaped sets are only one modeling choice among several in robust sequential decision making [2407.04259].

## 4. Coupled mean–covariance balls for Gaussian motion planning

A distinct use of ball-shaped ambiguity sets appears in probabilistic motion planning for linear Gaussian systems with Euclidean ball goals. Here the ambiguity set is a set of Gaussian distributions whose mean and covariance jointly satisfy a single coupled inequality. For center \(\hat\mu\), radius \(\hat r\), and risk level \(\epsilon\), the Gaussian-quantile version is
\[
\mathcal P^{\mathrm{BALL}}(\hat\mu,\hat r):=
\left\{\mathbb P:\ \|\mu_{\mathbb P}-\hat\mu\|_2+\Phi^{-1}(1-\epsilon)\sqrt{\lambda_{\max}(\Sigma_{\mathbb P})}\le \hat r\right\},
\]
and the \(\chi^2\)-based version is
\[
\mathcal P^{\mathrm{BALL},\chi^2}(\hat\mu,\hat r):=
\left\{\mathbb P:\ \|\mu_{\mathbb P}-\hat\mu\|_2+\sqrt{f^{-1}(1-\epsilon,n)}\,\sqrt{\lambda_{\max}(\Sigma_{\mathbb P})}\le \hat r\right\}.
\]
The paper states the associated guarantee
\[
\mathbf x\sim \mathbb P\in \mathcal P^{\mathrm{BALL}}(\hat\mu,\hat r)\quad \Longrightarrow\quad
\mathbb P(\mathbf x\in \mathbb B_n(\hat\mu,\hat r))\ge 1-\epsilon.
\]
This couples the allowable mean displacement and covariance spread through a shared radius budget [2510.04807].

The paper contrasts this geometry with earlier ellipsoidal, Wasserstein/Gelbrich, and MAXCOVAR-style formulations. The earlier ellipsoidal ambiguity set constrains the mean to lie in a fixed ellipsoid independent of covariance, while MAXCOVAR fixes the mean and bounds covariance. The new ball-shaped ambiguity set allows tradeoff: a distribution may have a mean farther from the goal center if its covariance is small enough. The paper’s stated interpretation is direct: if the mean is far from the goal center, then the covariance must be small; if the covariance is larger, the mean must be closer. This coupling is presented as a tighter representation of the Gaussian distributions that truly satisfy a ball-reaching chance constraint [2510.04807].

This ambiguity set is the basic object in the MAX-COV-BALL backward reachable tree. The synthesis problem maximizes the radius of the initial ball-shaped ambiguity set,
\[
\max_{\overline{\mathbf u}_k,K_k,\Sigma_k,\mathscr R_k} r=\lambda_{\min}(\mathscr R_0),
\]
subject to the mean, covariance, and shape recursions
\[
\mu_{k+1}=A\mu_k+B\overline{\mathbf u}_k,\qquad
\mathscr R_{k+1}=(A+BK_k)\mathscr R_k(A+BK_k)^\top,\qquad
\Sigma_{k+1}=(A+BK_k)\Sigma_k(A+BK_k)^\top+DD^\top,
\]
together with chance constraints and a terminal inclusion condition. The paper proves a maximum-coverage theorem in the absence of process noise and state constraints:
\[
h\text{-BRS}(\mathcal T_{\mathrm{OURS}}^{(r)})\supset h\text{-BRS}(\mathcal T_{\mathrm{ANY}}^{(r)})
\quad \forall h\ge 1,\ r\ge 1,
\]
and also proves dominance over MAXCOVAR with strict containment under mild conditions. It further extends the construction to a Minkowski-sum target
\[
\mathcal G=\mathcal E(\mu_{\mathcal G},\mathscr P_{\mathcal G})\oplus \mathbb B_n(0,r_{\mathcal G})
\]
through an ellipsoidal generalization
\[
\mathcal P^{\mathrm{ELL\mbox{-}BALL}}(\hat\mu,\hat{\mathscr P},\hat r),
\]
which permits the center of an inner ball to vary over an outer ellipsoid [2510.04807].

## 5. Ball propagation under learned and physical dynamics

Ball-shaped ambiguity sets are also used when uncertainty must be propagated forward in time. In nonlinear data-driven dynamics models based on kernel conditional mean embeddings and Koopman operators, the uncertainty object is the embedded distribution \(\mathcal E p_t\in\mathbb H\), and the ambiguity region is an MMD ball:
\[
\mathcal M_t:=\{\mu\mid MMD(\mu,\hat{\mathcal E}\hat p_t)\le \rho_t\},
\]
or equivalently
\[
\mathcal A_t=\left\{\mu\ \middle|\ \left\|\mu-\sum_{i=1}^m \beta_i\Phi(X_t^i)\right\|_{\mathbb H}\le \rho_t\right\}.
\]
Since
\[
MMD(\mu,\nu)=\|\mathcal E\mu-\mathcal E\nu\|_{\mathbb H},
\]
the ambiguity set is literally a norm ball in RKHS geometry. The paper’s multistep propagation result bounds the error between the empirical and true embedded distributions after \(T\) steps, and the recursive algorithm updates both center and radius, outputting an ambiguity tube \(\{\hat{\mathcal E}\hat q_i\}_{i=0}^T\) together with radii \(\rho_i\). The stated conceptual claim is that these MMD balls are the natural geometric structure for learned kernel dynamics because the dynamics themselves are represented through RKHS operators [2304.14057].

A different propagation problem arises for hyperbolic conservation laws with uncertain inputs. There, the ambiguity sets are 1-Wasserstein balls around empirical distributions of uncertain initial and boundary data. At each spatial point or boundary point, the paper constructs empirical distributions from \(N\) i.i.d. samples and uses a concentration-of-measure bound
\[
P\!\left(W_p(\widehat\mu^N,\mu)\le \epsilon_N(\beta,\rho)\right)\ge 1-\beta
\]
with \(p=1\), transferring the radius through globally Lipschitz input maps. The pointwise ambiguity balls are written as
\[
P_{\mathbf x}^0:=\left\{F\in C([\alpha_0(\mathbf x),\gamma_0(\mathbf x)])\ \middle|\ W_1(\widehat F_{u_0(\mathbf x)}^N,F)\le L_0(\mathbf x)\epsilon_N(\beta,\rho_{\mathbf a})\right\},
\]
with an analogous boundary construction. The propagation mechanism is the CDF PDE obtained by the method of distributions:
\[
\frac{\partial F_{u(\mathbf x,t)}}{\partial t}+\boldsymbol\Lambda\cdot \widetilde\nabla F_{u(\mathbf x,t)}=0.
\]
For general nonlinear hyperbolic equations, the paper propagates upper and lower CDF envelopes, leading to ambiguity bands. For linear dynamics, it derives a closed PDE for the Wasserstein radius itself,
\[
\frac{\partial \omega_1}{\partial t}+\dot{\boldsymbol q}\cdot \nabla \omega_1-\dot r\,\omega_1=0,
\]
where
\[
\omega_1(\mathbf x,t)=W_1(F^1_{u(\mathbf x,t)},F^2_{u(\mathbf x,t)}).
\]
The reported guarantee is that the propagated ambiguity balls still contain the true distributions with confidence \(1-\beta\) [2003.06735].

Taken together, these two lines of work show that the tractability of ball propagation depends strongly on the geometry used. In the RKHS setting, the ball is compatible with linear operator propagation in embedding space; in the hyperbolic PDE setting, Wasserstein balls can be propagated exactly only for linear dynamics, while nonlinear dynamics require envelope propagation. This suggests that dynamic ambiguity propagation is easiest when the uncertainty geometry is aligned with the evolution operator acting on the chosen representation [2304.14057] [2003.06735].

## 6. Infinite-dimensional existence theory, nonexistence, and modeling limits

Ball-shaped ambiguity sets also arise as fixed-shape sets of maximal probability content. In a Banach space \(X\), the question is whether for every radius \(r>0\) there exists a center \(x_0\in X\) such that
\[
\mu(B_r(x_0))\ge \mu(B_r(x))\qquad \forall x\in X,
\]
where \(B_r(x)=x+B_r\). The relevant existence theorem states that if \(X\) is the separable dual of a Banach space and \(C\subset X\) is a bounded weak\(^*\)-closed convex set with non-empty interior, then for every Borel probability measure \(\mu\) on \(X\) there exists \(x_0\in X\) such that
\[
\mu(C(x_0))\ge \mu(C(x))\qquad \forall x\in X.
\]
Taking \(C=B_r\) yields existence of a ball of radius \(r\) with maximal \(\mu\)-mass. Immediate positive cases include separable reflexive Banach spaces and \(\ell^1\) [2309.02846].

The same paper proves that existence can fail in natural infinite-dimensional settings. In \(X=c_0\) with the sup norm and product exponential measure
\[
\mu=\bigotimes_{k\ge 1}\mathrm{Exp}(k),
\]
the map \(x\mapsto \mu(B_r(x))\) has no maximizer for any radius \(r>0\), although the supremum is explicit:
\[
m_0=\prod_{k\ge 1}(1-e^{-2kr}).
\]
A second counterexample constructs a measure on \(c_0\) that is absolutely continuous with respect to a Gaussian measure and still has no maximal ball. The paper then gives two nonexistence examples on Wiener space, including conditioned Wiener measure above a moving boundary. The stated conceptual takeaway is a sharp dichotomy: in structurally favorable Banach spaces, maximal-probability fixed-shape convex sets always exist; in other natural infinite-dimensional settings, even very regular measures may fail to admit any ball of maximal probability [2309.02846].

This existence theory clarifies a potential misconception in applications: the intuitive idea that a ball-shaped uncertainty region can always be centered where the measure “concentrates most” is not valid in full generality. The robust-optimization literature often treats the center and radius as optimization variables or data-driven estimates, but the Banach-space results show that the existence of an actual maximizing ball is a structural property of the ambient space. A related modeling limit appears in robust RL, where recent work argues that ball-shaped ambiguity sets are too restrictive when uncertainty is scenario-based rather than distance-based, and replaces them with finite, user-specified ambiguity sets. A plausible implication is that ball geometries are most effective when uncertainty is naturally described as perturbations around a nominal object, and less effective when the admissible models are intrinsically asymmetric, multimodal, or discrete [2407.04259].

Ball-shaped ambiguity sets therefore occupy a broad but technically heterogeneous position in contemporary uncertainty modeling. Their importance comes from the fact that they often preserve tractability, admit explicit regularization interpretations, or align with the geometry of the underlying model representation. Their limitations arise when the chosen geometry decouples quantities that should be coupled, when dynamic propagation is incompatible with the model class, or when the ambient space does not support existence of a maximal-probability ball.

Source: https://www.emergentmind.com/topics/ball-shaped-ambiguity-sets