An Efficient Reversible Algorithm for Linear Regression

10/27/2021
by   Erik D. Demaine, et al.
0

This paper presents an efficient reversible algorithm for linear regression, both with and without ridge regression. Our reversible algorithm matches the asymptotic time and space complexity of standard irreversible algorithms for this problem. Needed for this result is the expansion of the analysis of efficient reversible matrix multiplication to rectangular matrices and matrix inversion.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/23/2021

Sparse Regression Faster than d^ω

The current complexity of regression is nearly linear in the complexity ...
research
11/22/2022

Reversible Programming: A Case Study of Two String-Matching Algorithms

String matching is a fundamental problem in algorithm. This study examin...
research
07/16/2020

Incorporating compositional heterogeneity into Lie Markov models for phylogenetic inference

Phylogenetics uses alignments of molecular sequence data to learn about ...
research
08/28/2017

Relativized Separation of Reversible and Irreversible Space-Time Complexity Classes

Reversible computing can reduce the energy dissipation of computation, w...
research
08/02/2018

A note on Metropolis-Hasting for sampling across mixed spaces

We are concerned with the Metropolis-Hastings algorithm for sampling acr...
research
03/14/2022

On the Skolem Problem for Reversible Sequences

Given an integer linear recurrence sequence ⟨ X_n ⟩_n, the Skolem Proble...
research
03/20/2020

Localized sketching for matrix multiplication and ridge regression

We consider sketched approximate matrix multiplication and ridge regress...

Please sign up or login with your details

Forgot password? Click here to reset