Moment Concentration Bound
Definition
A moment concentration bound is a finite-sample guarantee that quantifies how far the estimated
mean and covariance of a distribution — learned from samples — can deviate from the true moments,
with a chosen confidence. In ren2022chance (Theorem 1) it is used to
robustify a deterministically-reformulated chance / CVaR constraint against moment-estimation error:
the true (unknown) moments of each Gaussian-mixture mode are replaced by estimates
inflated by additive (mean) and multiplicative (covariance) margins, so a
solution feasible for the inflated constraint is feasible for the exact one with probability at least
. The construction is distribution-/regime-agnostic (it is a property of the sample statistics,
not of any robot); the source’s application is automotive trajectory planning, not a space robot — neither
free-flying nor free-floating.
Key Equations
Symbols per notation.md.
Notation flag. The source writes the deterministic-reformulation coefficient as
(inverse-CDF / CVaR coefficient). The glyph in notation.md is the
load-bearing circumcentroidal coordinate transform — an unrelated object. To avoid
collision this page renames the source’s scalar to . The sample size and mode index are
local to this page (not in the registry). Two further glyphs do collide with the registry and are used
here only in the source’s risk-layer sense: the safety tolerance here is not
notation.md’s (the isotropic damping floor), and the per-mode risk bound (scalar) is
unrelated to notation.md’s quaternion vector part .
Robustified per-mode constraint (feasible exact constraint holds w.p. ):
with the mean margin (additive, one-sided, exploiting the scalar linear-constraint structure
) and the covariance margin (multiplicative inflation factor):
where is the -quantile of Hotelling’s -distribution and the
-quantile of the -distribution. The coefficient is for a chance
constraint and for its CVaR approximation
( = inverse-CDF / PDF of ). The mean margin (1-D, ) is
no looser than the multivariate ball bound of prior work — the source’s Remark 2 proves
(a , not a strict inequality) and reports the constant gap as an empirical
observation for , concluding only that the 1-D bound “appears to be tighter.”
Source Support
- ren2022chance — primary and sole source: derives the GMM moment
concentration bound (Theorem 1), splits it into a Hotelling- mean margin and a covariance
inflation, and uses it to certify finite-sample feasibility of chance and CVaR constraints in
trajectory planning.
Related Topics
- chance_constraints — the bound robustifies a chance constraint against
moment-estimation error, preserving the violation guarantee under learned moments. - conditional_value_at_risk — the same bound certifies the CVaR
approximation of the chance constraint (the coefficient switches to the CVaR form). - covariance_propagation — supplies the covariance
that the factor inflates; this bound quantifies the trust placed in that estimate. - interval_arithmetic — an alternative set-based way to carry uncertainty
margins through a constraint; contrast with this distributional, sample-count-driven margin. - coherent_risk_measures — CVaR (the approximation certified here) is the
canonical coherent risk measure; the bound is what makes its finite-sample use rigorous.
Open Questions
- The source is automotive (linear time-varying ego vehicle, GMM obstacle uncertainty). Does the bound
transfer to our free-flying manipulator’s chance-constrained planning, where the constraint map
is replaced by a nonlinear function of the coupled base+arm state? - The guarantee assumes the moments are estimated by independent sampling per GMM mode. For
on-orbit estimation (e.g. recursive filter outputs), the i.i.d.-sample premise behind the
Hotelling- / quantiles may not hold — what replaces ? - The bound assumes each mode is Gaussian ( Gaussian). What is the
analogous concentration margin when the per-mode model is itself only approximate?