ForwardBoost: Computation of the ForwardBoost Algorithm

Description

This function fits a GLM based on penalized likelihood inference by the ForwardBoost algorithm. However, it is primarily intended for internal use. You can access it via the argument setting method = "ForwardBoost" in lqa, cv.lqa or plot.lqa.

Usage

ForwardBoost (x, y, family = NULL, penalty = NULL, intercept = 
        TRUE, weights = rep (1, nobs), control = lqa.control (), 
        nu = 1, monotonic = TRUE, ...)

Arguments

matrix of standardized regressors. This matrix does not need to include a first column of ones when a GLM with intercept is to be fitted.

vector of observed response values.

family

a description of the error distribution and link function to be used in the model. This can be a character string naming a family function, a family function or the result of a call to a family function. See family() for further details.

penalty

a description of the penalty to be used in the fitting procedure, e.g. penalty = lasso (lambda = 1.7).

intercept

a logical object indicating whether the model should include an intercept (this is recommended) or not. The default value is intercept = TRUE.

weights

some additional weights for the observations.

control

a list of parameters for controlling the fitting process. See lqa.control.

parameter $\nu$ from the ForwardBoost algorithm. This parameter manages the update step length. See Ulbricht (2010).

monotonic

a logical variable. If TRUE then the number of active regressors increases monotonically during the iterations. This is in line with the ForwardBoost algorithm and hence recommended.

...

further arguments.

Value

GBlockBoost returns a list containing the following elements:
coefficientsthe vector of standardized estimated coefficients.
beta.matmatrix containing the estimated coefficients from all iterations (rowwise).
m.stopthe number of iterations until AIC reaches its minimum.
stop.atthe number of iterations until convergence.
aic.vecvector of AIC criterion through all iterations.
bic.vecvector of BIC criterion through all iterations.
convergeda logical variable. This will be TRUE if the algorithm has indeed converged.
min.aicminimum value of AIC criterion.
min.bicminimum value of BIC criterion.
tr.Hthe trace of the hat matrix.
tr.Hatmatvector of hat matrix traces through all iterations.
dev.mvector of deviances through all iterations.

Details

The ForwardBoost algorithm has been described in Ulbricht (2010). So see there for a more detailed technical description.

References