R: Semiparametric Copula Bivariate Models with Continuous...
copulaReg
R Documentation
Semiparametric Copula Bivariate Models with Continuous Margins
Description
copulaReg can be used to fit bivariate models with continuous margins where the linear predictors of the two main equations can
be flexibly specified using parametric and regression spline components. Several bivariate copula distributions are supported.
During the model fitting process, the
possible presence of associated error equations is accounted for. Regression
spline bases are extracted from the package mgcv. Multi-dimensional smooths are available
via the use of penalized thin plate regression splines. Note that, if it makes sense, the dependence parameter of the employed bivariate
distribution, or more generally all distribution specific parameters can be specified as functions of covariates.
In the basic setup this will be a list of two formulas, one for equation 1 and the other for equation 2. s terms
are used to specify smooth smooth functions of
predictors. For the case of more than two equations see the example below and the documentation
of SemiParBIVProbit() for more details.
data
An optional data frame, list or environment containing the variables in the model. If not found in data, the
variables are taken from environment(formula), typically the environment from which copulaReg is called.
weights
Optional vector of prior weights to be used in fitting.
subset
Optional vector specifying a subset of observations to be used in the fitting process.
margins
It indicates the distributions used for the two margins. Possible choices are: normal ("N"), log-normal ("LN"),
Gumbel ("GU"), reverse Gumbel ("rGU"),
logistic ("LO"), Weibull ("WEI"), inverse Gaussian ("iG"), gamma ("GA"),
gamma with identity link for the location parameter ("GAi"), Dagum ("DAGUM"),
Singh-Maddala ("SM"), beta ("BE"), Fisk ("FISK", also known as log-logistic distribution).
gamlssfit
If gamlssfit = TRUE then gamlss models are fitted. This is useful for obtaining
starting values, for instance.
BivD
Type of bivariate error distribution employed. Possible choices are "N", "C0", "C90", "C180", "C270", "J0", "J90", "J180", "J270",
"G0", "G90", "G180", "G270", "F", "AMH", "FGM" which stand for bivariate normal, Clayton, rotated Clayton (90 degrees), survival Clayton,
rotated Clayton (270 degrees), Joe, rotated Joe (90 degrees), survival Joe, rotated Joe (270 degrees),
Gumbel, rotated Gumbel (90 degrees), survival Gumbel, rotated Gumbel (270 degrees), Frank, Ali-Mikhail-Haq and
Farlie-Gumbel-Morgenstern.
fp
If TRUE then a fully parametric model with unpenalised regression splines if fitted. See the example below.
infl.fac
Inflation factor for the model degrees of freedom in the approximate AIC. Smoother models can be obtained setting
this parameter to a value greater than 1.
rinit
Starting trust region radius. The trust region radius is adjusted as the algorithm proceeds. See the documentation
of trust for further details.
rmax
Maximum allowed trust region radius. This may be set very large. If set small, the algorithm traces a steepest
descent path.
iterlimsp
A positive integer specifying the maximum number of loops to be performed before the smoothing parameter estimation
step is terminated.
tolsp
Tolerance to use in judging convergence of the algorithm when automatic smoothing parameter estimation is used.
gc.l
This is relevant when working with big datasets. If TRUE then the garbage collector is called more often than it is
usually done. This keeps the memory footprint down but it will slow down the routine.
parscale
The algorithm will operate as if optimizing objfun(x / parscale, ...) where parscale is a scalar. If missing then no
rescaling is done. See the
documentation of trust for more details.
extra.regI
If "t" then regularization as from trust is applied to the information matrix if needed.
If different from "t" then extra regularization is applied via the options "pC" (pivoted Choleski - this
will only work when the information matrix is semi-positive or positive definite) and "sED" (symmetric eigen-decomposition).
Details
The underlying algorithm is based on an extension of the procedure used for SemiParBIVProbit(). For more details
see ?SemiParBIVProbit.
Value
The function returns an object of class copulaReg as described in copulaRegObject.
WARNINGS
Convergence failure may sometimes occur. Convergence can be checked using conv.check which provides some
information about
the score and information matrix associated with the fitted model. The former should be 0 and the latter positive definite.
copulaReg() will produce some warnings if there is a convergence issue.
In such a situation, the user may use some extra regularisation (see extra.regI) and/or
rescaling (see parscale). Using gamlssfit = TRUE is typically more effective than the first two options as
this will provide better calibrated starting values as compared to those obtained from the default starting value procedure.
The default option is, however, gamlssfit = FALSE only because it tends to be computationally cheaper and because the
default starting value procedure has typically been found to do a satisfactory job in most cases.
(The results obtained when using
gamlssfit = FALSE and gamlssfit = TRUE could also be compared to check if starting values make any difference.)
The above suggestions may help, especially the latter option. However, the user should also consider
re-specifying the model, and/or using a diferrent dependence structure and/or checking that the chosen marginal
distributions fit the responses.
In our experience, we found that convergence failure typically occurs
when the model has been misspecified and/or the sample size is low compared to the complexity of the model. Examples
of misspecification include using a Clayton copula rotated by 90 degrees when a positive
association between the margins is present instead, using marginal distributions that do not fit
the responses, and
employing a copula which does not accommodate the type and/or strength of
the dependence between the margins (e.g., using AMH when the association between the margins is strong).
It is also worth bearing in mind that the use of three parameter marginal distributions requires the data
to be more informative than a situation in which two parameter distributions are used instead.
When comparing competing models (for instance, by keeping the linear predictor specifications
fixed and changing the copula), if the computing time for a set of alternatives
is considerably higher than that of another set then it may mean that
the more computationally demanding models are not able to fit the data very well (as a higher number of
iterations is required to reach convergence). As a practical check, this may be verified by
fitting all competing models and, provided convergence is achieved, comparing their respective AIC and BICs, for instance.