Variance-Optimal Reservoir Sampling

• Variance-optimal reservoir sampling is an online method that maintains a bounded sample from weighted streams, ensuring unbiased subset sum estimations.
• It minimizes the average variance for any subset query size, outperforming other schemes in statistical accuracy and efficiency.
• The scheme supports efficient updates and distributed mergeability with O(log k) per-item processing time and low memory requirements.

Variance-optimal reservoir sampling refers to an online sampling methodology that maintains a bounded-size sample (reservoir) from a stream of weighted items, such that subset sum estimates—over any subset, of any size—are unbiased and achieve minimal possible average variance given the sample size constraint. The technique achieves strict optimality in terms of average subset sum estimation variance for every possible query size, outperforming all other known schemes, and is efficient with respect to both per-item processing time and memory requirements (0803.0473).

1. Problem Context and Formal Definition

Given a data stream comprised of items indexed by $i = 1, ..., n$, each with a positive weight $w_i > 0$, the objective is to support approximate queries for subset sums: for any subset $A \subseteq \{1, ..., n\}$, estimate $W_A = \sum_{i \in A} w_i$ using a maintained reservoir $S$ of at most $k$ samples. Each sample in the reservoir carries an adjusted weight $\hat{w}_i$, so the estimator for any subset $A$ is $\hat{W}_A = \sum_{i \in A \cap S} \hat{w}_i$. The requirements are as follows:

• Unbiasedness: $E[\hat{W}_A] = W_A$ for any $w_i > 0$0.
• Variance Minimization (Average Optimality): For any subset size $w_i > 0$1, the average variance over all subsets of size $w_i > 0$2 is minimized simultaneously for all $w_i > 0$3 and all possible weight assignments (0803.0473).
• Worst-case control: Single-subset, single-item, and total estimation variances are tightly bounded.
• Efficient Online Implementation: Space $w_i > 0$4 and per-item time $w_i > 0$5.

2. Core Reservoir Sampling Procedure (varoptₖ)

The variance-optimal reservoir sampling scheme, denoted as $w_i > 0$6, incrementally constructs and maintains the optimal reservoir as follows (0803.0473):

1. Initialization: For the first $w_i > 0$7 arrivals, add each with $w_i > 0$8.
2. Update on Arrival $w_i > 0$9 (for $A \subseteq \{1, ..., n\}$0):
   • Form $A \subseteq \{1, ..., n\}$1, so $A \subseteq \{1, ..., n\}$2.
   • Compute the unique threshold $A \subseteq \{1, ..., n\}$3 solving $A \subseteq \{1, ..., n\}$4.
   • For each $A \subseteq \{1, ..., n\}$5, set $A \subseteq \{1, ..., n\}$6 and $A \subseteq \{1, ..., n\}$7.
   • Randomly pick $A \subseteq \{1, ..., n\}$8 to drop: sample $A \subseteq \{1, ..., n\}$9 uniformly and select $W_A = \sum_{i \in A} w_i$0 so that $W_A = \sum_{i \in A} w_i$1.
   • Resulting reservoir $W_A = \sum_{i \in A} w_i$2; for each $W_A = \sum_{i \in A} w_i$3, set $W_A = \sum_{i \in A} w_i$4.

In effect, this procedure exactly simulates a k-out-of-(k+1) variance-optimal sample, maintaining the unbiasedness and optimal average-variance properties.

Implementation

Efficient implementation is achieved via two balanced binary trees over $W_A = \sum_{i \in A} w_i$5:

• Tree $W_A = \sum_{i \in A} w_i$6 for items with $W_A = \sum_{i \in A} w_i$7 (sorted by $W_A = \sum_{i \in A} w_i$8; supports subtree statistics).
• Tree $W_A = \sum_{i \in A} w_i$9 for items with $S$0 (arbitrary order; supports split/concatenation).

All updates, threshold computations, and item removals are carried out in $S$1 worst-case per item.

3. Variance Optimality and Statistical Properties

The estimator $S$2 is unbiased for every $S$3, as each inclusion probability satisfies Horvitz–Thompson conditions:

$S$4

(since $S$5 tracks the original $S$6 at final inclusion).

For any fixed subset size $S$7, let $S$8 denote the average user-facing query variance. An identity (ST07, Eq. 1 in (0803.0473)) expresses this as:

$S$9

where $k$0 is the variance of the total weight estimator. $k$1 ensures $k$2, and in addition minimizes the total individual variances $k$3 among all schemes with $k$4 samples in expectation.

No other online or offline sampling scheme with $k$5 samples (even one optimized post hoc for the particular data stream) achieves lower $k$6 for any $k$7, establishing strict simultaneous optimality (0803.0473).

4. Worst-Case, Tail Bounds, and Complexity

The $k$8 scheme has strong worst-case guarantees for individual items and subsets:

• For all $k$9, $\hat{w}_i$0 where $\hat{w}_i$1; in particular, $\hat{w}_i$2 (0803.0473).
• For any subset $\hat{w}_i$3, $\hat{w}_i$4 and $\hat{w}_i$5.

High-probability error control is achieved through Chernoff-type tail bounds that mirror those for independent Poisson sampling. For the sum of inclusion indicators $\hat{w}_i$6 over a subset $\hat{w}_i$7, and $\hat{w}_i$8:

$\hat{w}_i$9

The weighted estimator $A$0 thus satisfies standard multiplicative tail bounds (0803.0473).

Updates can be performed in $A$1 worst-case time per stream item, with $A$2 space for both the reservoir and supplemental structures. No general implementation achieves worst-case per-item time better than $A$3 on the word-RAM model (0803.0473).

5. Comparison to Other Sampling Schemes

Variance-optimal reservoir sampling is compared to several canonical alternatives:

Scheme	Average Variance	Online-friendly	Mergeable	Worst-case Guarantee
Uniform w/o replacement	Arbitrarily bad (heavy tails)	Yes	No	Poor
PPS with replacement	Wastes samples (duplicates)	Yes	Yes	Weak
PPS w/o replacement	No global optimum	No	No	Moderate
IPPS Poisson sampling	Doubles large-$A$4 variance	Yes	Yes	Moderate
Priority sampling	Suboptimal for large $A$5	Yes	Yes	Good
Chao/Tillé (offline)	Optimum; $A$6–$A$7 time	No	No	Good
$A$8	Optimum for all $A$9	Yes	Yes	Best known

$\hat{W}_A = \sum_{i \in A \cap S} \hat{w}_i$0 strictly dominates all listed competitors in unbiasedness, variance minimization for every subset size, worst-case control, and support for efficient online and mergeable sampling.

6. Distributed Mergeability and Scalability

The mergeability property of $\hat{W}_A = \sum_{i \in A \cap S} \hat{w}_i$1 enables scalable, distributed monitoring and analytics. Given any set of disjoint streams $\hat{W}_A = \sum_{i \in A \cap S} \hat{w}_i$2, maintain separate reservoirs of size $\hat{W}_A = \sum_{i \in A \cap S} \hat{w}_i$3, then merge the local reservoirs through a single $\hat{W}_A = \sum_{i \in A \cap S} \hat{w}_i$4 operation applied to the union. The resulting sample has the same distribution as if the scheme were run on the global union from scratch (0803.0473):

$\hat{W}_A = \sum_{i \in A \cap S} \hat{w}_i$5

This allows aggregation of independently-maintained samples in $\hat{W}_A = \sum_{i \in A \cap S} \hat{w}_i$6 time for data-parallel, distributed, or federated data settings.

7. Limitations, Assumptions, and Open Directions

• Space/Time Complexity: The reservoir requires $\hat{W}_A = \sum_{i \in A \cap S} \hat{w}_i$7 memory and $\hat{W}_A = \sum_{i \in A \cap S} \hat{w}_i$8 worst-case per update. A matching lower bound of $\hat{W}_A = \sum_{i \in A \cap S} \hat{w}_i$9 rules out strict $E[\hat{W}_A] = W_A$0 worst-case updates in floating-point arithmetic.
• Numerical Stability: Accurate maintenance of sums and thresholds requires $E[\hat{W}_A] = W_A$1 bits of precision.
• Assumptions for Merge Operations: Standard mergeability assumes strict disjointness of item keys. Extensions to environments with key collisions (unaggregated keyed streams) require additional handling (0803.0473).
• Open Problems: Determining whether practical approximations can allow $E[\hat{W}_A] = W_A$2 or $E[\hat{W}_A] = W_A$3 worst-case update remains unresolved, though evidence suggests this is not feasible for exact implementations.

Variance-optimal reservoir sampling is the unique known scheme providing minimal average variance for subset sum estimation under constrained sample size, while remaining practical and adaptable for large-scale streaming and distributed systems (0803.0473).