Guardado en:
Detalles Bibliográficos
Autores principales: de Cabrera, Ferran, Vilà-Insa, Marc, Riba, Jaume
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:https://arxiv.org/abs/2410.15888
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866929752117346304
author de Cabrera, Ferran
Vilà-Insa, Marc
Riba, Jaume
author_facet de Cabrera, Ferran
Vilà-Insa, Marc
Riba, Jaume
contents The problem of measuring conditional dependence between two random phenomena arises when a third one (a confounder) has a potential influence on the amount of information between them. A typical issue in this challenging problem is the inversion of ill-conditioned autocorrelation matrices. This paper presents a novel measure of conditional dependence based on the use of incomplete unbiased statistics of degree two, which allows to re-interpret independence as uncorrelatedness on a finite-dimensional feature space. This formulation enables to prune data according to observations of the confounder itself, thus avoiding matrix inversions altogether. The proposed approach is articulated as an extension of the Hilbert-Schmidt independence criterion, which becomes expressible through kernels that operate on 4-tuples of data.
format Preprint
id arxiv_https___arxiv_org_abs_2410_15888
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Conditional Dependence via U-Statistics Pruning
de Cabrera, Ferran
Vilà-Insa, Marc
Riba, Jaume
Machine Learning
Information Theory
G.3
The problem of measuring conditional dependence between two random phenomena arises when a third one (a confounder) has a potential influence on the amount of information between them. A typical issue in this challenging problem is the inversion of ill-conditioned autocorrelation matrices. This paper presents a novel measure of conditional dependence based on the use of incomplete unbiased statistics of degree two, which allows to re-interpret independence as uncorrelatedness on a finite-dimensional feature space. This formulation enables to prune data according to observations of the confounder itself, thus avoiding matrix inversions altogether. The proposed approach is articulated as an extension of the Hilbert-Schmidt independence criterion, which becomes expressible through kernels that operate on 4-tuples of data.
title Conditional Dependence via U-Statistics Pruning
topic Machine Learning
Information Theory
G.3
url https://arxiv.org/abs/2410.15888