The reviewed record of science sign in
Pith

arxiv: 2005.06006 · v5 · pith:E4TK26KC · submitted 2020-05-12 · math.ST · stat.ME· stat.TH

High Probability Lower Bounds for the Total Variation Distance

Reviewed by Pithpith:E4TK26KCopen to challenge →

classification math.ST stat.MEstat.TH
keywords boundsclassification-baseddifferencedistancedistributionallowertesttotal
0
0 comments X
read the original abstract

The statistics and machine learning communities have recently seen a growing interest in classification-based approaches to two-sample testing. The outcome of a classification-based two-sample test remains a rejection decision, which is not always informative since the null hypothesis is seldom strictly true. Therefore, when a test rejects, it would be beneficial to provide an additional quantity serving as a refined measure of distributional difference. In this work, we introduce a framework for the construction of high-probability lower bounds on the total variation distance. These bounds are based on a one-dimensional projection, such as a classification or regression method, and can be interpreted as the minimal fraction of samples pointing towards a distributional difference. We further derive asymptotic power and detection rates of two proposed estimators and discuss potential uses through an application to a reanalysis climate dataset.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.