Orthonormal Sketches for Secure Coded Regression
From MaRDI portal
Iterative numerical methods for linear systems (65F10) Numerical methods for matrix equations (65F45) Privacy of data (68P27) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Distributed algorithms (68W15) Randomized algorithms (68W20) Approximation algorithms (68W25)
Abstract: 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 extit{blocks}, 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 extit{approximate} 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 extit{Subsampled 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.
This page was built for publication: Orthonormal Sketches for Secure Coded Regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6388809)
