Javascript must be enabled to continue!
seagull: lasso, group lasso and sparse-group lasso regularisation for linear regression models via proximal gradient descent
View through CrossRef
Summary
Statistical analyses of biological problems in life sciences often lead to high-dimensional linear models. To solve the corresponding system of equations, penalisation approaches are often the methods of choice. They are especially useful in case of multicollinearity which appears if the number of explanatory variables exceeds the number of observations or for some biological reason. Then, the model goodness of fit is penalised by some suitable function of interest. Prominent examples are the lasso, group lasso and sparse-group lasso. Here, we offer a fast and numerically cheap implementation of these operators via proximal gradient descent. The grid search for the penalty parameter is realised by warm starts. The step size between consecutive iterations is determined with backtracking line search. Finally, the package produces complete regularisation paths.
Availability and implementation
seagull
is an R package that is freely available on the Comprehensive R Archive Network (
CRAN
;
https://CRAN.R-project.org/package=seagull
; vignette included). The source code is available on
https://github.com/jklosa/seagull
.
Contact
wittenburg@fbn-dummerstorf.de
Title: seagull: lasso, group lasso and sparse-group lasso regularisation for linear regression models via proximal gradient descent
Description:
Summary
Statistical analyses of biological problems in life sciences often lead to high-dimensional linear models.
To solve the corresponding system of equations, penalisation approaches are often the methods of choice.
They are especially useful in case of multicollinearity which appears if the number of explanatory variables exceeds the number of observations or for some biological reason.
Then, the model goodness of fit is penalised by some suitable function of interest.
Prominent examples are the lasso, group lasso and sparse-group lasso.
Here, we offer a fast and numerically cheap implementation of these operators via proximal gradient descent.
The grid search for the penalty parameter is realised by warm starts.
The step size between consecutive iterations is determined with backtracking line search.
Finally, the package produces complete regularisation paths.
Availability and implementation
seagull
is an R package that is freely available on the Comprehensive R Archive Network (
CRAN
;
https://CRAN.
R-project.
org/package=seagull
; vignette included).
The source code is available on
https://github.
com/jklosa/seagull
.
Contact
wittenburg@fbn-dummerstorf.
de.
Related Results
Seagull: lasso, group lasso and sparse-group lasso regularization for linear regression models via proximal gradient descent
Seagull: lasso, group lasso and sparse-group lasso regularization for linear regression models via proximal gradient descent
Abstract
Background
Statistical analyses of biological problems in life sciences often lead to high-dimensional linear models. To solve the corresponding system of equations, penal...
Implicit regularization in deep learning : a tensor perspective
Implicit regularization in deep learning : a tensor perspective
Régularisation implicite en apprentissage profond par approches tensorielles
L’apprentissage profond a connu un succès remarquable au cours des dernières années dan...
Selection of Injectable Drug Product Composition using Machine Learning Models (Preprint)
Selection of Injectable Drug Product Composition using Machine Learning Models (Preprint)
BACKGROUND
As of July 2020, a Web of Science search of “machine learning (ML)” nested within the search of “pharmacokinetics or pharmacodynamics” yielded over 100...
La régularisation des favelas par l’électricité : un service entre Etat, marché et citoyenneté
La régularisation des favelas par l’électricité : un service entre Etat, marché et citoyenneté
L'accueil de plusieurs événements internationaux ayant réactualisé l'enjeu sécuritaire, dès la fin de l'année 2008, le gouvernement de l'État de Rio de Janeiro a mis en place une n...
การเปรียบเทียบประสิทธิภาพของวิธีการสร้างช่วงความเชื่อมั่นสำหรับสัมประสิทธิ์การถดถอยลอจิสติกในข้อมูลที่มีมิติสูง โดยใช้การประมาณสองขั้นตอนด้วยวิธี lasso + MLE and a bootstrap lasso + partial ridge
การเปรียบเทียบประสิทธิภาพของวิธีการสร้างช่วงความเชื่อมั่นสำหรับสัมประสิทธิ์การถดถอยลอจิสติกในข้อมูลที่มีมิติสูง โดยใช้การประมาณสองขั้นตอนด้วยวิธี lasso + MLE and a bootstrap lasso + partial ridge
งานวิจัยนี้มีวัตถุประสงค์เพื่อเปรียบเทียบวิธีการสร้างช่วงความเชื่อมั่นสำหรับสัมประสิทธิ์การถดถอยลอจิสติกในข้อมูลที่มีมิติสูง โดยใช้การประมาณสองขั้นตอนด้วยวิธี Lasso+MLE และวิธี Las...
Joint sparse optimization: lower-order regularization method and application in cell fate conversion
Joint sparse optimization: lower-order regularization method and application in cell fate conversion
Abstract
Multiple measurement signals are commonly collected in practical applications, and joint sparse optimization adopts the synchronous effect within multiple m...
Sparse Grids for Dynamic Economic Models
Sparse Grids for Dynamic Economic Models
Solving dynamic economic models that capture salient real-world heterogeneity and non-linearity requires the approximation of high-dimensional functions. As their dimensionality in...
Robust visual tracking algorithm based on bidirectional sparse representation
Robust visual tracking algorithm based on bidirectional sparse representation
At present the visual tracking model based on sparse representation is mainly divided into two types: one is to use the template set to reconstruct candidate samples, which is call...

