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
Signed reviews
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.
Forward citations
Cited by 2 Pith papers
-
Maximum Mean Discrepancy with Unequal Sample Sizes via Generalized U-Statistics
With unequal sample sizes, MMD estimators converge under min(nX,nY) scaling, so tests can use all available data instead of discarding surplus samples.
-
Keep your distance: learning dispersed embeddings on $\mathbb{S}_m$
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...
Discussion (0). Continue with ORCID to comment.