<?xml version="1.0" encoding="UTF-8"?>
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="review-article" dtd-version="1.4" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">ticsys</journal-id>
      <journal-title-group>
        <journal-title>Transactions on Intelligent Computing Systems</journal-title>
        <abbrev-journal-title abbrev-type="publisher">Trans. Intell. Comput. Syst.</abbrev-journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2784-0166</issn>
      <publisher>
        <publisher-name>Aurora Computing Society</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.58304/r3thqk65</article-id>
      <title-group>
        <article-title>The future of digital health with federated learning</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <contrib-id contrib-id-type="orcid" authenticated="false">https://orcid.org/0000-0003-0241-9334</contrib-id>
          <name>
            <surname>Rieke</surname>
            <given-names>Nicola</given-names>
          </name>
          <xref ref-type="aff" rid="aff1"/>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Hancox</surname>
            <given-names>Jonny</given-names>
          </name>
          <xref ref-type="aff" rid="aff2"/>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid" authenticated="false">https://orcid.org/0000-0003-1081-2830</contrib-id>
          <name>
            <surname>Li</surname>
            <given-names>Wenqi</given-names>
          </name>
          <xref ref-type="aff" rid="aff3"/>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Milletarì</surname>
            <given-names>Fausto</given-names>
          </name>
          <xref ref-type="aff" rid="aff4"/>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid" authenticated="false">https://orcid.org/0000-0002-3662-8743</contrib-id>
          <name>
            <surname>Roth</surname>
            <given-names>Holger R.</given-names>
          </name>
          <xref ref-type="aff" rid="aff5"/>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid" authenticated="false">https://orcid.org/0000-0003-2157-2211</contrib-id>
          <name>
            <surname>Albarqouni</surname>
            <given-names>Shadi</given-names>
          </name>
          <xref ref-type="aff" rid="aff6"/>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Bakas</surname>
            <given-names>Spyridon</given-names>
          </name>
          <xref ref-type="aff" rid="aff7"/>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Galtier</surname>
            <given-names>Mathieu N.</given-names>
          </name>
          <xref ref-type="aff" rid="aff8"/>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid" authenticated="false">https://orcid.org/0000-0001-5733-2127</contrib-id>
          <name>
            <surname>Landman</surname>
            <given-names>Bennett A.</given-names>
          </name>
          <xref ref-type="aff" rid="aff9"/>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid" authenticated="false">https://orcid.org/0000-0002-6626-2463</contrib-id>
          <name>
            <surname>Maier-Hein</surname>
            <given-names>Klaus</given-names>
          </name>
          <xref ref-type="aff" rid="aff10"/>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Ourselin</surname>
            <given-names>Sébastien</given-names>
          </name>
          <xref ref-type="aff" rid="aff11"/>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Sheller</surname>
            <given-names>Micah</given-names>
          </name>
          <xref ref-type="aff" rid="aff12"/>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid" authenticated="false">https://orcid.org/0000-0001-8081-7376</contrib-id>
          <name>
            <surname>Summers</surname>
            <given-names>Ronald M.</given-names>
          </name>
          <xref ref-type="aff" rid="aff13"/>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Trask</surname>
            <given-names>Andrew</given-names>
          </name>
          <xref ref-type="aff" rid="aff14"/>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Xu</surname>
            <given-names>Daguang</given-names>
          </name>
          <xref ref-type="aff" rid="aff5"/>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Baust</surname>
            <given-names>Maximilian</given-names>
          </name>
          <xref ref-type="aff" rid="aff4"/>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid" authenticated="false">https://orcid.org/0000-0003-1284-2558</contrib-id>
          <name>
            <surname>Cardoso</surname>
            <given-names>M. Jorge</given-names>
          </name>
          <xref ref-type="aff" rid="aff11"/>
        </contrib>
        <aff id="aff1">NVIDIA GmbH, Munich, Germany; grid.6936.a0000000123222966Technical University of Munich (TUM), Munich, Germany</aff>
        <aff id="aff2">grid.474379.a0000 0004 4649 6136NVIDIA Ltd, Reading, UK</aff>
        <aff id="aff3">grid.474379.a0000 0004 4649 6136NVIDIA Ltd, Cambridge, UK</aff>
        <aff id="aff4">NVIDIA GmbH, Munich, Germany</aff>
        <aff id="aff5">grid.451133.10000 0004 0458 4453NVIDIA Corporation, Bethesda, USA</aff>
        <aff id="aff6">grid.6936.a0000000123222966Technical University of Munich (TUM), Munich, Germany; grid.7445.20000 0001 2113 8111Imperial College London, London, UK</aff>
        <aff id="aff7">grid.25879.310000 0004 1936 8972University of Pennsylvania (UPenn), Philadelphia, PA USA</aff>
        <aff id="aff8">Owkin, Paris, France</aff>
        <aff id="aff9">grid.152326.10000 0001 2264 7217Vanderbilt University, Nashville, TN USA</aff>
        <aff id="aff10">grid.7497.d0000 0004 0492 0584German Cancer Research Center (DKFZ), Heidelberg, Germany; grid.5253.10000 0001 0328 4908Heidelberg University Hospital, Heidelberg, Germany</aff>
        <aff id="aff11">grid.13097.3c0000 0001 2322 6764King’s College London (KCL), London, UK</aff>
        <aff id="aff12">grid.419318.60000 0004 1217 7655Intel Corporation, Santa Clara, CA USA</aff>
        <aff id="aff13">grid.410305.30000 0001 2194 5650Clinical Center, National Institutes of Health (NIH), Bethesda, MD USA</aff>
        <aff id="aff14">OpenMined, Oxford, UK; grid.4991.50000 0004 1936 8948University of Oxford, Oxford, UK; Centre for the Governance of AI (GovAI), Oxford, UK</aff>
      </contrib-group>
      <pub-date publication-format="electronic" date-type="pub" iso-8601-date="2024-03-26">
        <day>26</day>
        <month>03</month>
        <year>2024</year>
      </pub-date>
      <volume>2</volume>
      <issue>1</issue>
      <elocation-id>119</elocation-id>
      <pub-history>
        <event>
          <date date-type="received" iso-8601-date="2020-03-17">
            <day>17</day>
            <month>03</month>
            <year>2020</year>
          </date>
        </event>
        <event>
          <date date-type="accepted" iso-8601-date="2020-08-12">
            <day>12</day>
            <month>08</month>
            <year>2020</year>
          </date>
        </event>
      </pub-history>
      <permissions>
        <ali:free_to_read/>
        <license>
          <ali:license_ref>https://creativecommons.org/licenses/by/4.0/</ali:license_ref>
        </license>
      </permissions>
      <abstract>
        <p>Data-driven machine learning (ML) has emerged as a promising approach for building accurate and robust statistical models from medical data, which is collected in huge volumes by modern healthcare systems. Existing medical data is not fully exploited by ML primarily because it sits in data silos and privacy concerns restrict access to this data. However, without access to sufficient data, ML will be prevented from reaching its full potential and, ultimately, from making the transition from research to clinical practice. This paper considers key factors contributing to this issue, explores how federated learning (FL) may provide a solution for the future of digital health and highlights the challenges and considerations that need to be addressed.</p>
      </abstract>
      <kwd-group kwd-group-type="author">
        <kwd>Medical research</kwd>
        <kwd>Medical imaging</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body><sec id="Sec1" sec-type="introduction"><title>Introduction</title><p id="Par2">Research on artificial intelligence (AI), and particularly the advances in machine learning (ML) and deep learning (DL)<sup><xref ref-type="bibr" rid="CR1">1</xref></sup> have led to disruptive innovations in radiology, pathology, genomics and other fields. Modern DL models feature millions of parameters that need to be learned from sufficiently large curated data sets in order to achieve clinical-grade accuracy, while being safe, fair, equitable and generalising well to unseen data<sup><xref ref-type="bibr" rid="CR2">2</xref>–<xref ref-type="bibr" rid="CR5">5</xref></sup>.</p><p id="Par3">For example, training an AI-based tumour detector requires a large database encompassing the full spectrum of possible anatomies, pathologies, and input data types. Data like this is hard to obtain, because health data is highly sensitive and its usage is tightly regulated<sup><xref ref-type="bibr" rid="CR6">6</xref></sup>. Even if data anonymisation could bypass these limitations, it is now well understood that removing metadata such as patient name or date of birth is often not enough to preserve privacy<sup><xref ref-type="bibr" rid="CR7">7</xref></sup>. It is, for example, possible to reconstruct a patient’s face from computed tomography (CT) or magnetic resonance imaging (MRI) data<sup><xref ref-type="bibr" rid="CR8">8</xref></sup>. Another reason why data sharing is not systematic in healthcare is that collecting, curating, and maintaining a high-quality data set takes considerable time, effort, and expense. Consequently such data sets may have significant business value, making it less likely that they will be freely shared. Instead, data collectors often retain fine-grained control over the data that they have gathered.</p><p id="Par4">Federated learning (FL)<sup><xref ref-type="bibr" rid="CR9">9</xref>–<xref ref-type="bibr" rid="CR11">11</xref></sup> is a learning paradigm seeking to address the problem of data governance and privacy by training algorithms collaboratively without exchanging the data itself. Originally developed for different domains, such as mobile and edge device use cases<sup><xref ref-type="bibr" rid="CR12">12</xref></sup>, it recently gained traction for healthcare applications<sup><xref ref-type="bibr" rid="CR13">13</xref>–<xref ref-type="bibr" rid="CR20">20</xref></sup>. FL enables gaining insights collaboratively, e.g., in the form of a consensus model, without moving patient data beyond the firewalls of the institutions in which they reside. Instead, the ML process occurs locally at each participating institution and only model characteristics (e.g., parameters, gradients) are transferred as depicted in Fig. <xref rid="Fig1" ref-type="fig">1</xref>. Recent research has shown that models trained by FL can achieve performance levels comparable to ones trained on centrally hosted data sets and superior to models that only see isolated single-institutional data<sup><xref ref-type="bibr" rid="CR16">16</xref>,<xref ref-type="bibr" rid="CR17">17</xref></sup>.<fig id="Fig1" position="float" orientation="portrait"><label>Fig. 1</label><caption><title>Example federated learning (FL) workflows and difference to learning on a Centralised Data Lake.</title><p><bold>a</bold> FL aggregation server—the typical FL workflow in which a federation of training nodes receive the global model, resubmit their partially trained models to a central server intermittently for aggregation and then continue training on the consensus model that the server returns. <bold>b</bold> FL peer to peer—alternative formulation of FL in which each training node exchanges its partially trained models with some or all of its peers and each does its own aggregation. <bold>c</bold> Centralised training—the general non-FL training workflow in which data acquiring sites donate their data to a central Data Lake from which they and others are able to extract data for local, independent training.</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" id="d32e567" position="float" orientation="portrait" xlink:href="/publication/142/files/1551"/></fig></p><p id="Par5">A successful implementation of FL could thus hold a significant potential for enabling precision medicine at large-scale, leading to models that yield unbiased decisions, optimally reflect an individual’s physiology, and are sensitive to rare diseases while respecting governance and privacy concerns. However, FL still requires rigorous technical consideration to ensure that the algorithm is proceeding optimally without compromising safety or patient privacy. Nevertheless, it has the potential to overcome the limitations of approaches that require a single pool of centralised data.</p><p id="Par6">We envision a federated future for digital health and with this perspective paper, we share our consensus view with the aim of providing context and detail for the community regarding the benefits and impact of FL for medical applications (section “Data-driven medicine requires federated efforts”), as well as highlighting key considerations and challenges of implementing FL for digital health (section “Technical considerations”).</p></sec><sec id="Sec2"><title>Data-driven medicine requires federated efforts</title><p id="Par7">ML and especially DL is becoming the de facto knowledge discovery approach in many industries, but successfully implementing data-driven applications requires large and diverse data sets. However, medical data sets are difficult to obtain (subsection “The reliance on data”). FL addresses this issue by enabling collaborative learning without centralising data (subsection “The promise of federated efforts”) and has already found its way to digital health applications (subsection “Current FL efforts for digital health”). This new learning paradigm requires consideration from, but also offers benefits to, various healthcare stakeholders (section “Impact on stakeholders”).</p><sec id="Sec3"><title>The reliance on data</title><p id="Par8">Data-driven approaches rely on data that truly represent the underlying data distribution of the problem. While this is a well-known requirement, state-of-the-art algorithms are usually evaluated on carefully curated data sets, often originating from only a few sources. This can introduce biases where demographics (e.g., gender, age) or technical imbalances (e.g., acquisition protocol, equipment manufacturer) skew predictions and adversely affect the accuracy for certain groups or sites. However, to capture subtle relationships between disease patterns, socio-economic and genetic factors, as well as complex and rare cases, it is crucial to expose a model to diverse cases.</p><p id="Par9">The need for large databases for AI training has spawned many initiatives seeking to pool data from multiple institutions. This data is often amassed into so-called Data Lakes. These have been built with the aim of leveraging either the commercial value of data, e.g., IBM’s Merge Healthcare acquisition<sup><xref ref-type="bibr" rid="CR21">21</xref></sup>, or as a resource for economic growth and scientific progress, e.g., NHS Scotland’s National Safe Haven<sup><xref ref-type="bibr" rid="CR22">22</xref></sup>, French Health Data Hub<sup><xref ref-type="bibr" rid="CR23">23</xref></sup>, and Health Data Research UK<sup><xref ref-type="bibr" rid="CR24">24</xref></sup>.</p><p id="Par10">Substantial, albeit smaller, initiatives include the Human Connectome<sup><xref ref-type="bibr" rid="CR25">25</xref></sup>, the UK Biobank<sup><xref ref-type="bibr" rid="CR26">26</xref></sup>, the Cancer Imaging Archive (TCIA)<sup><xref ref-type="bibr" rid="CR27">27</xref></sup>, NIH CXR8<sup><xref ref-type="bibr" rid="CR28">28</xref></sup>, NIH DeepLesion<sup><xref ref-type="bibr" rid="CR29">29</xref></sup>, the Cancer Genome Atlas (TCGA)<sup><xref ref-type="bibr" rid="CR30">30</xref></sup>, the Alzheimer’s Disease Neuroimaging Initiative (ADNI)<sup><xref ref-type="bibr" rid="CR31">31</xref></sup>, as well as medical grand challenges<sup><xref ref-type="bibr" rid="CR32">32</xref></sup> such as the CAMELYON challenge<sup><xref ref-type="bibr" rid="CR33">33</xref></sup>, the International multimodal Brain Tumor Segmentation (BraTS) challenge<sup><xref ref-type="bibr" rid="CR34">34</xref>–<xref ref-type="bibr" rid="CR36">36</xref></sup> or the Medical Segmentation Decathlon<sup><xref ref-type="bibr" rid="CR37">37</xref></sup>. Public medical data is usually task- or disease-specific and often released with varying degrees of license restrictions, sometimes limiting its exploitation.</p><p id="Par11">Centralising or releasing data, however, poses not only regulatory, ethical and legal challenges, related to privacy and data protection, but also technical ones. Anonymising, controlling access and safely transferring healthcare data is a non-trivial, and sometimes impossible task. Anonymised data from the electronic health record can appear innocuous and GDPR/PHI compliant, but just a few data elements may allow for patient reidentification<sup><xref ref-type="bibr" rid="CR7">7</xref></sup>. The same applies to genomic data and medical images making them as unique as a fingerprint<sup><xref ref-type="bibr" rid="CR38">38</xref></sup>. Therefore, unless the anonymisation process destroys the fidelity of the data, likely rendering it useless, patient reidentification or information leakage cannot be ruled out. Gated access for approved users is often proposed as a putative solution to this issue. However, besides limiting data availability, this is only practical for cases in which the consent granted by the data owners is unconditional, since recalling data from those who may have had access to the data is practically unenforceable.</p></sec><sec id="Sec4"><title>The promise of federated efforts</title><p id="Par12">The promise of FL is simple—to address privacy and data governance challenges by enabling ML from non-co-located data. In a FL setting, each data controller not only defines its own governance processes and associated privacy policies, but also controls data access and has the ability to revoke it. This includes both the training, as well as the validation phase. In this way, FL could create new opportunities, e.g., by allowing large-scale, in-institutional validation, or by enabling novel research on rare diseases, where the incident rates are low and data sets at each single institution are too small. Moving the model to the data and not vice versa has another major advantage: high-dimensional, storage-intense medical data does not have to be duplicated from local institutions in a centralised pool and duplicated again by every user that uses this data for local model training. As the model is transferred to the local institutions, it can scale naturally with a potentially growing global data set without disproportionately increasing data storage requirements.</p><p id="Par13">As depicted in Fig. <xref rid="Fig2" ref-type="fig">2</xref>, a FL workflow can be realised with different topologies and compute plans. The two most common ones for healthcare applications are via an aggregation server<sup><xref ref-type="bibr" rid="CR16">16</xref>–<xref ref-type="bibr" rid="CR18">18</xref></sup> and peer to peer approaches<sup><xref ref-type="bibr" rid="CR15">15</xref>,<xref ref-type="bibr" rid="CR39">39</xref></sup>. In all cases, FL implicitly offers a certain degree of privacy, as FL participants never directly access data from other institutions and only receive model parameters that are aggregated over several participants. In a FL workflow with aggregation server, the participating institutions can even remain unknown to each other. However, it has been shown that the models themselves can, under certain conditions, memorise information<sup><xref ref-type="bibr" rid="CR40">40</xref>–<xref ref-type="bibr" rid="CR43">43</xref></sup>. Therefore, mechanisms such as differential privacy<sup><xref ref-type="bibr" rid="CR44">44</xref>,<xref ref-type="bibr" rid="CR45">45</xref></sup> or learning from encrypted data have been proposed to further enhance privacy in a FL setting (c.f. section “Technical considerations”). Overall, the potential of FL for healthcare applications has sparked interest in the community<sup><xref ref-type="bibr" rid="CR46">46</xref></sup> and FL techniques are a growing area of research<sup><xref ref-type="bibr" rid="CR12">12</xref>,<xref ref-type="bibr" rid="CR20">20</xref></sup>.<fig id="Fig2" position="float" orientation="portrait"><label>Fig. 2</label><caption><title>Overview of different FL design choices.</title><p>FL topologies—communication architecture of a federation. <bold>a</bold> Centralised: the aggregation server coordinates the training iterations and collects, aggregates and distributes the models to and from the Training Nodes (Hub &amp; Spoke). <bold>b</bold> Decentralised: each training node is connected to one or more peers and aggregation occurs on each node in parallel. <bold>c</bold> Hierarchical: federated networks can be composed from several sub-federations, which can be built from a mix of Peer to Peer and Aggregation Server federations (<bold>d</bold>)). FL compute plans—trajectory of a model across several partners. <bold>e</bold> Sequential training/cyclic transfer learning. <bold>f</bold> Aggregation server, <bold>g</bold> Peer to Peer.</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" id="d32e742" position="float" orientation="portrait" xlink:href="/publication/142/files/1552"/></fig></p></sec><sec id="Sec5"><title>Current FL efforts for digital health</title><p id="Par14">Since FL is a general learning paradigm that removes the data pooling requirement for AI model development, the application range of FL spans the whole of AI for healthcare. By providing an opportunity to capture larger data variability and to analyse patients across different demographics, FL may enable disruptive innovations for the future but is also being employed right now.</p><p id="Par15">In the context of electronic health records (EHR), for example, FL helps to represent and to find clinically similar patients<sup><xref ref-type="bibr" rid="CR13">13</xref>,<xref ref-type="bibr" rid="CR47">47</xref></sup>, as well as predicting hospitalisations due to cardiac events<sup><xref ref-type="bibr" rid="CR14">14</xref></sup>, mortality and ICU stay time<sup><xref ref-type="bibr" rid="CR19">19</xref></sup>. The applicability and advantages of FL have also been demonstrated in the field of medical imaging, for whole-brain segmentation in MRI<sup><xref ref-type="bibr" rid="CR15">15</xref></sup>, as well as brain tumour segmentation<sup><xref ref-type="bibr" rid="CR16">16</xref>,<xref ref-type="bibr" rid="CR17">17</xref></sup>. Recently, the technique has been employed for fMRI classification to find reliable disease-related biomarkers<sup><xref ref-type="bibr" rid="CR18">18</xref></sup> and suggested as a promising approach in the context of COVID-19<sup><xref ref-type="bibr" rid="CR48">48</xref></sup>.</p><p id="Par16">It is worth noting that FL efforts require agreements to define the scope, aim and technologies used which, since it is still novel, can be difficult to pin down. In this context, today’s large-scale initiatives really are the pioneers of tomorrow’s standards for safe, fair and innovative collaboration in healthcare applications.</p><p id="Par17">These include consortia that aim to advance <italic toggle="yes">academic</italic> research, such as the Trustworthy Federated Data Analytics (TFDA) project<sup><xref ref-type="bibr" rid="CR49">49</xref></sup> and the German Cancer Consortium’s Joint Imaging Platform<sup><xref ref-type="bibr" rid="CR50">50</xref></sup>, which enable decentralised research across German medical imaging research institutions. Another example is an international research collaboration that uses FL for the development of AI models for the assessment of mammograms<sup><xref ref-type="bibr" rid="CR51">51</xref></sup>. The study showed that the FL-generated models outperformed those trained on a single institute’s data and were more generalisable, so that they still performed well on other institutes’ data. However, FL is not limited just to academic environments.</p><p id="Par18">By linking healthcare institutions, not restricted to research centres, FL can have direct <italic toggle="yes">clinical</italic> impact. The on-going HealthChain project<sup><xref ref-type="bibr" rid="CR52">52</xref></sup>, for example, aims to develop and deploy a FL framework across four hospitals in France. This solution generates common models that can predict treatment response for breast cancer and melanoma patients. It helps oncologists to determine the most effective treatment for each patient from their histology slides or dermoscopy images. Another large-scale effort is the Federated Tumour Segmentation (FeTS) initiative<sup><xref ref-type="bibr" rid="CR53">53</xref></sup>, which is an international federation of 30 committed healthcare institutions using an open-source FL framework with a graphical user interface. The aim is to improve tumour boundary detection, including brain glioma, breast tumours, liver tumours and bone lesions from multiple myeloma patients.</p><p id="Par19">Another area of impact is within <italic toggle="yes">industrial</italic> research and translation. FL enables collaborative research for, even competing, companies. In this context, one of the largest initiatives is the Melloddy project<sup><xref ref-type="bibr" rid="CR54">54</xref></sup>. It is a project aiming to deploy multi-task FL across the data sets of 10 pharmaceutical companies. By training a common predictive model, which infers how chemical compounds bind to proteins, partners intend to optimise the drug discovery process without revealing their highly valuable in-house data.</p></sec><sec id="Sec6"><title>Impact on stakeholders</title><p id="Par20">FL comprises a paradigm shift from centralised data lakes and it is important to understand its impact on the various stakeholders in a FL ecosystem.</p><sec id="Sec7"><title>Clinicians</title><p id="Par21">Clinicians are usually exposed to a sub-group of the population based on their location and demographic environment, which may cause biased assumptions about the probability of certain diseases or their interconnection. By using ML-based systems, e.g., as a second reader, they can augment their own expertise with expert knowledge from other institutions, ensuring a consistency of diagnosis not attainable today. While this applies to ML-based system in general, systems trained in a federated fashion are potentially able to yield even less biased decisions and higher sensitivity to rare cases as they were likely exposed to a more complete data distribution. However, this demands some up-front effort such as compliance with agreements, e.g., regarding the data structure, annotation and report protocol, which is necessary to ensure that the information is presented to collaborators in a commonly understood format.</p></sec><sec id="Sec8"><title>Patients</title><p id="Par22">Patients are usually treated locally. Establishing FL on a global scale could ensure high quality of clinical decisions regardless of the treatment location. In particular, patients requiring medical attention in remote areas could benefit from the same high-quality ML-aided diagnoses that are available in hospitals with a large number of cases. The same holds true for rare, or geographically uncommon, diseases, that are likely to have milder consequences if faster and more accurate diagnoses can be made. FL may also lower the hurdle for becoming a data donor, since patients can be reassured that the data remains with their own institution and data access can be revoked.</p></sec><sec id="Sec9"><title>Hospitals and practices</title><p id="Par23">Hospitals and practices can remain in full control and possession of their patient data with complete traceability of data access, limiting the risk of misuse by third parties. However, this will require investment in on-premise computing infrastructure or private-cloud service provision and adherence to standardised and synoptic data formats so that ML models can be trained and evaluated seamlessly. The amount of necessary compute capability depends of course on whether a site is only participating in evaluation and testing efforts or also in training efforts. Even relatively small institutions can participate and they will still benefit from collective models generated.</p></sec><sec id="Sec10"><title>Researchers and AI developers</title><p id="Par24">Researchers and AI developers stand to benefit from access to a potentially vast collection of real-world data, which will particularly impact smaller research labs and start-ups. Thus, resources can be directed towards solving clinical needs and associated technical problems rather than relying on the limited supply of open data sets. At the same time, it will be necessary to conduct research on algorithmic strategies for federated training, e.g., how to combine models or updates efficiently, how to be robust to distribution shifts<sup><xref ref-type="bibr" rid="CR11">11</xref>,<xref ref-type="bibr" rid="CR12">12</xref>,<xref ref-type="bibr" rid="CR20">20</xref></sup>. FL-based development implies also that the researcher or AI developer cannot investigate or visualise all of the data on which the model is trained, e.g., it is not possible to look at an individual failure case to understand why the current model performs poorly on it.</p></sec><sec id="Sec11"><title>Healthcare providers</title><p id="Par25">Healthcare providers in many countries are affected by the on-going paradigm shift from volume-based, i.e., fee-for-service-based, to value-based healthcare, which is in turn strongly connected to the successful establishment of precision medicine. This is not about promoting more expensive individualised therapies but instead about achieving better outcomes sooner through more focused treatment, thereby reducing the cost. FL has the potential to increase the accuracy and robustness of healthcare AI, while reducing costs and improving patient outcomes, and may therefore be vital to precision medicine.</p></sec><sec id="Sec12"><title>Manufacturers</title><p id="Par26">Manufacturers of healthcare software and hardware could benefit from FL as well, since combining the learning from many devices and applications, without revealing patient-specific information, can facilitate the continuous validation or improvement of their ML-based systems. However, realising such a capability may require significant upgrades to local compute, data storage, networking capabilities and associated software.</p></sec></sec></sec><sec id="Sec13"><title>Technical considerations</title><p id="Par27">FL is perhaps best-known from the work of Konečnỳ et al.<sup><xref ref-type="bibr" rid="CR55">55</xref></sup>, but various other definitions have been proposed in the literature<sup><xref ref-type="bibr" rid="CR9">9</xref>,<xref ref-type="bibr" rid="CR11">11</xref>,<xref ref-type="bibr" rid="CR12">12</xref>,<xref ref-type="bibr" rid="CR20">20</xref></sup>. A FL workflow (Fig. <xref rid="Fig1" ref-type="fig">1</xref>) can be realised via different topologies and compute plans (Fig. <xref rid="Fig2" ref-type="fig">2</xref>), but the goal remains the same, i.e., to combine knowledge learned from non-co-located data. In this section, we will discuss in more detail what FL is, as well as highlighting the key challenges and technical considerations that arise when applying FL in digital health.</p><sec id="Sec14"><title>Federated learning definition</title><p id="Par28">FL is a learning paradigm in which multiple parties train collaboratively without the need to exchange or centralise data sets. A general formulation of FL reads as follows: Let <inline-formula id="IEq1"><alternatives><tex-math id="M1">\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$${\mathcal{L}}$$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M2"><mml:mi class="MJX-tex-caligraphic" mathvariant="script">L</mml:mi></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="41746_2020_323_Article_IEq1.gif"/></alternatives></inline-formula> denote a global loss function obtained via a weighted combination of <italic toggle="yes">K</italic> local losses <inline-formula id="IEq2"><alternatives><tex-math id="M3">\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$${\{{{\mathcal{L}}}_{k}\}}_{k = 1}^{K}$$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M4"><mml:msubsup><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">L</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>K</mml:mi></mml:mrow></mml:msubsup></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="41746_2020_323_Article_IEq2.gif"/></alternatives></inline-formula>, computed from private data <italic toggle="yes">X</italic><sub><italic toggle="yes">k</italic></sub>, which is residing at the individual involved parties and never shared among them:<disp-formula id="Equ1"><label>1</label><alternatives><tex-math id="M5">\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$$\mathop{\min }\limits_{\phi }{\mathcal{L}}(X;\phi)\quad \,\text{with}\,\quad {\mathcal{L}}(X;\phi)=\mathop{\sum }\limits_{k = 1}^{K}{w}_{k}\ {{\mathcal{L}}}_{k}({X}_{k};\phi),$$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M6"><mml:mrow><mml:munder><mml:mrow><mml:mi>min</mml:mi></mml:mrow><mml:mrow><mml:mi>ϕ</mml:mi></mml:mrow></mml:munder><mml:mi mathvariant="script">L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>X</mml:mi><mml:mo>;</mml:mo><mml:mi>ϕ</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="1.0em"/><mml:mspace width="0.25em"/><mml:mi mathvariant="normal">with</mml:mi><mml:mspace width="0.25em"/><mml:mspace width="1.0em"/><mml:mi mathvariant="script">L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>X</mml:mi><mml:mo>;</mml:mo><mml:mi>ϕ</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munderover accent="false" accentunder="false"><mml:mrow><mml:mo>∑</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>K</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mspace width="0.33em"/><mml:msub><mml:mrow><mml:mi mathvariant="script">L</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>;</mml:mo><mml:mi>ϕ</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mrow></mml:math><graphic xmlns:xlink="http://www.w3.org/1999/xlink" position="anchor" orientation="portrait" xlink:href="41746_2020_323_Article_Equ1.gif"/></alternatives></disp-formula>where <italic toggle="yes">w</italic><sub><italic toggle="yes">k</italic></sub> &gt; 0 denote the respective weight coefficients.</p><p id="Par29">In practice, each participant typically obtains and refines a global consensus model by conducting a few rounds of optimisation locally and before sharing updates, either directly or via a parameter server. The more rounds of local training are performed, the less it is guaranteed that the overall procedure is minimising (Eq. <xref rid="Equ1" ref-type="">1</xref>)<sup><xref ref-type="bibr" rid="CR9">9</xref>,<xref ref-type="bibr" rid="CR12">12</xref></sup>. The actual process for aggregating parameters depends on the network topology, as nodes might be segregated into sub-networks due to geographical or legal constraints (see Fig. <xref rid="Fig2" ref-type="fig">2</xref>). Aggregation strategies can rely on a single aggregating node (hub and spokes models), or on multiple nodes without any centralisation. An example is peer-to-peer FL, where connections exist between all or a subset of the participants and model updates are shared only between directly connected sites<sup><xref ref-type="bibr" rid="CR15">15</xref>,<xref ref-type="bibr" rid="CR56">56</xref></sup>, whereas an example of centralised FL aggregation is given in Algorithm 1. Note that aggregation strategies do not necessarily require information about the full model update; clients might chose to share only a subset of the model parameters for the sake of reducing communication overhead, ensure better privacy preservation<sup><xref ref-type="bibr" rid="CR10">10</xref></sup> or to produce multi-task learning algorithms having only part of their parameters learned in a federated manner.</p><p id="Par30">A unifying framework enabling various training schemes may disentangle compute resources (data and servers) from the <italic toggle="yes">compute plan</italic>, as depicted in Fig. <xref rid="Fig2" ref-type="fig">2</xref>. The latter defines the trajectory of a model across several partners, to be trained and evaluated on specific data sets.</p><sec id="FPar1"><title>Algorithm 1</title><p id="Par31">Example of a FL algorithm<sup><xref ref-type="bibr" rid="CR16">16</xref></sup> via Hub &amp; Spoke (Centralised topology) with FedAvg aggregation<sup><xref ref-type="bibr" rid="CR9">9</xref></sup>.<table-wrap id="Taba" position="float" orientation="portrait"><table frame="hsides" rules="groups"><tbody><tr><td colspan="1" rowspan="1"><bold>Require:</bold> num_federated_rounds <italic toggle="yes">T</italic></td></tr><tr><td colspan="1" rowspan="1"> 1: <bold>procedure</bold> AGGREGATING</td></tr><tr><td colspan="1" rowspan="1"> 2: Initialise global model: <italic toggle="yes">W</italic><sup>(0)</sup></td></tr><tr><td colspan="1" rowspan="1"> 3: <bold>for</bold>
<italic toggle="yes">t</italic> ← 1 ⋯ <italic toggle="yes">T</italic>
<bold>do</bold></td></tr><tr><td colspan="1" rowspan="1"> 4: <bold>for</bold>
<italic toggle="yes">c</italic><italic toggle="yes">l</italic><italic toggle="yes">i</italic><italic toggle="yes">e</italic><italic toggle="yes">n</italic><italic toggle="yes">t</italic>
<italic toggle="yes">k</italic> ← 1 ⋯ <italic toggle="yes">K</italic>
<bold>do </bold> ⊳ <italic toggle="yes">Run in parallel</italic></td></tr><tr><td colspan="1" rowspan="1"> 5: Send <italic toggle="yes">W</italic><sup>(<italic toggle="yes">t</italic>−1)</sup> to client <italic toggle="yes">k</italic></td></tr><tr><td colspan="1" rowspan="1"> 6: Receive model updates and number of local training iterations <inline-formula id="IEq3"><alternatives><tex-math id="M7">\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$$(\Delta {W}_{k}^{(t-1)},{N}_{k})$$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M8"><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">Δ</mml:mi><mml:msubsup><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="41746_2020_323_Article_IEq3.gif"/></alternatives></inline-formula> from client’s local training with <inline-formula id="IEq4"><alternatives><tex-math id="M9">\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$${{\mathcal{L}}}_{k}({X}_{k};{W}^{(t-1)})$$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M10"><mml:mrow><mml:msub><mml:mrow><mml:mi class="MJX-tex-caligraphic" mathvariant="script">L</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>;</mml:mo><mml:msup><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="41746_2020_323_Article_IEq4.gif"/></alternatives></inline-formula></td></tr><tr><td colspan="1" rowspan="1"> 7: <bold>end for</bold></td></tr><tr><td colspan="1" rowspan="1"> 8: <inline-formula id="IEq5"><alternatives><tex-math id="M11">\documentclass[12pt]{minimal}
				\usepackage{amsmath}
				\usepackage{wasysym} 
				\usepackage{amsfonts} 
				\usepackage{amssymb} 
				\usepackage{amsbsy}
				\usepackage{mathrsfs}
				\usepackage{upgreek}
				\setlength{\oddsidemargin}{-69pt}
				\begin{document}$${W}^{(t)}\leftarrow {W}^{(t-1)}+\frac{1}{{\sum }_{k}{N}_{k}}{\sum }_{k}({N}_{k}\cdot {W}_{k}^{(t-1)})$$\end{document}</tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M12"><mml:mrow><mml:msup><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>←</mml:mo><mml:msup><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mo>∑</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:msub><mml:mrow><mml:mo>∑</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>⋅</mml:mo><mml:msubsup><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="41746_2020_323_Article_IEq5.gif"/></alternatives></inline-formula></td></tr><tr><td colspan="1" rowspan="1"> 9: <bold>end for</bold></td></tr><tr><td colspan="1" rowspan="1"> 10: <bold>return</bold>
<italic toggle="yes">W</italic><sup>(<italic toggle="yes">t</italic>)</sup></td></tr><tr><td colspan="1" rowspan="1"> 11: <bold>end procedure</bold></td></tr></tbody></table></table-wrap></p></sec></sec><sec id="Sec15"><title>Challenges and considerations</title><p id="Par32">Despite the advantages of FL, it does not solve all issues that are inherent to learning on medical data. A successful model training still depends on factors like data quality, bias and standardisation<sup><xref ref-type="bibr" rid="CR2">2</xref></sup>. These issues have to be solved for both federated and non-federated learning efforts via appropriate measures, such as careful study design, common protocols for data acquisition, structured reporting and sophisticated methodologies for discovering bias and hidden stratification. In the following, we touch upon the key aspects of FL that are of particular relevance when applied to digital health and need to be taken into account when establishing FL. For technical details and in-depth discussion, we refer the reader to recent surveys<sup><xref ref-type="bibr" rid="CR11">11</xref>,<xref ref-type="bibr" rid="CR12">12</xref>,<xref ref-type="bibr" rid="CR20">20</xref></sup>.</p><sec id="Sec16"><title>Data heterogeneity</title><p id="Par33">Medical data is particularly diverse—not only because of the variety of modalities, dimensionality and characteristics in general, but even within a specific protocol due to factors such as acquisition differences, brand of the medical device or local demographics. FL may help address certain sources of bias through potentially increased diversity of data sources, but inhomogeneous data distribution poses a challenge for FL algorithms and strategies, as many are assuming independently and identically distributed (IID) data across the participants. In general, strategies such as <italic toggle="yes">FedAvg</italic><sup><xref ref-type="bibr" rid="CR9">9</xref></sup> are prone to fail under these conditions<sup><xref ref-type="bibr" rid="CR9">9</xref>,<xref ref-type="bibr" rid="CR57">57</xref>,<xref ref-type="bibr" rid="CR58">58</xref></sup>, in part defeating the very purpose of collaborative learning strategies. Recent results, however, indicate that FL training is still feasible<sup><xref ref-type="bibr" rid="CR59">59</xref></sup>, even if medical data is not uniformly distributed across the institutions<sup><xref ref-type="bibr" rid="CR16">16</xref>,<xref ref-type="bibr" rid="CR17">17</xref></sup> or includes a local bias<sup><xref ref-type="bibr" rid="CR51">51</xref></sup>. Research addressing this problem includes, for example, <italic toggle="yes">FedProx</italic><sup><xref ref-type="bibr" rid="CR57">57</xref></sup>, part-data-sharing strategy<sup><xref ref-type="bibr" rid="CR58">58</xref></sup> and FL with domain-adaptation<sup><xref ref-type="bibr" rid="CR18">18</xref></sup>. Another challenge is that data heterogeneity may lead to a situation in which the global optimal solution may not be optimal for an individual local participant. The definition of model training optimality should, therefore, be agreed by all participants before training.</p></sec><sec id="Sec17"><title>Privacy and security</title><p id="Par34">Healthcare data is highly sensitive and must be protected accordingly, following appropriate confidentiality procedures. Therefore, some of the key considerations are the trade-offs, strategies and remaining risks regarding the privacy-preserving potential of FL.</p><p id="Par35">Privacy vs. performance: It is important to note that FL does not solve all potential privacy issues and—similar to ML algorithms in general—will always carry some risks. Privacy-preserving techniques for FL offer levels of protection that exceed today’s current commercially available ML models<sup><xref ref-type="bibr" rid="CR12">12</xref></sup>. However, there is a trade-off in terms of performance and these techniques may affect, for example, the accuracy of the final model<sup><xref ref-type="bibr" rid="CR10">10</xref></sup>. Furthermore, future techniques and/or ancillary data could be used to compromise a model previously considered to be low-risk.</p><p id="Par36">Level of trust: Broadly speaking, participating parties can enter two types of FL collaboration:</p><p id="Par37"><italic toggle="yes">Trusted</italic>—for FL consortia in which all parties are considered trustworthy and are bound by an enforceable collaboration agreement, we can eliminate many of the more nefarious motivations, such as deliberate attempts to extract sensitive information or to intentionally corrupt the model. This reduces the need for sophisticated counter-measures, falling back to the principles of standard collaborative research.</p><p id="Par38"><italic toggle="yes">Non-trusted</italic>—in FL systems that operate on larger scales, it might be impractical to establish an enforceable collaborative agreement. Some clients may deliberately try to degrade performance, bring the system down or extract information from other parties. Hence, security strategies will be required to mitigate these risks such as, advanced encryption of model submissions, secure authentication of all parties, traceability of actions, differential privacy, verification systems, execution integrity, model confidentiality and protections against adversarial attacks.</p><p id="Par39">Information leakage: By definition, FL systems avoid sharing healthcare data among participating institutions. However, the shared information may still indirectly expose private data used for local training, e.g., by model inversion<sup><xref ref-type="bibr" rid="CR60">60</xref></sup> of the model updates, the gradients themselves<sup><xref ref-type="bibr" rid="CR61">61</xref></sup> or adversarial attacks<sup><xref ref-type="bibr" rid="CR62">62</xref>,<xref ref-type="bibr" rid="CR63">63</xref></sup>. FL is different from traditional training insofar as the training process is exposed to multiple parties, thereby increasing the risk of leakage via reverse-engineering if adversaries can observe model changes over time, observe specific model updates (i.e., a single institution’s update), or manipulate the model (e.g., induce additional memorisation by others through gradient-ascent-style attacks). Developing counter-measures, such as limiting the granularity of the updates and adding noise<sup><xref ref-type="bibr" rid="CR16">16</xref>,<xref ref-type="bibr" rid="CR18">18</xref></sup> and ensuring adequate differential privacy<sup><xref ref-type="bibr" rid="CR44">44</xref></sup>, may be needed and is still an active area of research<sup><xref ref-type="bibr" rid="CR12">12</xref></sup>.</p></sec><sec id="Sec18"><title>Traceability and accountability</title><p id="Par40">As per all safety-critical applications, the reproducibility of a system is important for FL in healthcare. In contrast to centralised training, FL requires multi-party computations in environments that exhibit considerable variety in terms of hardware, software and networks. Traceability of all system assets including data access history, training configurations, and hyperparameter tuning throughout the training processes is thus mandatory. In particular in non-trusted federations, traceability and accountability processes require execution integrity. After the training process reaches the mutually agreed model optimality criteria, it may also be helpful to measure the amount of contribution from each participant, such as computational resources consumed, quality of the data used for local training, etc. These measurements could then be used to determine relevant compensation, and establish a revenue model among the participants<sup><xref ref-type="bibr" rid="CR64">64</xref></sup>. One implication of FL is that researchers are not able to investigate data upon which models are being trained to make sense of unexpected results. Moreover, taking statistical measurements of their training data as part of the model development workflow will need to be approved by the collaborating parties as not violating privacy. Although each site will have access to its own raw data, federations may decide to provide some sort of secure intra-node viewing facility to cater for this need or may provide some other way to increase explainability and interpretability of the global model.</p></sec><sec id="Sec19"><title>System architecture</title><p id="Par41">Unlike running large-scale FL amongst consumer devices such as McMahan et al.<sup><xref ref-type="bibr" rid="CR9">9</xref></sup>, healthcare institutional participants are equipped with relatively powerful computational resources and reliable, higher-throughput networks enabling training of larger models with many more local training steps, and sharing more model information between nodes. These unique characteristics of FL in healthcare also bring challenges such as ensuring data integrity when communicating by use of redundant nodes, designing secure encryption methods to prevent data leakage, or designing appropriate node schedulers to make best-use of the distributed computational devices and reduce idle time.</p><p id="Par42">The administration of such a federation can be realised in different ways. In situations requiring the most stringent data privacy between parties, training may operate via some sort of “honest broker” system, in which a trusted third party acts as the intermediary and facilitates access to data. This setup requires an independent entity controlling the overall system, which may not always be desirable, since it could involve additional cost and procedural viscosity. However, it has the advantage that the precise internal mechanisms can be abstracted away from the clients, making the system more agile and simpler to update. In a peer-to-peer system each site interacts directly with some or all of the other participants. In other words, there is no gatekeeper function, all protocols must be agreed up-front, which requires significant agreement efforts, and changes must be made in a synchronised fashion by all parties to avoid problems. Additionally, in a trustless-based architecture the platform operator may be cryptographically locked into being honest by means of a secure protocol, but this may introduce significant computational overheads.</p></sec></sec></sec><sec id="Sec20" sec-type="conclusion"><title>Conclusion</title><p id="Par43">ML, and particularly DL, has led to a wide range of innovations in the area of digital healthcare. As all ML methods benefit greatly from the ability to access data that approximates the true global distribution, FL is a promising approach to obtain powerful, accurate, safe, robust and unbiased models. By enabling multiple parties to train collaboratively without the need to exchange or centralise data sets, FL neatly addresses issues related to egress of sensitive medical data. As a consequence, it may open novel research and business avenues and has the potential to improve patient care globally. However, already today, FL has an impact on nearly all stakeholders and the entire treatment cycle, ranging from improved medical image analysis providing clinicians with better diagnostic tools, over true precision medicine by helping to find similar patients, to collaborative and accelerated drug discovery decreasing cost and time-to-market for pharma companies. Not all technical questions have been answered yet and FL will certainly be an active research area throughout the next decade <sup><xref ref-type="bibr" rid="CR12">12</xref></sup>. Despite this, we truly believe that its potential impact on precision medicine and ultimately improving medical care is very promising.</p><sec id="Sec21"><title>Reporting summary</title><p id="Par44">Further information on research design is available in the <xref rid="MOESM1" ref-type="media">Nature Research Reporting Summary</xref> linked to this article.</p></sec></sec><sec sec-type="supplementary-material"><title>Supplementary information</title><sec id="Sec22"><p>
<supplementary-material content-type="local-data" id="MOESM1" position="float" orientation="portrait"><media xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="41746_2020_323_MOESM1_ESM.pdf" position="float" orientation="portrait"><caption><p>Reporting Summary Checklist FLAT</p></caption></media></supplementary-material>
</p></sec></sec></body>
  <back><fn-group><fn><p><bold>Publisher’s note</bold> Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.</p></fn></fn-group><sec><title>Supplementary information</title><p><bold>Supplementary information</bold> is available for this paper at 10.1038/s41746-020-00323-1.</p></sec><ack><title>Acknowledgements</title><p>This work was supported by the UK Research and Innovation London Medical Imaging &amp; Artificial Intelligence Centre for Value-Based Healthcare, by the Wellcome/EPSRC Centre for Medical Engineering (WT203148/Z/16/Z), by the Wellcome Flagship Programme (WT213038/Z/18/Z), by the Intramural Research Programme of the National Institutes of Health (NIH) Clinical Center, by the National Cancer Institute of the NIH under award number U01CA242871, by the National Institute of Neurological Disorders and Stroke of the NIH under award number R01NS042645, as well as by the Helmholtz Initiative and Networking Fund (project “Trustworthy Federated Data Analytics”) and the PRIME programme of the German Academic Exchange Service (DAAD) with funds from the German Federal Ministry of Education and Research (BMBF). The content and opinions expressed in this publication is solely the responsibility of the authors and do not necessarily represent those of the institutions they are affiliated with, e.g., the U.S. Department of Health and Human Services or the National Institutes of Health. Open access funding provided by Projekt DEAL.</p></ack><notes notes-type="author-contribution"><title>Author contributions</title><p>N.R., J.H., W.L., F.M., H.R. and M.J.C. developed the concept for the article and created the initial draft. N.R. lead the manuscript writing and finalised the article. J.H., B.L. and M.N.G drafted and J.H. created the figures. All authors contributed expertise and edits to the contents of this manuscript. In particular, S.A., K.M.H. and M.S. supported the editing of the technical considerations of FL, R.M.S. and M.B. advised on the clinical and technical perspective, respectively. The final manuscript was approved by all authors.</p></notes><notes id="FPar2" notes-type="COI-statement"><title>Competing interests</title><p id="Par45">R.M.S. receives royalties from iCAD, ScanMed, Philips, Translation Holdings and Ping An. His lab has received research support from Ping An and NVIDIA. S.B. is supported by the National Institutes of Health (NIH). M.N.G. is supported by the HealthChain (BPIFrance) and Melloddy (IMI2) projects. A.T. is an employee of Google’s DeepMind. S.O. and M.J.C. are founders and shareholders of Brainminer, llc. The other authors declare no competing interests.</p></notes><ref-list id="Bib1"><title>References</title><ref id="CR1"><label>1.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>LeCun</surname><given-names>Y</given-names></name><name name-style="western"><surname>Bengio</surname><given-names>Y</given-names></name><name name-style="western"><surname>Hinton</surname><given-names>G</given-names></name></person-group><article-title>Deep learning</article-title><source>Nature</source><year>2015</year><volume>521</volume><fpage>436</fpage><pub-id pub-id-type="doi">10.1038/nature14539</pub-id><pub-id pub-id-type="pmid">26017442</pub-id></element-citation></ref><ref id="CR2"><label>2.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Wang</surname><given-names>F</given-names></name><name name-style="western"><surname>Casalino</surname><given-names>LP</given-names></name><name name-style="western"><surname>Khullar</surname><given-names>D</given-names></name></person-group><article-title>Deep learning in medicine—promise, progress, and challenges</article-title><source>JAMA Intern. Med.</source><year>2019</year><volume>179</volume><fpage>293</fpage><lpage>294</lpage><pub-id pub-id-type="doi">10.1001/jamainternmed.2018.7117</pub-id><pub-id pub-id-type="pmid">30556825</pub-id></element-citation></ref><ref id="CR3"><label>3.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Chartrand</surname><given-names>G</given-names></name><etal/></person-group><article-title>Deep learning: a primer for radiologists</article-title><source>Radiographics</source><year>2017</year><volume>37</volume><fpage>2113</fpage><lpage>2131</lpage><pub-id pub-id-type="doi">10.1148/rg.2017170077</pub-id><pub-id pub-id-type="pmid">29131760</pub-id></element-citation></ref><ref id="CR4"><label>4.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>De Fauw</surname><given-names>J</given-names></name><etal/></person-group><article-title>Clinically applicable deep learning for diagnosis and referral in retinal disease</article-title><source>Nat. Med.</source><year>2018</year><volume>24</volume><fpage>1342</fpage><pub-id pub-id-type="doi">10.1038/s41591-018-0107-6</pub-id><pub-id pub-id-type="pmid">30104768</pub-id></element-citation></ref><ref id="CR5"><label>5.</label><mixed-citation publication-type="other">Sun, C., Shrivastava, A., Singh, S. &amp; Gupta, A. Revisiting unreasonable effectiveness of data in deep learning era. In <italic toggle="yes">Proceedings of the IEEE international conference on computer vision</italic>, 843–852 (<italic toggle="yes">IEEE</italic>, 2017).</mixed-citation></ref><ref id="CR6"><label>6.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Van Panhuis</surname><given-names>WG</given-names></name><etal/></person-group><article-title>A systematic review of barriers to data sharing in public health</article-title><source>BMC Public Health</source><year>2014</year><volume>14</volume><fpage>1144</fpage><pub-id pub-id-type="doi">10.1186/1471-2458-14-1144</pub-id><pub-id pub-id-type="pmid">25377061</pub-id><pub-id pub-id-type="pmcid">PMC4239377</pub-id></element-citation></ref><ref id="CR7"><label>7.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Rocher</surname><given-names>L</given-names></name><name name-style="western"><surname>Hendrickx</surname><given-names>JM</given-names></name><name name-style="western"><surname>De Montjoye</surname><given-names>Y-A</given-names></name></person-group><article-title>Estimating the success of re-identifications in incomplete datasets using generative models</article-title><source>Nat. Commun.</source><year>2019</year><volume>10</volume><fpage>1</fpage><lpage>9</lpage><pub-id pub-id-type="doi">10.1038/s41467-019-10933-3</pub-id><pub-id pub-id-type="pmid">31337762</pub-id><pub-id pub-id-type="pmcid">PMC6650473</pub-id></element-citation></ref><ref id="CR8"><label>8.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Schwarz</surname><given-names>CG</given-names></name><etal/></person-group><article-title>Identification of anonymous mri research participants with face-recognition software</article-title><source>N. Engl. J. Med.</source><year>2019</year><volume>381</volume><fpage>1684</fpage><lpage>1686</lpage><pub-id pub-id-type="doi">10.1056/NEJMc1908881</pub-id><pub-id pub-id-type="pmid">31644852</pub-id><pub-id pub-id-type="pmcid">PMC7091256</pub-id></element-citation></ref><ref id="CR9"><label>9.</label><mixed-citation publication-type="other">McMahan, B., Moore, E., Ramage, D., Hampson, S. &amp; y Arcas, B. A. Communication-efficient learning of deep networks from decentralized data. In <italic toggle="yes">Artificial Intelligence and Statistics</italic>, 1273–1282. <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://scholar.google.de/scholar?hl=de&amp;as_sdt=0%2C5&amp;q=Communicationefficient+learning+of+deep+networks+from+decentralized+data&amp;btnG=">https://scholar.google.de/scholar?hl=de&amp;as_sdt=0%2C5&amp;q=Communicationefficient+learning+of+deep+networks+from+decentralized+data&amp;btnG=</ext-link> (2017).</mixed-citation></ref><ref id="CR10"><label>10.</label><mixed-citation publication-type="other">Li, T., Sahu, A. K., Talwalkar, A. &amp; Smith, V. Federated learning: Challenges, methods, and future directions. <italic toggle="yes">IEEE Signal Processing Magazine</italic><bold>37</bold>, 50–60 (IEEE, 2020).</mixed-citation></ref><ref id="CR11"><label>11.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Yang</surname><given-names>Q</given-names></name><name name-style="western"><surname>Liu</surname><given-names>Y</given-names></name><name name-style="western"><surname>Chen</surname><given-names>T</given-names></name><name name-style="western"><surname>Tong</surname><given-names>Y</given-names></name></person-group><article-title>Federated machine learning: concept and applications</article-title><source>ACM Trans. Intell. Syst. Technol.</source><year>2019</year><volume>10</volume><fpage>12</fpage></element-citation></ref><ref id="CR12"><label>12.</label><mixed-citation publication-type="other">Kairouz, P. et al. Advances and open problems in federated learning. <italic toggle="yes">arXiv preprint arXiv:1912.04977</italic> (2019).</mixed-citation></ref><ref id="CR13"><label>13.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Lee</surname><given-names>J</given-names></name><etal/></person-group><article-title>Privacy-preserving patient similarity learning in a federated environment: development and analysis</article-title><source>JMIR Med. Inform.</source><year>2018</year><volume>6</volume><fpage>e20</fpage><pub-id pub-id-type="doi">10.2196/medinform.7744</pub-id><pub-id pub-id-type="pmid">29653917</pub-id><pub-id pub-id-type="pmcid">PMC5924379</pub-id></element-citation></ref><ref id="CR14"><label>14.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Brisimi</surname><given-names>TS</given-names></name><etal/></person-group><article-title>Federated learning of predictive models from federated electronic health records</article-title><source>Int. J. Med. Inform.</source><year>2018</year><volume>112</volume><fpage>59</fpage><lpage>67</lpage><pub-id pub-id-type="doi">10.1016/j.ijmedinf.2018.01.007</pub-id><pub-id pub-id-type="pmid">29500022</pub-id><pub-id pub-id-type="pmcid">PMC5836813</pub-id></element-citation></ref><ref id="CR15"><label>15.</label><mixed-citation publication-type="other">Roy, A. G., Siddiqui, S., Pölsterl, S., Navab, N. &amp; Wachinger, C. Braintorrent: a peer-to-peer environment for decentralized federated learning. <italic toggle="yes">arXiv preprint arXiv:1905.06731</italic> (2019).</mixed-citation></ref><ref id="CR16"><label>16.</label><mixed-citation publication-type="other">Li, W. et al. Privacy-preserving federated brain tumour segmentation. In <italic toggle="yes">International Workshop on Machine Learning in Medical Imaging</italic>, 133–141 (Springer, 2019).<pub-id pub-id-type="doi" assigning-authority="pmc">10.1007/978-3-030-32692-0_16</pub-id><pub-id pub-id-type="pmcid">PMC7616593</pub-id><pub-id pub-id-type="pmid">39453415</pub-id></mixed-citation></ref><ref id="CR17"><label>17.</label><mixed-citation publication-type="other">Sheller, M. J., Reina, G. A., Edwards, B., Martin, J. &amp; Bakas, S. Multi-institutional deep learning modeling without sharing patient data: a feasibility study on brain tumor segmentation. In <italic toggle="yes">International MICCAI Brainlesion Workshop</italic>, 92–104 (Springer, 2018).<pub-id pub-id-type="doi" assigning-authority="pmc">10.1007/978-3-030-11723-8_9</pub-id><pub-id pub-id-type="pmcid">PMC6589345</pub-id><pub-id pub-id-type="pmid">31231720</pub-id></mixed-citation></ref><ref id="CR18"><label>18.</label><mixed-citation publication-type="other">Li, X. et al. Multi-site fmri analysis using privacy-preserving federated learning and domain adaptation: abide results. <italic toggle="yes">arXiv preprint arXiv:2001.05647</italic> (2020).<pub-id pub-id-type="doi" assigning-authority="pmc">10.1016/j.media.2020.101765</pub-id><pub-id pub-id-type="pmcid">PMC7569477</pub-id><pub-id pub-id-type="pmid">32679533</pub-id></mixed-citation></ref><ref id="CR19"><label>19.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Huang</surname><given-names>L</given-names></name><etal/></person-group><article-title>Patient clustering improves efficiency of federated machine learning to predict mortality and hospital stay time using distributed electronic medical records</article-title><source>J. Biomed. Inform.</source><year>2019</year><volume>99</volume><fpage>103291</fpage><pub-id pub-id-type="doi">10.1016/j.jbi.2019.103291</pub-id><pub-id pub-id-type="pmid">31560949</pub-id></element-citation></ref><ref id="CR20"><label>20.</label><mixed-citation publication-type="other">Xu, J. &amp; Wang, F. Federated learning for healthcare informatics. <italic toggle="yes">arXiv preprint arXiv:1911.06270</italic> (2019).</mixed-citation></ref><ref id="CR21"><label>21.</label><mixed-citation publication-type="other">Roy, A. &amp; Banerjee, A. Ibm’s merge healthcare acquisitio<italic toggle="yes">n</italic>. <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://www.reuters.com/article/us-merge-healthcare-m-a-ibm/ibm-to-buy-merge-healthcare-in-1-billion-deal-idUSKCN0QB1ML20150806">https://www.reuters.com/article/us-merge-healthcare-m-a-ibm/ibm-to-buy-merge-healthcare-in-1-billion-deal-idUSKCN0QB1ML20150806</ext-link> (2015) (Accessed 10 February 2020).</mixed-citation></ref><ref id="CR22"><label>22.</label><mixed-citation publication-type="other">Nhs scotland’s national safe haven. <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://www.gov.scot/publications/charter-safe-havens-scotland-handling-unconsented-data-national-health-service-patient-records-support-research-statistics/pages/4/">https://www.gov.scot/publications/charter-safe-havens-scotland-handling-unconsented-data-national-health-service-patient-records-support-research-statistics/pages/4/</ext-link> (2015) (Accessed 10 February 2020).</mixed-citation></ref><ref id="CR23"><label>23.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Cuggia</surname><given-names>M</given-names></name><name name-style="western"><surname>Combes</surname><given-names>S</given-names></name></person-group><article-title>The french health data hub and the german medical informatics initiatives: Two national projects to promote data sharing in healthcare</article-title><source>Yearbook Med. Informat.</source><year>2019</year><volume>28</volume><fpage>195</fpage><lpage>202</lpage><pub-id pub-id-type="doi">10.1055/s-0039-1677917</pub-id><pub-id pub-id-type="pmcid">PMC6697511</pub-id><pub-id pub-id-type="pmid">31419832</pub-id></element-citation></ref><ref id="CR24"><label>24.</label><mixed-citation publication-type="other">Health Data Research UK. <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://www.hdruk.ac.uk/">https://www.hdruk.ac.uk/</ext-link> (Health Data Research UK, 2020) (Accessed 10 Feb 2020).</mixed-citation></ref><ref id="CR25"><label>25.</label><mixed-citation publication-type="other">Sporns, O., Tononi, G. &amp; Kötter, R. The human connectome: a structural description of the human brain. <italic toggle="yes">PLoS Comput. Biol</italic>. <bold>1</bold>, e42, 10.1371/journal.pcbi.0010042 (2005).<pub-id pub-id-type="doi" assigning-authority="pmc">10.1371/journal.pcbi.0010042</pub-id><pub-id pub-id-type="pmcid">PMC1239902</pub-id><pub-id pub-id-type="pmid">16201007</pub-id></mixed-citation></ref><ref id="CR26"><label>26.</label><mixed-citation publication-type="other">Sudlow, C. et al. Uk biobank: an open access resource for identifying the causes of a wide range of complex diseases of middle and old age. <italic toggle="yes">PLoS Med</italic>. <bold>12</bold>, e1001779. 10.1371/journal.pmed.1001779 (2015).<pub-id pub-id-type="doi" assigning-authority="pmc">10.1371/journal.pmed.1001779</pub-id><pub-id pub-id-type="pmcid">PMC4380465</pub-id><pub-id pub-id-type="pmid">25826379</pub-id></mixed-citation></ref><ref id="CR27"><label>27.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Clark</surname><given-names>K</given-names></name><etal/></person-group><article-title>The cancer imaging archive (tcia): maintaining and operating a public information repository</article-title><source>J. Digit. Imaging.</source><year>2013</year><volume>26</volume><fpage>1045</fpage><lpage>1057</lpage><pub-id pub-id-type="doi">10.1007/s10278-013-9622-7</pub-id><pub-id pub-id-type="pmid">23884657</pub-id><pub-id pub-id-type="pmcid">PMC3824915</pub-id></element-citation></ref><ref id="CR28"><label>28.</label><mixed-citation publication-type="other">Wang, X. et al. Chestx-ray8: Hospital-scale chest X-ray database and benchmarks on weakly-supervised classification and localization of common thorax diseases. In <italic toggle="yes">Proceedings of the IEEE conference on computer vision and pattern recognition</italic>, 2097–2106 (<italic toggle="yes">IEEE</italic>, 2017).</mixed-citation></ref><ref id="CR29"><label>29.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Yan</surname><given-names>K</given-names></name><name name-style="western"><surname>Wang</surname><given-names>X</given-names></name><name name-style="western"><surname>Lu</surname><given-names>L</given-names></name><name name-style="western"><surname>Summers</surname><given-names>RM</given-names></name></person-group><article-title>Deeplesion: automated mining of large-scale lesion annotations and universal lesion detection with deep learning</article-title><source>J Med. Imaging.</source><year>2018</year><volume>5</volume><fpage>036501</fpage><pub-id pub-id-type="doi">10.1117/1.JMI.5.3.036501</pub-id><pub-id pub-id-type="pmcid">PMC6052252</pub-id><pub-id pub-id-type="pmid">30035154</pub-id></element-citation></ref><ref id="CR30"><label>30.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Tomczak</surname><given-names>K</given-names></name><name name-style="western"><surname>Czerwińska</surname><given-names>P</given-names></name><name name-style="western"><surname>Wiznerowicz</surname><given-names>M</given-names></name></person-group><article-title>The cancer genome atlas (tcga): an immeasurable source of knowledge</article-title><source>Contemp. Oncol.</source><year>2015</year><volume>19</volume><fpage>A68</fpage><pub-id pub-id-type="doi" assigning-authority="pmc">10.5114/wo.2014.47136</pub-id><pub-id pub-id-type="pmcid">PMC4322527</pub-id><pub-id pub-id-type="pmid">25691825</pub-id></element-citation></ref><ref id="CR31"><label>31.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Jack Jr.</surname><given-names>CR</given-names></name><etal/></person-group><article-title>The alzheimer’s disease neuroimaging initiative (adni): Mri methods</article-title><source>J. Magn. Reson. Imaging</source><year>2008</year><volume>27</volume><fpage>685</fpage><lpage>691</lpage><pub-id pub-id-type="doi">10.1002/jmri.21049</pub-id><pub-id pub-id-type="pmid">18302232</pub-id><pub-id pub-id-type="pmcid">PMC2544629</pub-id></element-citation></ref><ref id="CR32"><label>32.</label><mixed-citation publication-type="other"><italic toggle="yes">Grand Challenge-a Platform for End-to-end Development of Machine Learning Solutions in Biomedical Imaging</italic>. <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://grand-challenge.org/">https://grand-challenge.org/</ext-link> (2020) (Accessed 24 July 2020).</mixed-citation></ref><ref id="CR33"><label>33.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Litjens</surname><given-names>G</given-names></name><etal/></person-group><article-title>1399 h&amp;e-stained sentinel lymph node sections of breast cancer patients: the camelyon dataset</article-title><source>GigaScience</source><year>2018</year><volume>7</volume><fpage>giy065</fpage><pub-id pub-id-type="doi">10.1093/gigascience/giy065</pub-id><pub-id pub-id-type="pmcid">PMC6007545</pub-id><pub-id pub-id-type="pmid">29860392</pub-id></element-citation></ref><ref id="CR34"><label>34.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Menze</surname><given-names>BH</given-names></name><etal/></person-group><article-title>The multimodal brain tumor image segmentation benchmark (brats)</article-title><source>IEEE Trans. Med. Imaging</source><year>2014</year><volume>34</volume><fpage>1993</fpage><lpage>2024</lpage><pub-id pub-id-type="doi">10.1109/TMI.2014.2377694</pub-id><pub-id pub-id-type="pmid">25494501</pub-id><pub-id pub-id-type="pmcid">PMC4833122</pub-id></element-citation></ref><ref id="CR35"><label>35.</label><mixed-citation publication-type="other">Bakas, S. et al. Identifying the best machine learning algorithms for brain tumor segmentation, progression assessment, and overall survival prediction in the brats challenge. <italic toggle="yes">arXiv preprint arXiv:1811.02629</italic> (2018).</mixed-citation></ref><ref id="CR36"><label>36.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Bakas</surname><given-names>S</given-names></name><etal/></person-group><article-title>Advancing the cancer genome atlas glioma MRI collections with expert segmentation labels and radiomic features</article-title><source>Sci. Data</source><year>2017</year><volume>4</volume><fpage>170117</fpage><pub-id pub-id-type="doi">10.1038/sdata.2017.117</pub-id><pub-id pub-id-type="pmid">28872634</pub-id><pub-id pub-id-type="pmcid">PMC5685212</pub-id></element-citation></ref><ref id="CR37"><label>37.</label><mixed-citation publication-type="other">Simpson, A. L. et al. A large annotated medical image dataset for the development and evaluation of segmentation algorithms. <italic toggle="yes">arXiv preprint arXiv:1902.09063</italic> (2019).</mixed-citation></ref><ref id="CR38"><label>38.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Yeh</surname><given-names>F-C</given-names></name><etal/></person-group><article-title>Quantifying differences and similarities in whole-brain white matter architecture using local connectome fingerprints</article-title><source>PLoS Comput. Biol.</source><year>2016</year><volume>12</volume><fpage>e1005203</fpage><pub-id pub-id-type="doi">10.1371/journal.pcbi.1005203</pub-id><pub-id pub-id-type="pmid">27846212</pub-id><pub-id pub-id-type="pmcid">PMC5112901</pub-id></element-citation></ref><ref id="CR39"><label>39.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Chang</surname><given-names>K</given-names></name><etal/></person-group><article-title>Distributed deep learning networks among institutions for medical imaging</article-title><source>J. Am. Med. Inform. Assoc.</source><year>2018</year><volume>25</volume><fpage>945</fpage><lpage>954</lpage><pub-id pub-id-type="doi">10.1093/jamia/ocy017</pub-id><pub-id pub-id-type="pmid">29617797</pub-id><pub-id pub-id-type="pmcid">PMC6077811</pub-id></element-citation></ref><ref id="CR40"><label>40.</label><mixed-citation publication-type="other">Shokri, R., Stronati, M., Song, C. &amp; Shmatikov, V. Membership inference attacks against machine learning models. In <italic toggle="yes">2017 IEEE Symposium on Security and Privacy (SP)</italic>, 3-18 (IEEE, 2017).</mixed-citation></ref><ref id="CR41"><label>41.</label><mixed-citation publication-type="other">Sablayrolles, A., Douze, M., Ollivier, Y., Schmid, C. &amp; Jégou, H. White-box vs black-box: Bayes optimal strategies for membership inference. In Chaudhuri, K. &amp; Salakhutdinov, R. (eds) <italic toggle="yes">Proceedings of the 36th International Conference on Machine Learning, {ICML}</italic><bold>97</bold>, 5558–5567. <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="http://proceedings.mlr.press/v97/sablayrolles19a.html">http://proceedings.mlr.press/v97/sablayrolles19a.html</ext-link> (PMLR, 2019).</mixed-citation></ref><ref id="CR42"><label>42.</label><mixed-citation publication-type="other">Zhang, C., Bengio, S., Hardt, M., Recht, B. &amp; Vinyals, O. Understanding deep learning requires rethinking generalization. In <italic toggle="yes">5th</italic><italic toggle="yes">International Conference on Learning Representations, {ICLR}.</italic><ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://openreview.net/forum?id=Sy8gdB9xx">https://openreview.net/forum?id=Sy8gdB9xx</ext-link>, (OpenReview.net, 2017).</mixed-citation></ref><ref id="CR43"><label>43.</label><mixed-citation publication-type="other">Carlini, N., Liu, C., Erlingsson, Ú., Kos, J. &amp; Song, D. The secret sharer: evaluating and testing unintended memorization in neural networks. In Heninger, N. &amp; Traynor, P. (eds) <italic toggle="yes">28th</italic> {<italic toggle="yes">U</italic><italic toggle="yes">S</italic><italic toggle="yes">E</italic><italic toggle="yes">N</italic><italic toggle="yes">I</italic><italic toggle="yes">X</italic>} <italic toggle="yes">Security Symposium</italic> ({<italic toggle="yes">U</italic><italic toggle="yes">S</italic><italic toggle="yes">E</italic><italic toggle="yes">N</italic><italic toggle="yes">I</italic><italic toggle="yes">X</italic>} <italic toggle="yes">Security 19</italic>, 267–284. <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://www.usenix.org/conference/usenixsecurity19/presentation/carlini">https://www.usenix.org/conference/usenixsecurity19/presentation/carlini</ext-link> ({USENIX} Association, Santa Clara, CA, USA, 2019).</mixed-citation></ref><ref id="CR44"><label>44.</label><mixed-citation publication-type="other">Abadi, M. et al. Deep learning with differential privacy. In <italic toggle="yes">Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security</italic>, 308–318 (ACM, 2016).</mixed-citation></ref><ref id="CR45"><label>45.</label><mixed-citation publication-type="other">Shokri, R. &amp; Shmatikov, V. Privacy-preserving deep learning. In <italic toggle="yes">Proceedings of the 22nd ACM SIGSAC conference on computer and communications security</italic>, 1310–1321 (ACM, 2015).</mixed-citation></ref><ref id="CR46"><label>46.</label><element-citation publication-type="journal"><person-group person-group-type="author"><name name-style="western"><surname>Langlotz</surname><given-names>CP</given-names></name><etal/></person-group><article-title>A roadmap for foundational research on artificial intelligence in medical imaging: from the 2018 nih/rsna/acr/the academy workshop</article-title><source>Radiology</source><year>2019</year><volume>291</volume><fpage>781</fpage><lpage>791</lpage><pub-id pub-id-type="doi">10.1148/radiol.2019190613</pub-id><pub-id pub-id-type="pmid">30990384</pub-id><pub-id pub-id-type="pmcid">PMC6542624</pub-id></element-citation></ref><ref id="CR47"><label>47.</label><mixed-citation publication-type="other">Kim, Y., Sun, J., Yu, H. &amp; Jiang, X. Federated Tensor Factorization for Computational Phenotyping. In <italic toggle="yes">Proceedings of the 23rd {ACM} {SIGKDD} International Conference on Knowledge Discoveryand Data Mining</italic>. 887–895. 10.1145/3097983.3098118 (ACM, Halifax, NS, Canada, 2017).<pub-id pub-id-type="doi" assigning-authority="pmc">10.1145/3097983.3098118</pub-id><pub-id pub-id-type="pmcid">PMC5652331</pub-id><pub-id pub-id-type="pmid">29071165</pub-id></mixed-citation></ref><ref id="CR48"><label>48.</label><mixed-citation publication-type="other">He, C., Annavaram, M. &amp; Avestimehr, S. Fednas: Federated deep learning via neural architecture search. <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://sites.google.com/view/cvpr20-nas/">https://sites.google.com/view/cvpr20-nas/</ext-link> (2020).</mixed-citation></ref><ref id="CR49"><label>49.</label><mixed-citation publication-type="other">Trustworthy federated data analytics (tfda). <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://tfda.hmsp.center/">https://tfda.hmsp.center/</ext-link> (2020) (Accessed 28 May 2020).</mixed-citation></ref><ref id="CR50"><label>50.</label><mixed-citation publication-type="other">Joint Imaging Platform (Jip). <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://jip.dktk.dkfz.de/jiphomepage/">https://jip.dktk.dkfz.de/jiphomepage/</ext-link> (2020) (Accessed 28 May 2020).</mixed-citation></ref><ref id="CR51"><label>51.</label><mixed-citation publication-type="other">Medical institutions collaborate to improve mammogram assessment ai. <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://blogs.nvidia.com/blog/2020/04/15/federated-learning-mammogram-assessment/">https://blogs.nvidia.com/blog/2020/04/15/federated-learning-mammogram-assessment/</ext-link> (2020) (Accessed 28 May 2020).</mixed-citation></ref><ref id="CR52"><label>52.</label><mixed-citation publication-type="other">Healthchain consortium. <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://www.substra.ai/en/healthchain-project">https://www.substra.ai/en/healthchain-project</ext-link> (2020) (Accessed 28 May 2020).</mixed-citation></ref><ref id="CR53"><label>53.</label><mixed-citation publication-type="other">The federated tumor segmentation (fets) initiative. <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://www.fets.ai">https://www.fets.ai</ext-link> (2020) (Accessed 28 May 2020).</mixed-citation></ref><ref id="CR54"><label>54.</label><mixed-citation publication-type="other">Machine learning ledger orchestration for drug discovery. <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://cordis.europa.eu/project/id/831472">https://cordis.europa.eu/project/id/831472</ext-link> (2020). Accessed 28 May 2020.</mixed-citation></ref><ref id="CR55"><label>55.</label><mixed-citation publication-type="other">Konečny`, J., McMahan, H. B., Ramage, D. &amp; Richtárik, P. Federated optimization: Distributed machine learning for on-device intelligence. <italic toggle="yes">arXiv preprint arXiv:1610.02527</italic> (2016).</mixed-citation></ref><ref id="CR56"><label>56.</label><mixed-citation publication-type="other">Lalitha, A., Kilinc, O. C., Javidi, T. &amp; Koushanfar, F. Peer-to-peer federated learning on graphs. <italic toggle="yes">arXiv preprint arXiv:1901.11173</italic> (2019).</mixed-citation></ref><ref id="CR57"><label>57.</label><mixed-citation publication-type="other">Li, T., Sahu, A. K., Zaheer, M., Sanjabi, M., Talwalkar, A. &amp; Smith, V. Federated optimization in heterogeneous networks. <italic toggle="yes">arXiv preprint arXiv:1812.06127</italic> (2018).</mixed-citation></ref><ref id="CR58"><label>58.</label><mixed-citation publication-type="other">Zhao, Y. et al. Federated learning with non-iid data. <italic toggle="yes">arxivabs/1806.00582</italic> (2018).</mixed-citation></ref><ref id="CR59"><label>59.</label><mixed-citation publication-type="other">Li, X., Huang, K., Yang, W., Wang, S. &amp; Zhang, Z. On the convergence of fedavg on non-IID data. <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://openreview.net/forum?id=HJxNAnVtDS">https://openreview.net/forum?id=HJxNAnVtDS</ext-link> (2020).</mixed-citation></ref><ref id="CR60"><label>60.</label><mixed-citation publication-type="other">Wu, B. et al. P3sgd: patient privacy preserving SGD for regularizing deep CNNs in pathological image classification. In <italic toggle="yes">Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</italic> (pp. 2099–2108) (2019).</mixed-citation></ref><ref id="CR61"><label>61.</label><mixed-citation publication-type="other">Zhu, L., Liu, Z. &amp; Han, S. Deep leakage from gradients. In Wallach, H. M. et al. (eds) <italic toggle="yes">Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems</italic>, 14747–14756. <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="http://papers.nips.cc/paper/9617-deep-leakage-from-gradients">http://papers.nips.cc/paper/9617-deep-leakage-from-gradients</ext-link> (2019).</mixed-citation></ref><ref id="CR62"><label>62.</label><mixed-citation publication-type="other">Wang, Z. et al. Beyond inferring class representatives: user-level privacy leakage from federated learning. In <italic toggle="yes">2019 {IEEE} Conferenceon Computer Communications, {INFOCOM}</italic> 2512–2520. 10.1109/INFOCOM.2019.8737416 (IEEE, Paris, France, 2019).</mixed-citation></ref><ref id="CR63"><label>63.</label><mixed-citation publication-type="other">Hitaj, B., Ateniese, G. &amp; Perez-Cruz, F. Deep models under the gan: information leakage from collaborative deep learning. In <italic toggle="yes">Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security</italic>, CCS’17, 603–618 (Association for Computing Machinery, New York, NY, USA, 2017).</mixed-citation></ref><ref id="CR64"><label>64.</label><mixed-citation publication-type="other">Ghorbani, A. &amp; Zou, J. Data shapley: Equitable valuation of data for machine learning. In <italic toggle="yes">International Conference on Machine Learning</italic> (pp. 2242-2251) (2019).</mixed-citation></ref></ref-list></back>
</article>
