Encrypted Distributed Lasso for Sparse Data Predictive Control

by   Andreea B. Alexandru, et al.

The least squares problem with L1-regularized regressors, called Lasso, is a widely used approach in optimization problems where sparsity of the regressors is desired. This formulation is fundamental for many applications in signal processing, machine learning and control. As a motivating problem, we investigate a sparse data predictive control problem, run at a cloud service to control a system with unknown model, using L1-regularization to limit the behavior complexity. The input-output data collected for the system is privacy-sensitive, hence, we design a privacy-preserving solution using homomorphically encrypted data. The main challenges are the non-smoothness of the L1-norm, which is difficult to evaluate on encrypted data, as well as the iterative nature of the Lasso problem. We use a distributed ADMM formulation that enables us to exchange substantial local computation for little communication between multiple servers. We first give an encrypted multi-party protocol for solving the distributed Lasso problem, by approximating the non-smooth part with a Chebyshev polynomial, evaluating it on encrypted data, and using a more cost effective distributed bootstrapping operation. For the example of data predictive control, we prefer a non-homogeneous splitting of the data for better convergence. We give an encrypted multi-party protocol for this non-homogeneous splitting of the Lasso problem to a non-homogeneous set of servers: one powerful server and a few less powerful devices, added for security reasons. Finally, we provide numerical results for our proposed solutions.



There are no comments yet.


page 1


Secure Multi-party Computation for Cloud-based Control

In this chapter, we will explore the cloud-outsourced privacy-preserving...

Multi-party computation for secure polynomial control

Encrypted control systems allow to evaluate feedback laws on external se...

A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression

Solving l1 regularized optimization problems is common in the fields of ...

Data-driven control on encrypted data

We provide an efficient and private solution to the problem of encryptio...

Efficient Cloud-based Secret Shuffling via Homomorphic Encryption

When working with joint collections of confidential data from multiple s...

Privacy-Preserving Distributed Optimization via Subspace Perturbation: A General Framework

As the modern world becomes increasingly digitized and interconnected, d...

Encrypted control for networked systems – An illustrative introduction and current challenges

Cloud computing and distributed computing are becoming ubiquitous in man...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.