# kernel Dimension Reduction in Regression

The problem of Sufficient Dimension Reduction(SDR) for regression is to find a subspace such that covariates are conditionally independent given the subspace. In classical SDR regression methods, marginal distribution of explanatory variables are needed to calculate the independency measurement. This paper proposes that conditional independence can be characterized in terms of conditional covariance operators on Reproducing Kernel Hilbert Spaces(RKHS). This is the first few papers on independency measurement in RKHS(Other recent methods are the RHIC and dCor).

## Sufficient Dimension Reduction(SDR)

The problem of SDR for regression is that of finding a subspace S such that the projection of the covariate vector X onto S captures the statistical dependency of the response Y on X[ref]. That is: $Y\perp X | \Pi_S X$ Where $\Pi_S X$ denotes the orthogonal projection of X on to S. performing a regression of X on Y generally requires making assumptions with respect to the probability distribution of X which can be hard to justify[ref]. Most of the previous regression methods assume linearity between projected X and Y. This assumption only stand when the distribution of X is elliptic.

## Cross-covariance operator

Cross-covariance operator is first propose by (Baker,1973). It can be used to measure the relations between probability measures on two RKHSs. Define two RKHSs $H_1$ and $H_2$ with inner product $\lt .,.\gt _1$, $\lt .,.\gt _2$. A probability measure $\mu_i$ on $H_i,i=1,2$ that satisfies

$\int_{H_i}||x||_i^2d\mu_i(x)\lt \infty$

defines an operator $R_i$ in $H_i$ by

$\lt R_iu,v\gt =\int_{H_i}\lt x-m_i,u\gt _i\lt x-m_i,v\gt _id\mu_i(x)$

$R_i$ is called covariance operator, if u and v are in different RKHS, then $R_i$ is called cross-covariance operator.

## Kernel Dimension Reduction for Regression

This paper calculate conditional independency measurements by using conditional covariance operators in RKHS. No strong assumptions are needed on $P_{\Pi_S}(Y|\Pi_S X)$ or P(X). Let $(H_x,k_x)$ and $(H_y,k_y)$ be RKHS's of functions on X and Y. The cross-covariance operator of (X,Y) from $H_x$ to $H_y$ can be defined as

$\lt \sum{_{YX}}f , g\gt _{H_y} = E_{XY}[(f(X)-E_X{[f(X)]})(g(Y)-E_Y{[g(Y)]})]$

It holds for all f in Hx and g in Hy. $\sum{_{XX}},\sum{_{YY}}$can be defined likewise. A important theorem is that

$\sum{_{YY|X}}=\sum{_{YY}}-\sum{_{YX}}\sum{_{XX}}^{-1}\sum{_{XY}}$

Now assume a unknown projection matrix B that projects n dimensional X into a d dimensional subspace U by $U=B^TX$ The SDR criterion can be rewrite to $B = \arg \min_B \sum{_{YY|U}}$ It makes sense that when U captures most of the relationship between X and Y, given U, Y is much determined, so the conditional covariance operator should be small. It can be proved that when $\sum{_{YY|U}}=\sum{_{YY|X}}$, X and Y are conditionally independent given U, and $\sum{_{YY|U}}\gt \sum{_{YY|X}}$.

Define $\tilde{k_1}^{(i)} \in H_1$ by $\tilde{k_i}^{(i)}=K_1(\cdot,Y_i)-\frac{1}{n}\sum_{j=1}^{n}K_1(\cdot,Y_j)$. $\tilde{k_1}^{(i)} \in H_2$ similarly using $U$. Notice The relationship between space U and space X is $K_2(B^Tx,B^T\tilde{x})=K_x{x,\tilde{x}}$. Optimize B can be done by optimize U and derive B from U from there relationship.

replace the expectation with the empirical average,

$\lt f, \sum{_{YU}}g\gt _{H_1} \approx \frac{1}{n}\sum_{i=1}^n \lt \tilde{k_1}^{(i)},f\gt \lt \tilde{k_2}^{(i)},g\gt .$

Let $\hat{K_Y}$ be the centralized Gram matrix,

$\hat{K_Y}=(I_n-\frac{1}{n}1_n1_n^T)G_Y(I_n-\frac{1}{n}1_n1_n^T)$ in which $1_n=(1,1,...,1)^T$

Then it's easy to see that

$\lt \tilde{k_1}^{(i)},\tilde{k_1}^{(j)}\gt =\hat{K_Y}$

$\lt \tilde{k_2}^{(i)},\tilde{k_2}^{(j)}\gt =\hat{K_U}$

if we approximate f and g as

$f=\sum_{l=1}{n}a_l\tilde{k_1}^{(l)}$

$g=\sum_{m=1}{n}b_m\tilde{k_2}^{(m)}$

Then the covariance is approximated by

$\lt f,\sum{_{YU}}g\gt _{H_1}=\sum_{l=1}{n}\sum_{m=1}{n}a_lb_m(\hat{K}_Y\hat{K}_U)_{lm}$

That is $\sum{_{YU}}=\hat{K}_Y\hat{K}_U$.

$\sum{_{YY}}$ and $\sum{_{UU}}$ can be estimated similarly except a regulation need to be added to make sure the optimization gives a useful result[ref]. The empirical conditional covariance matrix is then estimate by

$\sum{_{YY|U}}:=\hat{\sum}{_{YY}}-\hat{\sum}{_{YU}}(\hat{\sum}{_{UU}}+\varepsilon_nI)^{-1}\hat{\sum}{_{UY}}$

## Optimization

Minimize this conditional covariance matrix on U, then B can be derived. The "size" of this conditional covariance matrix can be evaluated by it's trace,

## Test Results

The results are evaluated by $B_0B_0^T-\hat{B}\hat{B}^T$_F where $B_0$ and $\hat{B}$ are the true subspace and estimated subspace respectively. Gaussian RBF kernel $exp(-||z_1-z_2||^2/c)$ is used. $c=0.5$. $\varepsilon=0.1$. E follows a standard Gaussian Distribution $N(0,1)$

Three regression functions:

(A) $Y=\frac{X_1}{0.5+(X_2+1.5)^2}+(1+X_2)^2\lt +\sigma E$

(B) $Y=sin^2(\pi X_2+1)+\sigma E$

(C) $Y=\frac{1}{2}(X_1-a)^2E$

The next three tables are the regression results in comparison with three other SDR algorithms

## Discussion

The author is the fist few people who proposed to use RKHS for independency measurement. The main improvement to previous methods is that the independency is measured in RKHS, it implicitly tested all possible functions between Y and X. No linearity or distribution assumption is needed.

## References

[1] Fukumizu, Kenji, Francis R. Bach, and Michael I. Jordan. "Kernel dimension reduction in regression." The Annals of Statistics 37.4 (2009): 1871-1905.

[2] Fukumizu, Kenji, Francis R. Bach, and Michael I. Jordan. "Dimensionality reduction for supervised learning with reproducing kernel Hilbert spaces." The Journal of Machine Learning Research 5 (2004): 73-99.

[3] Bach, Francis R., and Michael I. Jordan. "Kernel independent component analysis." The Journal of Machine Learning Research 3 (2003): 1-48.

[4] Baker, Charles R. "Joint measures and cross-covariance operators." Transactions of the American Mathematical Society 186 (1973): 273-289.