A Deterministic Streaming Sketch for Ridge Regression

02/05/2020
by   Benwei Shi, et al.
5

We provide a deterministic space-efficient algorithm for estimating ridge regression. For n data points with d features and a large enough regularization parameter, we provide a solution within ε L_2 error using only O(d/ε) space. This is the first o(d^2) space algorithm for this classic problem. The algorithm sketches the covariance matrix by variants of Frequent Directions, which implies it can operate in insertion-only streams and a variety of distributed data settings. In comparisons to randomized sketching algorithms on synthetic and real-world datasets, our algorithm has less empirical error using less space and similar time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/06/2020

Ridge Regression with Frequent Directions: Statistical and Optimization Perspectives

Despite its impressive theory & practical performance, Frequent Directio...
research
03/04/2022

Improving Tug-of-War sketch using Control-Variates method

Computing space-efficient summary, or a.k.a. sketches, of large data, is...
research
11/02/2020

Coresets for Regressions with Panel Data

This paper introduces the problem of coresets for regression problems to...
research
09/05/2020

Revisiting Co-Occurring Directions: Sharper Analysis and Efficient Algorithm for Sparse Matrices

We study the streaming model for approximate matrix multiplication (AMM)...
research
06/09/2018

Deterministic Stretchy Regression

An extension of the regularized least-squares in which the estimation pa...
research
04/24/2023

Robust, randomized preconditioning for kernel ridge regression

This paper introduces two randomized preconditioning techniques for robu...
research
03/15/2018

Ridge Regression and Provable Deterministic Ridge Leverage Score Sampling

Ridge leverage scores provide a balance between low-rank approximation a...

Please sign up or login with your details

Forgot password? Click here to reset