Optimal Rates for Regularized Conditional Mean Embedding Learning

Zhu Li, Dimitri Meunier, Mattes Mollenhauer, Arthur Gretton
8/2/2022
stat.MLcs.LG

No confident code implementation found for this paper.

Abstract

We address the consistency of a kernel ridge regression estimate of the conditional mean embedding (CME), which is an embedding of the conditional distribution of $Y$ given $X$ into a target reproducing kernel Hilbert space $\mathcal{H}_Y$. The CME allows us to take conditional expectations of target RKHS functions, and has been employed in nonparametric causal and Bayesian inference. We address the misspecified setting, where the target CME is in the space of Hilbert-Schmidt operators acting from an input interpolation space between $\mathcal{H}_X$ and $L_2$, to $\mathcal{H}_Y$. This space of operators is shown to be isomorphic to a newly defined vector-valued interpolation space. Using this isomorphism, we derive a novel and adaptive statistical learning rate for the empirical CME estimator under the misspecified setting. Our analysis reveals that our rates match the optimal $O(\log n / n)$ rates without assuming $\mathcal{H}_Y$ to be finite dimensional. We further establish a lower bound on the learning rate, which shows that the obtained upper bound is optimal.

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{li2022optimal,
  title  = {Optimal Rates for Regularized Conditional Mean Embedding Learning},
  author = {Zhu Li and Dimitri Meunier and Mattes Mollenhauer and Arthur Gretton},
  year   = {2022},
  eprint = {2208.01711},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2208.01711v3}
}

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/2208.01711.svg)](https://codeofpaper.com/paper/2208.01711)

Discussion