# Adaptive test of independence based on HSIC measures

**Authors:** M\'elisande Albert (IMT, INSA Toulouse), B\'eatrice Laurent (IMT, INSA, Toulouse), Amandine Marrel, Anouar Meynaoui (IMT, INSA Toulouse)

arXiv: 1902.06441 · 2021-01-13

## TL;DR

This paper introduces an adaptive HSIC-based independence test that automatically selects kernels with theoretical guarantees, improving over existing methods by providing minimax optimality and practical efficiency.

## Contribution

It develops a new kernel aggregation procedure for HSIC tests that is adaptive and theoretically optimal over Sobolev and Nikol'skii spaces.

## Key findings

- The aggregated test achieves minimax optimal separation rates.
- The procedure is adaptive over regularity spaces.
- Numerical studies show improved performance over existing tests.

## Abstract

Dependence measures based on reproducing kernel Hilbert spaces, also known as Hilbert-Schmidt Independence Criterion and denoted HSIC, are widely used to statistically decide whether or not two random vectors are dependent. Recently, non-parametric HSIC-based statistical tests of independence have been performed. However, these tests lead to the question of the choice of the kernels associated to the HSIC. In particular, there is as yet no method to objectively select specific kernels with theoretical guarantees in terms of first and second kind errors. One of the main contributions of this work is to develop a new HSIC-based aggregated procedure which avoids such a kernel choice, and to provide theoretical guarantees for this procedure. To achieve this, we first introduce non-asymptotic single tests based on Gaussian kernels with a given bandwidth, which are of prescribed level $\alpha \in (0,1)$. From a theoretical point of view, we upper-bound their uniform separation rate of testing over Sobolev and Nikol'skii balls. Then, we aggregate several single tests, and obtain similar upper-bounds for the uniform separation rate of the aggregated procedure over the same regularity spaces. Another main contribution is that we provide a lower-bound for the non-asymptotic minimax separation rate of testing over Sobolev balls, and deduce that the aggregated procedure is adaptive in the minimax sense over such regularity spaces. Finally, from a practical point of view, we perform numerical studies in order to assess the efficiency of our aggregated procedure and compare it to existing independence tests in the literature.

## Figures

20 figures with captions in the complete paper: https://tomesphere.com/paper/1902.06441/full.md

---
Source: https://tomesphere.com/paper/1902.06441