Conditional Mean Embedding in RKHS

• Conditional Mean Embedding is the RKHS representation of conditional distributions that recovers conditional expectations via inner products.
• It enables nonparametric inference by converting conditioning into a linear algebra operation through covariance operators and regularized regression.
• Its framework unites probabilistic calculus with applications in regression, causal inference, and robust control, ensuring effective use of kernel methods.

Searching arXiv for the cited CME papers to ground the article in current arXiv records. {"query":"Conditional mean embedding arXiv (Muandet et al., 2016, Klebanov et al., 2019, Park et al., 2020, Grünewälder et al., 2012, Li et al., 2022)", "max_results": 10} Conditional mean embedding (CME) is the reproducing-kernel-Hilbert-space representation of a conditional distribution. Given random variables $X$ and $Y$, it associates to each conditioning value $x$ an element $\mu_{Y\mid X=x}\in H_Y$ such that conditional expectations of RKHS test functions are recovered by inner products, thereby turning conditioning into a linear-algebraic operation in Hilbert space. In the broader kernel mean embedding program, this extends marginal distribution embeddings to conditional laws and supports nonparametric probabilistic inference, including sum, product, and Bayes’ rules, without explicit density estimation (Muandet et al., 2016, Park et al., 2020).

1. Formal definition and operator formulations

Let $k_X$ and $k_Y$ be positive definite kernels on $\mathcal{X}$ and $\mathcal{Y}$, with RKHSs $H_X$ and $H_Y$, and canonical feature maps $Y$0 and $Y$1. The marginal kernel mean embedding is

$Y$2

and, under the reproducing property, $Y$3 for all $Y$4. The conditional mean embedding is the $Y$5-valued conditional expectation

$Y$6

so that

$Y$7

for all $Y$8. In the measure-theoretic formulation, $Y$9 is an $x$0-valued random variable measurable with respect to $x$1, and there exists a measurable function $x$2 such that $x$3 (Park et al., 2020).

A standard operator-theoretic presentation defines covariance and cross-covariance operators

$x$4

or their centered analogues. In the uncentered formulation one writes

$x$5

A rigorous centered treatment replaces this naive identity by

$x$6

with Moore–Penrose pseudoinverse and explicit mean terms. This distinction matters: centered and uncentered CMEs are not interchangeable, and the corrected centered formula avoids the independence pathology of the naive expression (Klebanov et al., 2019, Muandet et al., 2016).

A recurrent misconception is that CME is merely the formal inversion of $x$7. In infinite dimensions, $x$8 is compact and generally non-invertible, so pseudoinverses or regularization are intrinsic rather than incidental. A second misconception is that the pointwise formula alone defines the object. The measure-theoretic account instead treats CME first as a Bochner conditional expectation and only then recovers operator representations under additional range and regularity conditions (Klebanov et al., 2019, Park et al., 2020).

2. Empirical estimation and the regression viewpoint

Given samples $x$9, define the feature matrices

$\mu_{Y\mid X=x}\in H_Y$0

and Gram matrices $\mu_{Y\mid X=x}\in H_Y$1, $\mu_{Y\mid X=x}\in H_Y$2. The regularized empirical conditional operator is

$\mu_{Y\mid X=x}\in H_Y$3

equivalently

$\mu_{Y\mid X=x}\in H_Y$4

with centered versions obtained by inserting the centering matrix $\mu_{Y\mid X=x}\in H_Y$5. For a new $\mu_{Y\mid X=x}\in H_Y$6,

$\mu_{Y\mid X=x}\in H_Y$7

Hence, for $\mu_{Y\mid X=x}\in H_Y$8,

$\mu_{Y\mid X=x}\in H_Y$9

where $k_X$0 (Muandet et al., 2016).

A central structural result is that the standard CME estimator is exactly the solution of a vector-valued regression problem. With operator-valued kernel

$k_X$1

the estimator minimizes

$k_X$2

and the representer solution is

$k_X$3

This equivalence supplies a loss-based interpretation of CME, permits standard model-selection procedures such as cross-validation, and leads to sparse estimators through a matrix Lasso formulation that penalizes a surrogate of the RKHS approximation error (Grünewälder et al., 2012).

The regression perspective also clarifies what the estimator is optimizing when the conditional expectation operator is misspecified. In that setting, surrogate regression risk still controls the direct conditional-expectation risk, but exact coincidence requires representability conditions in the chosen vector-valued RKHS (Grünewälder et al., 2012).

3. Conditional probabilistic calculus in RKHS

The operational significance of CME is that elementary rules of probabilistic calculus become linear operations on embeddings. The kernel sum rule takes the form

$k_X$4

which is the RKHS analogue of the law of total expectation. The kernel product rule expresses the joint mean embedding through conditional operators and second-moment embeddings: $k_X$5 or, at operator level,

$k_X$6

Kernel Bayes’ rule then defines a posterior embedding from prior embeddings $k_X$7 and $k_X$8: $k_X$9 with a robust regularization

$k_Y$0

when $k_Y$1 is not positive definite (Muandet et al., 2016).

These identities explain why CME has been used for nonparametric probabilistic inference in graphical models, filtering in dynamical systems, and reinforcement learning. In each case, inference is phrased as manipulations of RKHS elements rather than explicit densities, which is especially useful for non-Gaussian continuous variables (Muandet et al., 2016).

Closely related objects include Hilbert–Schmidt covariance operators and dependence measures such as HSIC, $k_Y$2. In the conditional setting, the measure-theoretic theory yields conditional analogues of both maximum mean discrepancy and HSIC. Maximum conditional mean discrepancy compares conditional embeddings pointwise, while the Hilbert–Schmidt conditional independence criterion is based on the conditional joint embedding minus the tensor product of conditional marginals; under characteristic kernels, vanishing conditional discrepancy characterizes equality of conditional laws, and vanishing conditional HSIC characterizes conditional independence (Park et al., 2020).

4. Existence, regularization, and statistical rates

At minimum, CME requires integrability of RKHS-valued feature maps. For marginal embeddings, $k_Y$3 ensures existence; for covariance operators, $k_Y$4 and $k_Y$5 imply that $k_Y$6 and $k_Y$7 are Hilbert–Schmidt. Under the condition that $k_Y$8 for all $k_Y$9, one has the operator identity

$\mathcal{X}$0

which motivates the operator $\mathcal{X}$1 on the appropriate range. In practice, regularization is unavoidable because $\mathcal{X}$2 is compact and often nearly singular (Muandet et al., 2016).

For empirical covariance operators, centered estimators satisfy

$\mathcal{X}$3

For Tikhonov-regularized CME, a standard pointwise rate is

$\mathcal{X}$4

and under eigenvalue decay $\mathcal{X}$5, the rate

$\mathcal{X}$6

is achievable with an appropriate choice of $\mathcal{X}$7. Kernel Bayes’ rule posterior expectations also converge in probability, with rates depending on prior mean estimation accuracy (Muandet et al., 2016).

The vector-valued regression formulation sharpens this picture. It yields minimax upper rates ranging from $\mathcal{X}$8 in favorable regimes to $\mathcal{X}$9 in harder infinite-dimensional regimes, together with lower bounds showing near-optimality up to logarithmic factors. These results are obtained under milder and more interpretable assumptions than earlier operator-smoothness conditions (Grünewälder et al., 2012).

More recent analyses place CME in interpolation or Sobolev-type scales between $\mathcal{Y}$0 and $\mathcal{Y}$1. In the misspecified setting, where the target operator need not be Hilbert–Schmidt on the original input RKHS, one obtains adaptive convergence rates in Sobolev norms and, in some parameter regimes, uniform convergence in the output RKHS (Talwai et al., 2021). A complementary line of work introduces vector-valued interpolation spaces and proves optimal rates for regularized CME learning in the misspecified setting, including $\mathcal{Y}$2 in favorable regimes without assuming $\mathcal{Y}$3 to be finite-dimensional, as well as matching lower bounds (Li et al., 2022).

Characteristic and universal kernels play a special role in identifiability. Characteristic kernels make the mean map injective, and universal kernels are characteristic on compact domains. Gaussian and Laplace kernels are characteristic on $\mathcal{Y}$4, and Gaussian or Laplace kernels are universal on compact sets. At the same time, characteristic kernels are not strictly necessary for every downstream task; they are sufficient for uniqueness, but some predictive objectives can be solved without full injectivity (Muandet et al., 2016).

5. Reinterpretations, computational variants, and recent extensions

One major development is the operator-free, measure-theoretic formulation of kernel conditional mean embeddings. In that approach, CME is defined directly as the Bochner conditional expectation $\mathcal{Y}$5, and the familiar regularized estimator is recovered from vector-valued kernel ridge regression rather than postulated as a population operator identity. The same framework naturally yields conditional versions of MMD and HSIC (Park et al., 2020).

A second reinterpretation comes from the linear conditional expectation in Hilbert spaces. There, CME appears as the Bayes linear, or best affine, estimator in feature space. Under compatible range conditions, the regularized affine minimizer is

$\mathcal{Y}$6

and exactness follows under approximation assumptions labelled $\mathcal{Y}$7 and $\mathcal{Y}$8. This yields an alternative justification of CME through Gaussian conditioning and affine Hilbert–Schmidt regularization (Klebanov et al., 2020).

Algorithmically, several directions address scalability and representation quality. A recursive estimator in a Bochner $\mathcal{Y}$9 space updates the conditional mean map by local averaging,

$H_X$0

and is shown to be weakly and strongly $H_X$1-consistent on locally compact Polish spaces, including Euclidean spaces, Riemannian manifolds, and locally compact subsets of function spaces (Tamás et al., 2023).

Neural parameterizations replace the classical inverse $H_X$2 by end-to-end learned coefficients on output-kernel atoms. In Neural-Kernel CME,

$H_X$3

and the per-sample RKHS loss is

$H_X$4

This avoids the $H_X$5 Gram inversion of classical CME, supports conditional density estimation through Gaussian density kernels, and leads naturally to a distributional reinforcement-learning objective based on MMD (Shimizu et al., 2024).

Other recent extensions optimize the kernel itself or compress conditional structure directly. Operator-theoretic kernel selection over convex sets of positive definite kernels uses spectral criteria to construct task-adapted feature representations for CME (Jorgensen et al., 2023). Conditional distribution compression introduces the Average Maximum Conditional Mean Discrepancy,

$H_X$6

and develops Average Conditional Kernel Herding and Average Conditional Kernel Inducing Points to compress labelled datasets while preserving conditional structure (Broadbent et al., 14 Apr 2025).

In dynamical systems, the CME operator coincides with the Koopman operator restricted to an RKHS. This identity motivates online sparse learning algorithms for the Koopman operator under trajectory-based sampling, with last-iterate guarantees under mixing and explicit control of compression error (Hou et al., 2024).

6. Applications across inference, causality, adaptation, and control

CME has become a general-purpose nonparametric inference primitive. In probabilistic graphical models it underlies kernel belief propagation, latent-tree methods, spectral hidden Markov models, and filtering in dynamical systems. In reinforcement learning it provides embedded transition models, RKHS Bellman operators, kernel value iteration, predictive state representations, and belief updates in partially observable settings through kernel Bayes’ rule (Muandet et al., 2016).

In causal inference, CME supports conditional distributional treatment-effect analysis beyond the conditional average treatment effect. With a characteristic outcome kernel $H_X$7, the MMD-associated conditional distributional treatment effect is

$H_X$8

and a conditional witness function

$H_X$9

localizes where treatment and control distributions differ. The same framework gives a kernel conditional discrepancy test for the null hypothesis $H_Y$0 almost everywhere, and a U-statistic regression scheme for conditional variance, skewness, Gini’s mean difference, and other higher-order functionals (Park et al., 2021).

More recent work extends this logic to counterfactual distributions directly. Conditional Counterfactual Mean Embeddings define

$H_Y$1

identify it through a doubly robust pseudo-outcome,

$H_Y$2

and establish rates of the form

$H_Y$3

which formalize double robustness at the level of conditional distribution embeddings (Anancharoenkij et al., 4 Feb 2026).

In domain adaptation, CME ideas are often operationalized through class-conditional alignment rather than explicit operator inversion. In wearable human action recognition, one recent method aligns source and target class-conditional mean embeddings by minimizing a kernel-based class-wise conditional MMD,

$H_Y$4

with pseudo-labels stabilized by temporal ensembling and consistency regularization (Ghosh et al., 2024).

In robust control, CME embeds transition kernels and uses MMD balls around empirical conditional embeddings as ambiguity sets: $H_Y$5 The inner robust expectation then becomes the support function of an RKHS ball,

$H_Y$6

which yields tractable distributionally robust Bellman updates. Under suitable compactness and continuity assumptions, the resulting finite-horizon min–max problem admits deterministic Markov optimal policies (Romao et al., 2023).

Across these uses, CME functions less as a single estimator than as a unifying representation: conditional laws become RKHS elements, inference becomes operator algebra, and conditional distribution learning interfaces naturally with regression, dependence testing, Bayesian updating, control, and modern neural architectures. This suggests that the enduring significance of conditional mean embedding lies in its role as a common Hilbert-space language for nonparametric conditional inference (Muandet et al., 2016).