Evidence map›Paper›PMID 33472626›Full record

ArticleBMC medical genomics2021

High performance logistic regression for privacy-preserving genome analysis.

Martine De Cock, Rafael Dowsley, Anderson C A Nascimento, Davis Railsback, Jianwei Shen, Ariel Todoki

Abstract read
In one paragraph

Article in BMC medical genomics, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 8 papers.

0numbers the graph read from it
0cells of the map it votes in
8citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

8 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors.

Martine De CockSchool of Engineering and Technology, University of Washington Tacoma, Tacoma, WA, 98402, USA. mdecock@uw.edu.ORCID 0000-0001-7917-0771
Rafael DowsleyFaculty of Information Technology, Monash University, Clayton, 3800, Australia.
Anderson C A NascimentoSchool of Engineering and Technology, University of Washington Tacoma, Tacoma, WA, 98402, USA.
Davis RailsbackSchool of Engineering and Technology, University of Washington Tacoma, Tacoma, WA, 98402, USA.
Jianwei ShenSchool of Engineering and Technology, University of Washington Tacoma, Tacoma, WA, 98402, USA.
Ariel TodokiSchool of Engineering and Technology, University of Washington Tacoma, Tacoma, WA, 98402, USA.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundIn biomedical applications, valuable data is often split between owners who cannot openly share the data because of privacy regulations and concerns. Training machine learning models on the joint data without violating privacy is a major technology challenge that can be addressed by combining techniques from machine learning and cryptography. When collaboratively training machine learning models with the cryptographic technique named secure multi-party computation, the price paid for keeping the data of the owners private is an increase in computational cost and runtime. A careful choice of machine learning techniques, algorithmic and implementation optimizations are a necessity to enable practical secure machine learning over distributed data sets. Such optimizations can be tailored to the kind of data and Machine Learning problem at hand.

methodsOur setup involves secure two-party computation protocols, along with a trusted initializer that distributes correlated randomness to the two computing parties. We use a gradient descent based algorithm for training a logistic regression like model with a clipped ReLu activation function, and we break down the algorithm into corresponding cryptographic protocols. Our main contributions are a new protocol for computing the activation function that requires neither secure comparison protocols nor Yao's garbled circuits, and a series of cryptographic engineering optimizations to improve the performance.

resultsFor our largest gene expression data set, we train a model that requires over 7 billion secure multiplications; the training completes in about 26.90 s in a local area network. The implementation in this work is a further optimized version of the implementation with which we won first place in Track 4 of the iDASH 2019 secure genome analysis competition.

conclusionsIn this paper, we present a secure logistic regression training protocol and its implementation, with a new subprotocol to securely compute the activation function. To the best of our knowledge, we present the fastest existing secure multi-party computation implementation for training logistic regression models on high dimensional genome data distributed across a local area network.

Indexed as

Computer SecurityAlgorithmsGenomicsHumansLogistic ModelsMachine LearningPrivacyGene expression dataGradient descentLogistic regressionMachine learningSecure multi-party computation

Identifiers

PMID33472626
PMCPMC7818577

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.