MEMLJan 11, 2021

Fast marginal likelihood estimation of penalties for group-adaptive elastic net

arXiv:2101.03875v111 citations
Originality Incremental advance
AI Analysis

This work provides a faster and more efficient computational method for clinical researchers working with omics and co-data, improving the practical application of group-adaptive elastic net for prediction and marker selection.

This paper introduces a fast method for estimating penalties in group-adaptive elastic net models, which are used for prediction and covariate selection with omics and co-data. The method significantly reduces computation time while matching or outperforming existing methods by leveraging a low-dimensional Taylor approximation for ridge penalties and transforming them for elastic net.

Nowadays, clinical research routinely uses omics data, such as gene expression, for predicting clinical outcomes or selecting markers. Additionally, so-called co-data are often available, providing complementary information on the covariates, like p-values from previously published studies or groups of genes corresponding to pathways. Elastic net penalisation is widely used for prediction and covariate selection. Group-adaptive elastic net penalisation learns from co-data to improve the prediction and covariate selection, by penalising important groups of covariates less than other groups. Existing methods are, however, computationally expensive. Here we present a fast method for marginal likelihood estimation of group-adaptive elastic net penalties for generalised linear models. We first derive a low-dimensional representation of the Taylor approximation of the marginal likelihood and its first derivative for group-adaptive ridge penalties, to efficiently estimate these penalties. Then we show by using asymptotic normality of the linear predictors that the marginal likelihood for elastic net models may be approximated well by the marginal likelihood for ridge models. The ridge group penalties are then transformed to elastic net group penalties by using the variance function. The method allows for overlapping groups and unpenalised variables. We demonstrate the method in a model-based simulation study and an application to cancer genomics. The method substantially decreases computation time and outperforms or matches other methods by learning from co-data.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes