Encrypted Accelerated Least Squares Regression
By Pedro M. Esperança, Louis J. M. Aslett, Chris C. Holmes. 2017
17 citations recorded by the source corpus.
Information that is stored in an encrypted format is, by definition, usually not amenable to statistical analysis or machine learning methods. In this paper we present detailed analysis of coordinate and accelerated gradient descent algorithms which are capable of fitting least squares and penalised ridge regression models, using data encrypted under a fully homomorphic encryption scheme. Gradient descent is shown to dominate in terms of encrypted computational speed, and theoretical results are proven to give parameter bounds which ensure correctness of decryption. The characteristics of encrypted computation are empirically shown to favour a non-standard acceleration technique. This demonstrates the possibility of approximating conventional statistical regression methods using encrypted data without compromising privacy.
Subfields: Artificial Intelligence, Statistics and Probability
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Richard Nock
- Giorgio Patrini
- Stephen Hardy
- Hamish Ivey-Law
- Brian Thorne
- Guillaume Smith
- Wilko Henecka
- Qiang Yang
In Statistics and Probability
Citations in the corpus
- Entity Resolution and Federated Learning get a Federated Resolution (2018, methodology): “The interest in focusing on Ridge-regularized Taylor losses is three-folds: (i) we are trivially able to compute the optimum of such losses given the constraints imposed on Theorem 3; we thus get access to a fine-grained analysis of θ∗T ; (ii) our fine-grained bounds are directly relevant to the num”