Pith. sign in

REVIEW 1 cited by

On the Decreasing Power of Kernel and Distance based Nonparametric Hypothesis Tests in High Dimensions

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 1406.2083 v2 pith:HUO7MBWN submitted 2014-06-09 stat.ML cs.ITcs.LGmath.ITmath.STstat.MEstat.TH

classification stat.MLcs.ITcs.LGmath.ITmath.STstat.MEstat.TH
keywords nonparametricpowertestingtestsbeliefdimensiondimensionsfair
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper is about two related decision theoretic problems, nonparametric two-sample testing and independence testing. There is a belief that two recently proposed solutions, based on kernels and distances between pairs of points, behave well in high-dimensional settings. We identify different sources of misconception that give rise to the above belief. Specifically, we differentiate the hardness of estimation of test statistics from the hardness of testing whether these statistics are zero or not, and explicitly discuss a notion of "fair" alternative hypotheses for these problems as dimension increases. We then demonstrate that the power of these tests actually drops polynomially with increasing dimension against fair alternatives. We end with some theoretical insights and shed light on the \textit{median heuristic} for kernel bandwidth selection. Our work advances the current understanding of the power of modern nonparametric hypothesis tests in high dimensions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. SIDDA: SInkhorn Dynamic Domain Adaptation for Image Classification with Equivariant Neural Networks

    cs.LG 2025-01 conditional novelty 6.0 of 10

    SIDDA dynamically tunes Sinkhorn divergence regularization and loss weights during training, improving target-domain accuracy and calibration in image classification across simulated, galaxy, and remote-sensing datasets.

Pith tools