The Minimax Rate of HSIC Estimation for Translation-Invariant Kernels

Kernel techniques are among the most influential approaches in data science and statistics. Under mild conditions, the reproducing kernel Hilbert space associated to a kernel is capable of encoding the independence of $M\ge 2$ random variables. Probably the most widespread independence measure relying on kernels is the so-called Hilbert-Schmidt independence criterion (HSIC; also referred to as distance covariance in the statistics literature). Despite various existing HSIC estimators designed since its introduction close to two decades ago, the fundamental question of the rate at which HSIC can be estimated is still open. In this work, we prove that the minimax optimal rate of HSIC estimation on $\mathbb R^d$ for Borel measures containing the Gaussians with continuous bounded translation-invariant characteristic kernels is $\mathcal O\!\left(n^{-1/2}\right)$. Specifically, our result implies the optimality in the minimax sense of many of the most-frequently used estimators (including the U-statistic, the V-statistic, and the Nystr\"om-based one) on $\mathbb R^d$.

Paper

Similar papers

Peer review

Reviewer g9Na7/10 · confidence 4/52024-06-30

Summary

This paper studies the statistical property of Hilbert Schmidt Independence Criterion (HSIC). Specifically, under either Gaussian or continuous bounded translation-invariant characteristic kernel that is defined on $\mathbb{R}^d$, the paper prove that HSIC can be estimated at the optimal rate in the minimax sense. The minimax lower bound is obtained via the Le Cam's method, where the authors find two distributions that are close in the KL divergence sense, but is dissimilar in the HSIC sense. Their results further demonstrates that many empirical estimators in literature is minimax optimal.

Strengths

This paper provides the first minimax optimal rate for HSIC learing, via obtaining the information theoretical lower bound. This is an important contribution the litearture since HSIC is widely used for independence test. A minor contribution is that the authors derive the closed form formula of HSIC under the Gaussian setting. In proving the lower bound for the translation invariant kernel case, the authors restrict the integration of to be computed in a subset of $\mathbb{R}^d$, thereby obtaining a lower bound on the HSIC between $P_{\theta_1}$ and $P_{\theta_0}$. To me this is novel.

Weaknesses

While the authors explain how they obtain the lower bound via Le Cam's method, I would more appreciate if the authors can briefly explain the main technical challenge in proving the lower bound. It seems that the lower bound proof is a straight forward application of Le Cam's approach. It seems that in Zhou et al., (2019), they also obtain the lower bound for the centred covariance operator $C_{XX}$. The definition of $C_{XX}$ is similar to the HSIC setting and the lower bound is almost the same. I would appreciate the authors to provide more discussion on the difference between the two settings and how the proof is different from Zhou et al., (2019).

Questions

See weakness

Rating

7

Confidence

4

Soundness

3

Presentation

4

Contribution

3

Limitations

NA

Reviewer tUTX5/10 · confidence 3/52024-07-10

Summary

In this work, the authors prove that the minimax optimal rate of HSIC estimation on $\mathbb R^{d}$ for Borel measures containing the Gaussians with continuous bounded translation-invariant characteristic kernels is $n^{-1/2}$.

Strengths

Testing whether a pair of random variables are independent is the central problem in statistics or machine learning community. There are lots of independence tests proposed in past years such as distance correlation, dynamic slicing, etc. The author established the minimax lower bound \( \Omega(n^{-1/2}) \) of HSIC estimation with \( M \geq 2 \) components on \( \mathbb{R}^d \) with continuous bounded translation-invariant characteristic kernels. As this lower bound matches the known upper bounds of the existing "classical" U-statistic and V-statistic-based estimators, and that of the Nyström HSIC estimator, their result settles their minimax optimality. Establishing minimax rates is often deemed a challenging task. Given that the result sounds solid, I consider this a noteworthy result.

Weaknesses

Due to my ignorance, I may not be able to provide a sufficient evaluation of the importance of this problem. It would be easier for me to evaluate its importance if the author could offer more related literature and a comparison with them.

Questions

There are some minor issues. Can the author provide a more concrete definition of HSIC? For example, in equation (2), does it imply that we have fixed a decomposition $d=d_{1}+...+d_{M}$ and $P_{m}$ is the marginal distribution of P on $R^{d_{m}}$.? ​

Rating

5

Confidence

3

Soundness

3

Presentation

3

Contribution

3

Limitations

None

Reviewer 6YpR6/10 · confidence 2/52024-07-15

Summary

The rate at which HSIC can be estimated is an important and open problem, in this paper, the authors prove that the minimax optimal rate of HSIC estimation for Borel measures is $\mathcal{O}(n^{-0.5})$ with M>=2 components, which is very important as existing conclusion only holds for M=2. Other byproducts can be naturally introduced, implying the minimax lower bound for the estimation of cross-covariance operator, which can be further specialized to get back the minimax result on the estimation of the covariance operator.

Strengths

1. The paper answers an important while open problem which may be very important for the community and generalizes the existing result from M=2 to M>=2. 2. The paper's structure is clear and well organized. 3. The paper is solid and mathematically heavy, the proof is provided with details.

Weaknesses

1. Overall, the paper is not easy to follow as the paper's main contribution seems to be the proof part. 2. I wouldn't say it is the weakness or the author's problem, as this is a theoretical paper, experiments are not necessary. Still is it possible to design toy experiments to validate the conclusions in the paper?

Questions

NA

Rating

6

Confidence

2

Soundness

3

Presentation

2

Contribution

3

Limitations

NA

Program Chairsdecision2024-09-25

Decision

Accept (poster)

© 2026 NYSGPT2525 LLC