A Blockwise Descent Algorithm for Group-penalized Multiresponse and Multinomial Regression

11/26/2013
by   Noah Simon, et al.
0

In this paper we purpose a blockwise descent algorithm for group-penalized multiresponse regression. Using a quasi-newton framework we extend this to group-penalized multinomial regression. We give a publicly available implementation for these in R, and compare the speed of this algorithm to a competing algorithm --- we show that our implementation is an order of magnitude faster than its competitor, and can solve gene-expression-sized problems in real time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/04/2022

Improved Pathwise Coordinate Descent for Power Penalties

Pathwise coordinate descent algorithms have been used to compute entire ...
research
09/09/2015

Semismooth Newton Coordinate Descent Algorithm for Elastic-Net Penalized Huber Loss Regression and Quantile Regression

We propose an algorithm, semismooth Newton coordinate descent (SNCD), fo...
research
02/18/2020

Consistency of ℓ _1 Penalized Negative Binomial Regressions

We prove the consistency of the ℓ_1 penalized negative binomial regressi...
research
11/05/2019

Penalized least squares and sign constraints with modified Newton-Raphson algorithms: application to EEG source imaging

We propose a modified Newton-Raphson (MNR) algorithm to estimate multipl...
research
02/07/2008

Least angle and ℓ_1 penalized regression: A review

Least Angle Regression is a promising technique for variable selection a...
research
10/21/2022

Sequential Gradient Descent and Quasi-Newton's Method for Change-Point Analysis

One common approach to detecting change-points is minimizing a cost func...
research
05/28/2021

Scalable logistic regression with crossed random effects

The cost of both generalized least squares (GLS) and Gibbs sampling in a...

Please sign up or login with your details

Forgot password? Click here to reset