REVIEW 2 cited by
Nonparametric approximation of conditional expectation operators
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Given the joint distribution of two random variables $X,Y$ on some second countable locally compact Hausdorff space, we investigate the statistical approximation of the $L^2$-operator defined by $[Pf](x) := \mathbb{E}[ f(Y) \mid X = x ]$ under minimal assumptions. By modifying its domain, we prove that $P$ can be arbitrarily well approximated in operator norm by Hilbert-Schmidt operators acting on a reproducing kernel Hilbert space. This fact allows to estimate $P$ uniformly by finite-rank operators over a dense subspace even when $P$ is not compact. In terms of modes of convergence, we thereby obtain the superiority of kernel-based techniques over classically used parametric projection approaches such as Galerkin methods. This also provides a novel perspective on which limiting object the nonparametric estimate of $P$ converges to. As an application, we show that these results are particularly important for a large family of spectral analysis techniques for Markov transition operators. Our investigation also gives a new asymptotic perspective on the so-called kernel conditional mean embedding, which is the theoretical foundation of a wide variety of techniques in kernel-based nonparametric inference.
Forward citations
Cited by 2 Pith papers
-
Nonparametric Sparse Online Learning of the Koopman Operator
Develops a nonparametric sparse online algorithm to learn the Koopman operator iteratively via stochastic approximation with explicit complexity control and convergence guarantees in misspecified RKHS settings via con...
-
Sobolev Norm Learning Rates for Conditional Mean Embeddings
Derives adaptive Sobolev-norm learning rates for conditional mean embeddings in misspecified RKHS settings, achieving uniform convergence in some regimes.
Discussion (0). Sign in to comment.