Azadkia-Chatterjee's dependence coefficient for infinite dimensional data

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Hörmann, Siegfried, Strenger, Daniel
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909456743268352
author Hörmann, Siegfried
Strenger, Daniel
author_facet Hörmann, Siegfried
Strenger, Daniel
contents We extend the scope of Azadkia-Chatterjee's dependence coefficient between a scalar response $Y$ and a multivariate covariate $X$ to the case where $X$ takes values in a general metric space. Particular attention is paid to the case where $X$ is a curve. Although extending this framework at the population level is relatively straightforward, analyzing the asymptotic behavior of the estimator proves to be complex. This complexity is largely related to the nearest neighbor structure of the infinite-dimensional covariate sample, leading us to explore a topic that has not been previously addressed in the literature. The primary contribution of this paper is to provide insights into this issue and propose strategies to address it. Our findings also have significant implications for other graph-based methods facing similar challenges.
format Preprint
id arxiv_https___arxiv_org_abs_2405_07732
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Azadkia-Chatterjee's dependence coefficient for infinite dimensional data
Hörmann, Siegfried
Strenger, Daniel
Statistics Theory
Probability
Primary 62H20, 62R10, secondary 62G05
We extend the scope of Azadkia-Chatterjee's dependence coefficient between a scalar response $Y$ and a multivariate covariate $X$ to the case where $X$ takes values in a general metric space. Particular attention is paid to the case where $X$ is a curve. Although extending this framework at the population level is relatively straightforward, analyzing the asymptotic behavior of the estimator proves to be complex. This complexity is largely related to the nearest neighbor structure of the infinite-dimensional covariate sample, leading us to explore a topic that has not been previously addressed in the literature. The primary contribution of this paper is to provide insights into this issue and propose strategies to address it. Our findings also have significant implications for other graph-based methods facing similar challenges.
title Azadkia-Chatterjee's dependence coefficient for infinite dimensional data
topic Statistics Theory
Probability
Primary 62H20, 62R10, secondary 62G05
url https://arxiv.org/abs/2405.07732