Penalized estimation in large-scale generalized linear array models

10/12/2015
by   Adam Lund, et al.
0

Large-scale generalized linear array models (GLAMs) can be challenging to fit. Computation and storage of its tensor product design matrix can be impossible due to time and memory constraints, and previously considered design matrix free algorithms do not scale well with the dimension of the parameter vector. A new design matrix free algorithm is proposed for computing the penalized maximum likelihood estimate for GLAMs, which, in particular, handles nondifferentiable penalty functions. The proposed algorithm is implemented and available via the R package +glamlasso+. It combines several ideas -- previously considered separately -- to obtain sparse estimates while at the same time efficiently exploiting the GLAM structure. In this paper the convergence of the algorithm is treated and the performance of its implementation is investigated and compared to that of +glmnet+ on simulated as well as real data. It is shown that the computation time for

READ FULL TEXT
research
02/25/2018

Sparse Network Estimation for Dynamical Spatio-temporal Array Models

Neural field models represent neuronal communication on a population lev...
research
01/04/2017

Tensor-on-tensor regression

We propose a framework for the linear prediction of a multi-way array (i...
research
05/07/2018

Soft Maximin Aggregation of Heterogeneous Array Data

The extraction of a common signal across many recordings is difficult wh...
research
01/29/2018

Fast Penalized Regression and Cross Validation for Tall Data with the oem Package

A large body of research has focused on theory and computation for varia...
research
02/24/2015

Tensor decomposition with generalized lasso penalties

We present an approach for penalized tensor decomposition (PTD) that est...
research
01/15/2021

Matrix-free Penalized Spline Smoothing with Multiple Covariates

The paper motivates high dimensional smoothing with penalized splines an...
research
12/08/2019

Improved Algoritms in Parallel Evaluation of Large Cryptographic S-Box

Nowadays computational complexity of fast walsh hadamard transform and n...

Please sign up or login with your details

Forgot password? Click here to reset