Integer, Intent (In)	::	n, m, ldx, isx(m), ip, lh, wantb, ldb, wantvf, ldvf, lpec, ldpe
Integer, Intent (Inout)	::	ifail
Real (Kind=nag_wp), Intent (In)	::	x(ldx,m), y(n), h(lh)
Real (Kind=nag_wp), Intent (Inout)	::	b(ldb,), vf(ldvf,), pe(ldpe,*)
Real (Kind=nag_wp), Intent (Out)	::	nep(lh)
Character (1), Intent (In)	::	pec(lpec)

C Header Interface

#include <nag.h>

void

g02kbf_ (const Integer *n, const Integer *m, const double x[], const Integer *ldx, const Integer isx[], const Integer *ip, const double y[], const Integer *lh, const double h[], double nep[], const Integer *wantb, double b[], const Integer *ldb, const Integer *wantvf, double vf[], const Integer *ldvf, const Integer *lpec, const char pec[], double pe[], const Integer *ldpe, Integer *ifail, const Charlen length_pec)

The routine may be called by the names g02kbf or nagf_correg_ridge.

3 Description

A linear model has the form:

y = c + X β + ε,

where

$y$ is an $n \times 1$ matrix of values of a dependent variable;
$c$ is a scalar intercept term;
$X$ is an $n \times m$ matrix of values of independent variables;
$β$ is an $m \times 1$ matrix of unknown values of parameters;
$ε$ is an $n \times 1$ matrix of unknown random errors such that variance of ${ε = σ}^{2} I$ .

Let

\tilde{X}

be the mean-centred

X

and

\tilde{y}

the mean-centred

y

. Furthermore,

\tilde{X}

is scaled such that the diagonal elements of the cross product matrix

{\tilde{X}}^{T} \tilde{X}

are one. The linear model now takes the form:

\tilde{y} = \tilde{X} \tilde{β} + ε .

Ridge regression estimates the parameters

\tilde{β}

in a penalised least squares sense by finding the

\tilde{b}

that minimizes

{‖ \tilde{X} \tilde{b} - \tilde{y} ‖}^{2} + h {‖ \tilde{b} ‖}^{2}, h > 0,

where

‖ \cdot ‖

denotes the

ℓ_{2}

-norm and

h

is a scalar regularization or ridge parameter. For a given value of

h

, the parameters estimates

\tilde{b}

are found by evaluating

\tilde{b} = {({\tilde{X}}^{T} \tilde{X} + h I)}^{- 1} {\tilde{X}}^{T} \tilde{y} .

Note that if

h = 0

the ridge regression solution is equivalent to the ordinary least squares solution.

Rather than calculate the inverse of (

{\tilde{X}}^{T} \tilde{X} + h I

) directly, g02kbf uses the singular value decomposition (SVD) of

\tilde{X}

. After decomposing

\tilde{X}

into

U D V^{T}

where

U

and

V

are orthogonal matrices and

D

is a diagonal matrix, the parameter estimates become

\tilde{b} = V {(D^{T} D + h I)}^{- 1} D U^{T} \tilde{y} .

A consequence of introducing the ridge parameter is that the effective number of parameters,

γ

, in the model is given by the sum of diagonal elements of

D^{T} D {(D^{T} D + h I)}^{- 1},

see Moody (1992) for details.

Any multi-collinearity in the design matrix

X

may be highlighted by calculating the variance inflation factors for the fitted model. The

j

th variance inflation factor,

v_{j}

, is a scaled version of the multiple correlation coefficient between independent variable

j

and the other independent variables,

R_{j}

, and is given by

v_{j} = \frac{1}{1 - R_{j}}, j = 1, 2, \dots, m .

The

m

variance inflation factors are calculated as the diagonal elements of the matrix:

{({\tilde{X}}^{T} \tilde{X} + h I)}^{- 1} {\tilde{X}}^{T} \tilde{X} {({\tilde{X}}^{T} \tilde{X} + h I)}^{- 1},

which, using the SVD of

\tilde{X}

, is equivalent to the diagonal elements of the matrix:

V {(D^{T} D + h I)}^{- 1} D^{T} D {(D^{T} D + h I)}^{- 1} V^{T} .

Given a value of

h

, any or all of the following prediction criteria are available:

(a)Generalized cross-validation (GCV):

$\frac{n s}{{(n - γ)}^{2}};$
(b)Unbiased estimate of variance (UEV):

$\frac{s}{n - γ};$
(c)Future prediction error (FPE):

$\frac{1}{n} (s + \frac{2 γ s}{n - γ});$
(d)Bayesian information criterion (BIC):

$\frac{1}{n} (s + \frac{\log (n) γ s}{n - γ});$
(e)Leave-one-out cross-validation (LOOCV),

where

s

is the sum of squares of residuals.

Although parameter estimates

\tilde{b}

are calculated by using

\tilde{X}

, it is usual to report the parameter estimates

b

associated with

X

. These are calculated from

\tilde{b}

, and the means and scalings of

X

. Optionally, either

\tilde{b}

b

may be calculated.

4 References

Hastie T, Tibshirani R and Friedman J (2003) The Elements of Statistical Learning: Data Mining, Inference and Prediction Springer Series in Statistics

Moody J.E. (1992) The effective number of parameters: An analysis of generalisation and regularisation in nonlinear learning systems In: Neural Information Processing Systems (eds J E Moody, S J Hanson, and R P Lippmann) 4 847–854 Morgan Kaufmann San Mateo CA

5 Arguments

1: $n$ – Integer Input

On entry:

n

, the number of observations.

Constraint:

n \geq 1

2: $m$ – Integer Input

On entry: the number of independent variables available in the data matrix

X

Constraint:

m \leq n

3: $x (ldx, m)$ – Real (Kind=nag_wp) array Input

On entry: the values of independent variables in the data matrix

X

4: $ldx$ – Integer Input

On entry: the first dimension of the array x as declared in the (sub)program from which g02kbf is called.

Constraint:

ldx \geq n

5: $isx (m)$ – Integer array Input

On entry: indicates which

m

independent variables are included in the model.

$isx (j) = 1$: The $j$ th variable in x will be included in the model.
$isx (j) = 0$: Variable $j$ is excluded.

Constraint:

isx (j) = 0

1

, for

j = 1, 2, \dots, m

6: $ip$ – Integer Input

On entry:

m

, the number of independent variables in the model.

Constraints:

$1 \leq ip \leq m$ ;
Exactly ip elements of isx must be equal to $1$ .

7: $y (n)$ – Real (Kind=nag_wp) array Input

On entry: the

n

values of the dependent variable

y

8: $lh$ – Integer Input

On entry: the number of supplied ridge parameters.

Constraint:

lh > 0

9: $h (lh)$ – Real (Kind=nag_wp) array Input

On entry:

h (j)

is the value of the

j

th ridge parameter

h

Constraint:

h (j) \geq 0.0

, for

j = 1, 2, \dots, lh

10: $nep (lh)$ – Real (Kind=nag_wp) array Output

On exit:

nep (j)

is the number of effective parameters,

γ

, in the

j

th model, for

j = 1, 2, \dots, lh

11: $wantb$ – Integer Input

On entry: defines the options for parameter estimates.

$wantb = 0$: Parameter estimates are not calculated and b is not referenced.
$wantb = 1$: Parameter estimates $b$ are calculated for the original data.
$wantb = 2$: Parameter estimates $\tilde{b}$ are calculated for the standardized data.

Constraint:

wantb = 0

1

2

12: $b (ldb, *)$ – Real (Kind=nag_wp) array Output

Note: the second dimension of the array b must be at least

lh

wantb \neq 0

On exit: if

wantb \neq 0

, b contains the intercept and parameter estimates for the fitted ridge regression model in the order indicated by isx.

b (1, j)

, for

j = 1, 2, \dots, lh

, contains the estimate for the intercept;

b (i + 1, j)

contains the parameter estimate for the

i

th independent variable in the model fitted with ridge parameter

h (j)

, for

i = 1, 2, \dots, ip

13: $ldb$ – Integer Input

On entry: the first dimension of the array b as declared in the (sub)program from which g02kbf is called.

Constraints:

if $wantb \neq 0$ , $ldb \geq ip + 1$ ;
otherwise $ldb \geq 1$ .

14: $wantvf$ – Integer Input

On entry: defines the options for variance inflation factors.

$wantvf = 0$: Variance inflation factors are not calculated and the array vf is not referenced.
$wantvf = 1$: Variance inflation factors are calculated.

Constraints:

$wantvf = 0$ or $1$ ;
if $wantb = 0$ , $wantvf = 1$ .

15: $vf (ldvf, *)$ – Real (Kind=nag_wp) array Output

Note: the second dimension of the array vf must be at least

lh

wantvf \neq 0

On exit: if

wantvf = 1

, the variance inflation factors. For the

i

th independent variable in a model fitted with ridge parameter

h (j)

vf (i, j)

is the value of

v_{i}

, for

i = 1, 2, \dots, ip

16: $ldvf$ – Integer Input

On entry: the first dimension of the array vf as declared in the (sub)program from which g02kbf is called.

Constraints:

if $wantvf \neq 0$ , $ldvf \geq ip$ ;
otherwise $ldvf \geq 1$ .

17: $lpec$ – Integer Input

On entry: the number of prediction error statistics to return; set

lpec \leq 0

for no prediction error estimates.

18: $pec (lpec)$ – Character(1) array Input

On entry: if

lpec > 0

pec (j)

defines the

j

th prediction error, for

j = 1, 2, \dots, lpec

; otherwise pec is not referenced.

$pec (j) ='B'$: Bayesian information criterion (BIC).
$pec (j) ='F'$: Future prediction error (FPE).
$pec (j) ='G'$: Generalized cross-validation (GCV).
$pec (j) ='L'$: Leave-one-out cross-validation (LOOCV).
$pec (j) ='U'$: Unbiased estimate of variance (UEV).

Constraint: if

lpec > 0

pec (j) ='B'

'F'

'G'

'L'

'U'

, for

j = 1, 2, \dots, lpec

19: $pe (ldpe, *)$ – Real (Kind=nag_wp) array Output

Note: the second dimension of the array pe must be at least

lh

lpec > 0

On exit: if

lpec \leq 0

, pe is not referenced; otherwise

pe (i, j)

contains the prediction error of criterion

pec (i)

for the model fitted with ridge parameter

h (j)

, for

i = 1, 2, \dots, lpec

and

j = 1, 2, \dots, lh

20: $ldpe$ – Integer Input

On entry: the first dimension of the array pe as declared in the (sub)program from which g02kbf is called.

Constraints:

if $lpec > 0$ , $ldpe \geq lpec$ ;
otherwise $ldpe \geq 1$ .

21: $ifail$ – Integer Input/Output

On entry: ifail must be set to

0

−1

1

to set behaviour on detection of an error; these values have no effect when no error is detected.

A value of

0

causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of

−1

means that an error message is printed while a value of

1

means that it is not.

If halting is not appropriate, the value

−1

1

is recommended. If message printing is undesirable, then the value

1

is recommended. Otherwise, the value

0

is recommended. When the value $- 1$ or $1$ is used it is essential to test the value of ifail on exit.

On exit:

ifail = 0

unless the routine detects an error or a warning has been flagged (see Section 6).

6 Error Indicators and Warnings

If on entry

ifail = 0

−1

, explanatory error messages are output on the current error message unit (as defined by x04aaf).

Errors or warnings detected by the routine:

$ifail = 1$: On entry, $h (j) < 0$ for at least one $j$ .
Constraint: $h (j) \leq 0.0$ , for all $j$ .

On entry, $lh = ⟨ value ⟩$ .
Constraint: $lh > 0$ .

On entry, $m = ⟨ value ⟩$ and $n = ⟨ value ⟩$ .
Constraint: $m \leq n$ .

On entry, $n = ⟨ value ⟩$ .
Constraint: $n \geq 1$ .

On entry, $pec (j)$ is invalid for at least one $j$ .
Constraint: if $lpec > 0$ , $pec (j) ='B'$ , $'F'$ , $'G'$ , $'L'$ or $'U'$ , for all $j$ .

On entry, $wantb = ⟨ value ⟩$ .
Constraint: $wantb = 0$ , $1$ or $2$ .

On entry, $wantvf = ⟨ value ⟩$ .
Constraint: $wantvf = 0$ or $1$ .

$ifail = 2$: On entry, ip is not equal to the sum of elements in isx.
Constraint: exactly ip elements of isx must be equal to $1$ .

On entry, $isx (j) \neq 0$ or $1$ for at least one $j$ .
Constraint: $isx (j) = 0$ or $1$ , for all $j$ .

On entry, $ldb = ⟨ value ⟩$ and $ip = ⟨ value ⟩$ .
Constraint: if $wantb \neq 0$ , $ldb \geq ip + 1$ .

On entry, $ldpe = ⟨ value ⟩$ and $lpec = ⟨ value ⟩$ .
Constraint: $ldpe \geq lpec$ .

On entry, $ldvf = ⟨ value ⟩$ and $ip = ⟨ value ⟩$ .
Constraint: if $wantvf \neq 0$ , $ldvf \geq ip$ .

On entry, $ldx = ⟨ value ⟩$ and $n = ⟨ value ⟩$ .
Constraint: $ldx \geq n$ .

$ifail = 3$: On entry, $wantb = 0$ and $wantvf = 0$ .
Constraint: $wantb = 0$ , $wantvf = 1$ .

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 7 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.

7 Accuracy

The accuracy of g02kbf is closely related to that of the singular value decomposition.

8 Parallelism and Performance

Background information to multithreading can be found in the Multithreading documentation.

g02kbf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

g02kbf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

g02kbf allocates internally

\max (5 \times (n - 1), 2 \times ip \times ip) + (n + 3) \times ip + n

elements of double precision storage.

10 Example

This example reads in data from an experiment to model body fat, and a selection of ridge regression models are calculated.

g02kb: FL CL CPP AD PY MB

NAG FL Interfaceg02kbf (ridge)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

NAG FL Interface
g02kbf (ridge)