Detecting practically significant dependencies in metric spaces via distance correlations
Holger Dette, Marius Kroll

TL;DR
This paper develops a practical hypothesis test for determining whether the dependence between two metric-space-valued variables exceeds a meaningful threshold, accommodating dependent data and providing confidence intervals without resampling.
Contribution
It introduces a pivotal test for practically significant dependencies using distance correlation, applicable to dependent data in metric spaces of strong negative type, with a new functional limit theorem.
Findings
The test controls type I error for dependent data.
It provides a data-driven measure of evidence against the null hypothesis.
The approach applies to Euclidean and functional data, including time series models.
Abstract
We take a different look at the problem of testing the independence of two metric-space-valued random variables using the distance correlation. Instead of testing if the distance correlation vanishes exactly, we are interested in the hypothesis that it does not exceed a certain threshold. Our testing problem is motivated by the observation that in many cases it is more reasonable to test for a practically significant dependency since it is rare that a hypothesis of perfect independence is exactly satisfied. This point of view also reflects statistical practice, where one often classifies the strength of the association in categories such as `small', `medium' and `large' and the precise definitions depend on the specific application. To address these problems we develop a pivotal test for the hypothesis that the distance correlation between two random variables does not exceed a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnomaly Detection Techniques and Applications · Advanced Clustering Algorithms Research
