Mean STD Sampling: Estimation & Variance Design

Updated 9 July 2026

Mean STD Sampling is a family of methods that reconstructs sample means and standard deviations from incomplete summaries using order-statistic approximations and smooth weighting functions.
It optimizes sampling by leveraging standard deviation information to allocate samples efficiently, reduce estimator variance, and meet relative error guarantees.
These techniques extend to meta-analysis, Monte Carlo estimation, and variance-aware designs by replacing ad hoc rules with adaptive, statistically principled estimators.

Mean STD Sampling denotes a family of procedures in which the mean and the standard deviation jointly determine estimation, inference, or sampling design. In systematic reviews and meta-analysis, it most commonly refers to reconstructing a study’s sample mean $\bar{X}$ and sample standard deviation $S$ from medians, ranges, and quartiles when primary studies report incomplete summaries rather than $(\bar{X},S)$ directly (Wan et al., 2014). In a different Monte Carlo literature, it refers to estimating a mean $\mu$ from i.i.d. samples when the relative standard deviation is bounded by a known constant $c$ , so that sample complexity is governed by $c^2\epsilon^{-2}\ln(1/\delta)$ (Huber, 2017). Related usages also appear in variance-aware sampling design, where standard deviations determine optimal allocation, ranked-set selection, or confidence-interval width (Liu, 2024, Ekman, 23 Mar 2026).

1. Core meta-analytic formulation

In continuous-outcome meta-analysis, the target inputs are the sample size $n$ , sample mean $\bar{X}$ , and sample standard deviation $S$ . A recurrent difficulty is that many trials instead report the median $m$ , minimum $S$ 0, maximum $S$ 1, and sometimes the first and third quartiles $S$ 2. Wan et al. formalized three reporting scenarios (Wan et al., 2014).

Scenario	Reported summary	Principal information source
C1	$S$ 3	median and range
C2	$S$ 4	full five-number summary
C3	$S$ 5	quartiles and median

The reconstruction target is

$S$ 6

In this setting, the main technical issue is that range-based and interquartile-range-based estimators depend strongly on $S$ 7. Wan et al. therefore replaced ad hoc range rules with order-statistic approximations that incorporate sample size continuously through normal quantiles (Wan et al., 2014).

For C1, the retained mean estimator is

$S$ 8

and the recommended standard deviation estimator is

$S$ 9

For C2, the preferred mean estimator is

$(\bar{X},S)$ 0

while the standard deviation estimator combines range and interquartile range,

$(\bar{X},S)$ 1

For C3, the mean and standard deviation estimators are

$(\bar{X},S)$ 2

These formulas are derived from expected normal order statistics, using Blom’s approximation

$(\bar{X},S)$ 3

and analogous approximations for quartile order statistics. The practical significance is that the divisor in a range- or IQR-based SD estimator is no longer fixed; it varies with $(\bar{X},S)$ 4, which removes the arbitrary cutoffs used in earlier rules.

2. From ad hoc rules to order-statistic estimators

Earlier methods were simpler but less stable. Hozo et al. proposed the C1 mean approximation $(\bar{X},S)$ 5, together with range rules such as

$(\bar{X},S)$ 6

or the piecewise rule

$(\bar{X},S)$ 7

Wan et al. identified several limitations: the cutoffs $(\bar{X},S)$ 8 and $(\bar{X},S)$ 9 are somewhat arbitrary, the divisor does not depend on $\mu$ 0 continuously, the range increases without bound for unbounded distributions as $\mu$ 1 grows, and the original derivation assumes non-negative data (Wan et al., 2014).

Bland extended the reconstruction problem to the full five-number summary and proposed

$\mu$ 2

For SD, Bland used a formula independent of $\mu$ 3, which Wan et al. reported to underestimate for small $\mu$ 4 and overestimate for large $\mu$ 5, especially under skewness (Wan et al., 2014).

The main conceptual advance in Wan et al. is therefore not only the specific formulas but the replacement of fixed divisors by functions of $\mu$ 6. In their simulation study, the proposed C1, C2, and C3 SD estimators were nearly unbiased under normal data and had smaller bias than Hozo’s and Bland’s estimators under log-normal, beta, exponential, and Weibull data. The paper also concluded with a practical ranking of reporting formats: C2 was recommended as the ideal scenario, C1 was preferable for small samples, and C3 was preferable for large samples (Wan et al., 2014).

A common misconception is that all “median-to-mean” conversions are interchangeable. The reported results suggest the opposite: the available summary statistics determine which reconstruction is appropriate, and the sampling behavior of the range and IQR changes materially with $\mu$ 7.

3. Optimal weighting and non-normal extensions

The next stage of the literature sharpened the weighting of order-statistic summaries. Luo et al. treated the sample mean itself as an optimally weighted combination of the mid-range, mid-quartile, and median, with weights that vary smoothly with $\mu$ 8 (Luo et al., 2015). For the full five-number summary, their recommended estimator is

$\mu$ 9

with

$c$ 0

This replaces fixed weights with a smooth function of sample size and was proposed as the optimal mean estimator under the five-number summary (Luo et al., 2015).

Shi et al. then argued that Wan et al.’s equal weighting of the range-based and IQR-based SD estimators in the five-number-summary case is also suboptimal, because the range is more informative for small $c$ 1 whereas the IQR is more stable for large $c$ 2 (Shi et al., 2020). They proposed

$c$ 3

with

$c$ 4

and derived an optimal smooth weight. Their practical approximation is

$c$ 5

which yields the shortcut SD estimator

$c$ 6

where

$c$ 7

$c$ 8

Their numerical results showed a more accurate estimate for normal data and favorable performance for non-normal data (Shi et al., 2020).

A further limitation of the normal-order-statistic approach is that studies reporting medians often do so because the data are non-normal. McGrath et al. therefore proposed two explicitly non-normal approaches: a quantile estimation method that fits one of several candidate parametric distributions by minimizing squared discrepancies between observed and theoretical quantiles, and a Box-Cox method that transforms the reported quantiles to approximate symmetry before applying Luo/Wan-type formulas (McGrath et al., 2019). Their simulations and empirical assessments showed that the proposed methods often perform better than the existing methods when applied to non-normal data (McGrath et al., 2019).

Taken together, these developments define the most technical sense of Mean STD Sampling in evidence synthesis: a sequence of increasingly refined estimators that use order-statistic theory, smooth weighting, and, where necessary, explicit non-normal modeling to recover $c$ 9 from partial summaries.

4. Mean estimation with bounded relative standard deviation

In randomized approximation algorithms, “Mean STD Sampling” refers to a different problem: estimating a mean $c^2\epsilon^{-2}\ln(1/\delta)$ 0 from i.i.d. samples $c^2\epsilon^{-2}\ln(1/\delta)$ 1 when the relative standard deviation is bounded,

$c^2\epsilon^{-2}\ln(1/\delta)$ 2

or equivalently $c^2\epsilon^{-2}\ln(1/\delta)$ 3 when $c^2\epsilon^{-2}\ln(1/\delta)$ 4. The goal is to construct $c^2\epsilon^{-2}\ln(1/\delta)$ 5 such that

$c^2\epsilon^{-2}\ln(1/\delta)$ 6

with as few samples as possible (Huber, 2017).

The classical median-of-means approach achieves leading-order sample complexity

$c^2\epsilon^{-2}\ln(1/\delta)$ 7

and Huber’s 2014 smoothing construction reduced this to

$c^2\epsilon^{-2}\ln(1/\delta)$ 8

by averaging blocks, multiplying each block average by an independent uniform factor on $c^2\epsilon^{-2}\ln(1/\delta)$ 9, and taking the median of the smoothed block means (Huber, 2014). The same line of work proved that the optimal order is $n$ 0.

Huber’s 2017 estimator then achieved the optimal leading constant: $n$ 1 matching the lower bound up to lower-order terms and doing so without requiring extra conditions such as bounds on third or fourth moments (Huber, 2017). A 2019 refinement balanced the upper and lower tails of a robust $n$ 2-estimator and obtained the explicit sample bound

$n$ 3

again under a bounded relative standard deviation assumption (Huber, 2019).

This literature matters because many #P-complete randomized approximation schemes reduce to mean estimation with controlled relative variance. The listed applications include the volume of a convex body, the permanent of a nonnegative matrix or a $n$ 4-matrix, the number of linear extensions of a poset, and the partition function of the Ising model (Huber, 2014, Huber, 2017, Huber, 2019). Here the standard deviation is not reconstructed from quantiles; it is an a priori complexity parameter that determines the number of samples needed for a relative-error guarantee.

5. Variance-aware sampling designs

A third use of the phrase arises when the standard deviation determines how samples should be allocated or selected. In BayesSRW, the population is partitioned into $n$ 5 groups with group sizes $n$ 6, means $n$ 7, and standard deviations $n$ 8, and the target is the overall population mean

$n$ 9

With inverse-probability weighting, the variance of the estimator is

$\bar{X}$ 0

and minimizing this variance subject to $\bar{X}$ 1 yields the optimal allocation

$\bar{X}$ 2

The rule is therefore to allocate in proportion to group size times group standard deviation, not merely group size (Liu, 2024). The paper then extends this to a two-stage Bayesian procedure, BayesSRW, where an initial sample is used to estimate the $\bar{X}$ 3, and the remaining budget is allocated according to $\bar{X}$ 4 (Liu, 2024).

In computer architecture simulation, the same mean/SD logic appears in another form. For a sample of regions with CPI values $\bar{X}$ 5, the paper uses the classical confidence interval for the mean,

$\bar{X}$ 6

so that the margin of error is proportional to $\bar{X}$ 7 (Ekman, 23 Mar 2026). Ranked set sampling is used to reduce the standard deviation of the mean estimator at fixed sample size by exploiting a cheap ranking proxy derived from a baseline configuration. Across the reported experiments, ranked set sampling reduces the confidence interval width by up to $\bar{X}$ 8; repeated subsampling reduces the maximum observed error from $\bar{X}$ 9 to $S$ 0; and a multi-configuration Chebyshev-distance selection criterion yields an average error below $S$ 1 and a maximum error of $S$ 2 across SPEC CPU 2017 Integer applications when simulating 30 regions of 1 million instructions each (Ekman, 23 Mar 2026).

These papers emphasize a different principle from the meta-analysis literature. The goal is not to recover an unreported SD, but to use observed or estimated standard deviations to minimize the variance of a mean estimator through allocation, ranking, or representative subsample selection.

Several adjacent literatures extend the same mean/dispersion logic to dependent data and interacting-particle systems. For stationary time series, self-normalized block sampling replaces explicit long-run variance estimation by a path-based self-normalizer

$S$ 3

and uses overlapping block statistics to estimate the sampling distribution of the mean without a priori estimation of auxiliary parameters such as long-run variance, tail index, or memory parameters (Bai et al., 2015). In consensus-based sampling and optimization, the key state variables are a weighted mean $S$ 4 and a weighted covariance $S$ 5, and quantitative mean-field limits show $S$ 6 convergence of the particle system to its mean-field dynamics (Gerber et al., 2023). In a related mean-field Langevin setting, sampling from the mean-field stationary distribution is decoupled into propagation of chaos for the finite-particle approximation and log-concave sampling for the $S$ 7-particle stationary law (Kook et al., 2024).

Across these domains, the main limitations are consistent. In the quantile-to-mean/SD setting, Wan et al.’s formulas rely on approximate normality or at least symmetry and moderate skewness, and accuracy degrades for very small $S$ 8, extreme skewness, heavy tails, or truncation (Wan et al., 2014). McGrath et al. made the same point from the opposite direction: a major limitation of widely used conversion rules is their normality assumption, which is unlikely to be tenable precisely in studies that report medians (McGrath et al., 2019). In bounded-relative-variance Monte Carlo, the guarantees require a correct upper bound on $S$ 9; underestimating that constant invalidates the sample-complexity guarantee (Huber, 2019). In variance-aware allocation methods, gains are substantial only when heterogeneity in $m$ 0 is real rather than negligible (Liu, 2024).

A recurring misunderstanding is to treat all of these problems as the same object. They are not. One line of work reconstructs missing $m$ 1 from quantiles; another derives optimal sample complexity when a relative standard deviation bound is known; another uses standard deviations to allocate sampling effort or reduce variance. What unifies them is more limited but precise: the mean is the target quantity, the standard deviation governs either identifiability, accuracy, or cost, and the best sampling scheme depends on how that relationship is formalized in the underlying model.