Pith. sign in

REVIEW 2 cited by

Unbiased estimators for the variance of MMD estimators

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1906.02104 v3 pith:FI6E3WAL submitted 2019-06-05 stat.ML cs.LG

classification stat.MLcs.LG
keywords estimatorestimatorsvariancecomputationalsquaredunbiasedableactual
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The maximum mean discrepancy (MMD) is a kernel-based distance between probability distributions useful in many applications (Gretton et al. 2012), bearing a simple estimator with pleasing computational and statistical properties. Being able to efficiently estimate the variance of this estimator is very helpful to various problems in two-sample testing. Towards this end, Bounliphone et al. (2016) used the theory of U-statistics to derive estimators for the variance of an MMD estimator, and differences between two such estimators. Their estimator, however, drops lower-order terms, and is unnecessarily biased. We show in this note - extending and correcting work of Sutherland et al. (2017) - that we can find a truly unbiased estimator for the actual variance of both the squared MMD estimator and the difference of two correlated squared MMD estimators, at essentially no additional computational cost.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Maximum Mean Discrepancy with Unequal Sample Sizes via Generalized U-Statistics

    stat.ML 2025-12 conditional novelty 7.0 of 10

    With unequal sample sizes, MMD estimators converge under min(nX,nY) scaling, so tests can use all available data instead of discarding surplus samples.

  2. Keep your distance: learning dispersed embeddings on $\mathbb{S}_m$

    cs.LG 2025-02 conditional novelty 6.0 of 10

    The authors introduce sliced and Lloyd-based dispersion regularizers for hyperspherical embeddings, connect kernel dispersion objectives to maximum mean discrepancy, and show downstream gains in prototype classificati...

Pith tools