Sliced inverse regression (SIR) is a tool for dimension reduction in the field of multivariate statistics.
In statistics, regression analysis is a popular way of studying the relationship between a response variable y and its explanatory variable
x
_
, which is a pdimensional vector. There are several approaches which come under the term of regression. For example parametric methods include multiple linear regression; nonparametric techniques include local smoothing.
With highdimensional data (as p grows), the number of observations needed to use local smoothing methods escalates exponentially. Reducing the number of dimensions makes the operation computable. Dimension reduction aims to show only the most important directions of the data. SIR uses the inverse regression curve,
E
(
x
_

y
)
to perform a weighted principal component analysis, with which one identifies the effective dimension reducing directions.
This article first introduces the reader to the subject of dimension reduction and how it is performed using the model here. There is then a short review on inverse regression, which later brings these pieces together.
Given a response variable
Y
and a (random) vector
X
∈
R
p
of explanatory variables, SIR is based on the model
Y
=
f
(
β
1
⊤
X
,
…
,
β
k
⊤
X
,
ε
)
(
1
)
where
β
1
,
…
,
β
k
are unknown projection vectors.
k
is an unknown number (the dimensionality of the space we try to reduce our data to) and, of course, as we want to reduce dimension, smaller than
p
.
f
is an unknown function on
R
k
+
1
, as it only depends on
k
arguments, and
ε
is the error with
E
[
ε

X
]
=
0
and finite variance
σ
2
. The model describes an ideal solution, where
Y
depends on
X
∈
R
p
only through a
k
dimensional subspace. I.e. one can reduce to dimension of the explanatory variable from
p
to a smaller number
k
without losing any information.
An equivalent version of
(
1
)
is: the conditional distribution of
Y
given
X
depends on
X
only through the
k
dimensional random vector
(
β
1
⊤
X
,
…
,
β
k
⊤
X
)
. This perfectly reduced vector can be seen as informative as the original
X
in explaining
Y
.
The unknown
β
i
′
s
are called the effective dimension reducing directions (EDRdirections). The space that is spanned by these vectors is denoted the effective dimension reducing space (EDRspace).
To be able to visualize the model, note a short review on vector spaces:
For the definition of a vector space and some further properties I will refer to the article Linear Algebra and GramSchmidt Orthogonalization or any textbook in linear algebra and mention only the most important facts for understanding the model.
As the EDRspace is a
k
dimensional subspace, we need to know what a subspace is. A subspace of
R
n
is defined as a subset
U
∈
R
n
, if it holds that
a
_
,
b
_
∈
U
⇒
a
_
+
b
_
∈
U
a
_
∈
U
,
λ
∈
R
⇒
λ
a
_
∈
U
Given
a
_
1
,
…
,
a
_
r
∈
R
n
, then
V
:=
L
(
a
_
1
,
…
,
a
_
r
)
, the set of all linear combinations of these vectors, is called a linear subspace and is therefore a vector space. One says, the vectors
a
_
1
,
…
,
a
_
r
span
V
. But the vectors that span a space
V
are not unique. This leads us to the concept of a basis and the dimension of a vector space:
A set
B
=
{
b
_
1
,
…
,
b
_
r
}
of linear independent vectors of a vector space
V
is called basis of
V
, if it holds that
V
:=
L
(
b
_
1
,
…
,
b
_
r
)
The dimension of
V
(
∈
R
n
)
is equal to the maximum number of linearly independent vectors in
V
. A set of
n
linear independent vectors of
R
n
set up a basis of
R
n
. The dimension of a vector space is unique, as the basis itself is not. Several bases can span the same space. Of course also dependent vectors span a space, but the linear combinations of the latter can give only rise to the set of vectors lying on a straight line. As we are searching for a
k
dimensional subspace, we are interested in finding
k
linearly independent vectors that span the
k
dimensional subspace we want to project our data on.
The reason why we want to reduce the dimension of the data is due to the "curse of dimensionality" and of course, for graphical purposes. The curse of dimensionality is due to rapid increase in volume adding more dimensions to a (mathematical) space. For example, consider 100 observations from support
[
0
,
1
]
, which cover the interval quite well, and compare it to 100 observations from the corresponding
10
dimensional unit hypersquare, which are isolated points in a vast empty space. It is easy to draw inferences about the underlying properties of the data in the first case, whereas in the latter, it is not.
Computing the inverse regression curve (IR) means instead of looking for
E
[
Y

X
=
x
]
, which is a curve in
R
p
we calculate
E
[
X

Y
=
y
]
, which is also a curve in
R
p
, but consisting of
p
onedimensional regressions.
The center of the inverse regression curve is located at
E
[
E
[
X

Y
]
]
=
E
[
X
]
. Therefore, the centered inverse regression curve is
E
[
X

Y
=
y
]
−
E
[
X
]
which is a
p
dimensional curve in
R
p
. In what follows we will consider this centered inverse regression curve and we will see that it lies on a
k
dimensional subspace spanned by
Σ
x
x
β
i
′
s
.
But before seeing that this holds true, we will have a look at how the inverse regression curve is computed within the SIRAlgorithm, which will be introduced in detail later. What comes is the "sliced" part of SIR. We estimate the inverse regression curve by dividing the range of
Y
into
H
nonoverlapping intervals (slices), to afterwards compute the sample means
m
^
h
of each slice. These sample means are used as a crude estimate of the IRcurve, denoted as
m
(
y
)
. There are several ways to define the slices, either in a way that in each slice are equally much observations, or we define a fixed range for each slice, so that we then get different proportions of the
y
i
′
s
that fall into each slice.
As just mentioned, the centered inverse regression curve lies on a
k
dimensional subspace spanned by
Σ
x
x
β
i
′
s
(and therefore also the crude estimate we compute). This is the connection between our Model and Inverse Regression. We shall see that this is true, with only one condition on the design distribution that must hold. This condition is, that:
∀
b
_
∈
R
p
:
E
[
b
⊤
X

β
1
⊤
X
=
β
1
⊤
x
,
…
,
β
k
⊤
X
=
β
k
⊤
x
)
=
c
0
+
∑
i
=
1
k
c
i
β
i
⊤
x
I.e. the conditional expectation is linear in
β
1
X
,
…
,
β
k
X
, that is, for some constants
c
0
,
…
,
c
K
. This condition is satisfied when the distribution of
X
is elliptically symmetric (e.g. the normal distribution). This seems to be a pretty strong requirement. It could help, for example, to closer examine the distribution of the data, so that outliers can be removed or clusters can be separated before analysis.
Given this condition and
(
1
)
, it is indeed true that the centered inverse regression curve
E
[
X

Y
=
y
]
−
E
[
X
]
is contained in the linear subspace spanned by
Σ
x
x
β
k
(
k
=
1
,
…
,
K
)
, where
Σ
x
x
=
C
o
v
(
X
)
. The proof is provided by Duan and Li in Journal of the American Statistical Association (1991).
After having had a look at all the theoretical properties, our aim is now to estimate the EDRdirections. For that purpose, we conduct a (weighted) principal component analysis for the sample means
m
^
h
′
s
, after having standardized
X
to
Z
=
Σ
x
x
−
1
/
2
{
X
−
E
(
X
)
}
. Corresponding to the theorem above, the IRcurve
m
1
(
y
)
=
E
[
Z

Y
=
y
]
lies in the space spanned by
(
η
1
,
…
,
η
k
)
, where
η
i
=
Σ
x
x
1
/
2
β
i
. (Due to the terminology introduced before, the
η
i
′
s
are called the standardized effective dimension reducing directions.) As a consequence, the covariance matrix
c
o
v
[
E
[
Z

Y
]
]
is degenerate in any direction orthogonal to the
η
i
′
s
. Therefore, the eigenvectors
η
k
(
k
=
1
,
…
,
K
)
associated with the
K
largest eigenvalues are the standardized EDRdirections.
Back to PCA. That is, we calculate the estimate for
C
o
v
{
m
1
(
y
)
}
:
V
^
=
n
−
1
∑
i
=
1
S
n
s
z
¯
s
z
¯
s
⊤
and identify the eigenvalues
λ
^
i
and the eigenvectors
η
^
i
of
V
^
, which are the standardized EDRdirections. (For more details about that see next section: Algorithm.) Remember that the main idea of PC transformation is to find the most informative projections that maximize variance!
Note that in some situations SIR does not find the EDRdirections. One can overcome this difficulty by considering the conditional covariance
C
o
v
(
X

Y
)
. The principle remains the same as before, but one investigates the IRcurve with the conditional covariance instead of the conditional expectation. For further details and an example where SIR fails, see Härdle and Simar (2003).
The algorithm to estimate the EDRdirections via SIR is as follows. It is taken from the textbook Applied Multivariate Statistical Analysis (Härdle and Simar 2003)
1. Let
Σ
x
x
be the covariance matrix of
X
. Standardize
X
to
Z
=
Σ
x
x
−
1
/
2
{
X
−
E
(
X
)
}
(We can therefore rewrite
(
1
)
as
Y
=
f
(
η
1
⊤
Z
,
…
,
η
k
⊤
Z
,
ε
)
where
η
k
=
β
k
Σ
x
x
1
/
2
∀
k
For the standardized variable Z it holds that
E
[
Z
]
=
0
and
C
o
v
(
Z
)
=
I
.)
2. Divide the range of
y
i
into
S
nonoverlapping slices
H
s
(
s
=
1
,
…
,
S
)
.
n
s
is the number of observations within each slice and
I
H
s
the indicator function for this slice:
n
s
=
∑
i
=
1
n
I
H
s
(
y
i
)
3. Compute the mean of
z
i
over all slices, which is a crude estimate
m
^
1
of the inverse regression curve
m
1
:
z
¯
s
=
n
s
−
1
∑
i
=
1
n
z
i
I
H
s
(
y
i
)
4. Calculate the estimate for
C
o
v
{
m
1
(
y
)
}
:
V
^
=
n
−
1
∑
i
=
1
S
n
s
z
¯
s
z
¯
s
⊤
5. Identify the eigenvalues
λ
^
i
and the eigenvectors
η
^
i
of
V
^
, which are the standardized EDRdirections.
6. Transform the standardized EDRdirections back to the original scale. The estimates for the EDRdirections are given by:
β
^
i
=
Σ
^
x
x
−
1
/
2
η
^
i
(which are not necessarily orthogonal)
For examples, see the book by Härdle and Simar (2003).