The Minimax Rate of HSIC Estimation for Translation-Invariant Kernels

Florian Kalinke, Zoltan Szabo
3/12/2024
math.STcs.ITcs.LG

No confident code implementation found for this paper.

Abstract

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öm-based one) on $\mathbb R^d$.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kalinke2024minimax,
  title  = {The Minimax Rate of HSIC Estimation for Translation-Invariant Kernels},
  author = {Florian Kalinke and Zoltan Szabo},
  year   = {2024},
  eprint = {2403.07735},
  archivePrefix = {arXiv},
  doi    = {10.48550/arXiv.2403.07735},
  url    = {http://arxiv.org/abs/2403.07735v2},
  journal = {NEURIPS 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.07735.svg)](https://codeofpaper.com/paper/2403.07735)

Discussion