Permutation-Free High-Order Interaction Tests

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Liu, Zhaolu, Peach, Robert L., Barahona, Mauricio
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866912417314766848
author Liu, Zhaolu
Peach, Robert L.
Barahona, Mauricio
author_facet Liu, Zhaolu
Peach, Robert L.
Barahona, Mauricio
contents Kernel-based hypothesis tests offer a flexible, non-parametric tool to detect high-order interactions in multivariate data, beyond pairwise relationships. Yet the scalability of such tests is limited by the computationally demanding permutation schemes used to generate null approximations. Here we introduce a family of permutation-free high-order tests for joint independence and partial factorisations of $d$ variables. Our tests eliminate the need for permutation-based approximations by leveraging V-statistics and a novel cross-centring technique to yield test statistics with a standard normal limiting distribution under the null. We present implementations of the tests and showcase their efficacy and scalability through synthetic datasets. We also show applications inspired by causal discovery and feature selection, which highlight both the importance of high-order interactions in data and the need for efficient computational methods.
format Preprint
id arxiv_https___arxiv_org_abs_2506_05963
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Permutation-Free High-Order Interaction Tests
Liu, Zhaolu
Peach, Robert L.
Barahona, Mauricio
Methodology
Machine Learning
Kernel-based hypothesis tests offer a flexible, non-parametric tool to detect high-order interactions in multivariate data, beyond pairwise relationships. Yet the scalability of such tests is limited by the computationally demanding permutation schemes used to generate null approximations. Here we introduce a family of permutation-free high-order tests for joint independence and partial factorisations of $d$ variables. Our tests eliminate the need for permutation-based approximations by leveraging V-statistics and a novel cross-centring technique to yield test statistics with a standard normal limiting distribution under the null. We present implementations of the tests and showcase their efficacy and scalability through synthetic datasets. We also show applications inspired by causal discovery and feature selection, which highlight both the importance of high-order interactions in data and the need for efficient computational methods.
title Permutation-Free High-Order Interaction Tests
topic Methodology
Machine Learning
url https://arxiv.org/abs/2506.05963