# Orthonormal Sketches for Secure Coded Regression

arXiv: https://arxiv.org/abs/2201.08522 · HTML: https://mlsanity.com/paper/2201.08522/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 21 Jan 2022.

## Built on by (most cited first, 2 of 2)

- [Gradient Coding with Iterative Block Leverage Score Sampling](https://mlsanity.com/paper/2308.03096/) (2023)
- [Iterative Sketching for Secure Coded Regression](https://mlsanity.com/paper/2308.04185/) (2023)

## Abstract (arXiv)

In this work, we propose a method for speeding up linear regression distributively, while ensuring security. We leverage randomized sketching techniques, and improve straggler resilience in asynchronous systems. Specifically, we apply a random orthonormal matrix and then subsample in textitblocks, to simultaneously secure the information and reduce the dimension of the regression problem. In our setup, the transformation corresponds to an encoded encryption in an textitapproximate gradient coding scheme, and the subsampling corresponds to the responses of the non-straggling workers; in a centralized coded computing network. We focus on the special case of the textitSubsampled Randomized Hadamard Transform, which we generalize to block sampling; and discuss how it can be used to secure the data. We illustrate the performance through numerical experiments.