Efficient Computation for Centered Linear Regression with Sparse Inputs

10/29/2019
by   Jeffrey Wong, et al.
0

Regression with sparse inputs is a common theme for large scale models. Optimizing the underlying linear algebra for sparse inputs allows such models to be estimated faster. At the same time, centering the inputs has benefits in improving the interpretation and convergence of the model. However, centering the data naturally makes sparse data become dense, limiting opportunities for optimization. We propose an efficient strategy that estimates centered regression while taking advantage of sparse structure in data, improving computational performance and decreasing the memory footprint of the estimator.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/29/2019

Centered and non-centered variance inflation factor

This paper analyzes the diagnostic of near multicollinearity in a multip...
research
09/30/2022

A note on centering in subsample selection for linear regression

Centering is a commonly used technique in linear regression analysis. Wi...
research
10/30/2019

Iterative Hessian Sketch in Input Sparsity Time

Scalable algorithms to solve optimization and regression tasks even appr...
research
04/04/2017

Homotopy Parametric Simplex Method for Sparse Learning

High dimensional sparse learning has imposed a great computational chall...
research
03/28/2015

Sparse Linear Regression With Missing Data

This paper proposes a fast and accurate method for sparse regression in ...
research
09/28/2017

Sparse Hierarchical Regression with Polynomials

We present a novel method for exact hierarchical sparse polynomial regre...
research
04/14/2023

SpChar: Characterizing the Sparse Puzzle via Decision Trees

Sparse matrix computation is crucial in various modern applications, inc...

Please sign up or login with your details

Forgot password? Click here to reset