Description Usage Arguments Value Author(s) References Examples

Similar to cv.rq.pen function, but uses group penalty. Group penalties use the L1 norm instead of L2 for computational convenience. As a result of this the group lasso penalty is the same as the typical lasso penalty and thus you should only use a SCAD or MCP penalty. Only the SCAD and MCP penalties incorporate the group structure into the penalty. The group lasso penalty is implemented because it is needed for the SCAD and MCP algorithm. We use a group penalty extension of the QICD algorithm presented by Peng and Wang (2015).

1 2 | ```
rq.group.fit(x, y, groups, tau = 0.5, lambda, intercept = TRUE,
penalty = "SCAD", alg = "QICD", a=3.7, penGroups=NULL, ...)
``` |

`x` |
Matrix of predictors. |

`y` |
Vector of response values. |

`groups` |
Vector assigning columns of x to groups. |

`tau` |
Conditional quantile being modelled. |

`lambda` |
Vector of lambdas. Default is for lambdas to be automatically generated. |

`intercept` |
Whether model should include an intercept. Constant does not need to be included in "x". |

`penalty` |
Type of penalty: "SCAD" or "MCP". |

`alg` |
If set to QICD algorithm will use coordinate descent algorithm. Otherwise, will use a linear programming algorithm, which is an extension of algorithm used in rq.lasso.fit. |

`a` |
The additional tuning parameter for SCAD and MCP. |

`penGroups` |
Specify which groups will be penalized. Default is to penalize all groups. |

`...` |
Additional arguments to be sent to rq.lasso.fit or groupQICD. |

Returns the following:

`coefficients` |
Coefficients of the model. |

`residuals` |
Residuals from the fitted model. |

`rho` |
Unpenalized portion of the objective function. |

`tau` |
Quantile being modeled. |

`n` |
Sample size. |

`intercept` |
Whether intercept was included in model. |

Ben Sherwood; Adam Maidman

[1] Yuan, M. and Lin, Y. (2006). Model selection and estimation in regression with grouped variables. *J. R. Statist. Soc. B*, **68**, 49-67.

[2] Peng, B. and Wang, L. (2015). An Iterative Coordinate Descent Algorithm for High-Dimensional Nonconvex Penalized Quantile Regression. *Journal of Computational and Graphical Statistics*, **24**, 676-694.

1 2 3 |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.