IP Library Granted Patent US 11,836,643
Granted Patent B2
US 11,836,643 · App. 16/296,380 · Granted Dec 5, 2023

System for secure federated learning

Inventors: Kumar Sharad (Heidelberg, DE); Ghassan Karame (Heidelberg, DE); Giorgia Azzurra Marson (Heidelberg, DE)
Assignee: NEC CORPORATION
G06N5/043G06F21/606G06N3/098G06N20/20
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,836,643
App. No.
16/296,380
Granted
Dec 5, 2023
Kind
B2
Abstract

A method for performing federated learning includes initializing, by a server, a global model G 0 . The server shares G 0 with a plurality of participants (N) using a secure communications channel. The server selects n out of N participants, according to filtering criteria, to contribute training for a round r. The server partitions the selected participants n into s groups and informs each participant about the other participants belonging to the same group. The server obtains aggregated group updates AU 1 , . . . , AU g from each group and compares the aggregated group updates and identifies suspicious aggregated group updates. The server combines the aggregated group updates by excluding the updates identified as suspicious, to obtain an aggregated update U final . The server derives a new global model G r from the previous model G r-1 and the aggregated update U final and shares G r with the plurality of participants.

Claims (44)

1. A method for performing federated learning, comprising:

initializing, by a server, a global model G 0 ;

sharing, by the server, G 0 with a plurality of participants (N) using a secure communications channel;

selecting, by the server, n out of N participants, according to filtering criteria, to contribute training for a round r;

partitioning, by the server, the selected participants n into s groups;

informing, by the server, each participant about the other participants belonging to the same group;

obtaining, by the server, aggregated group updates AU 1 , . . . , AU g from each group for the round r, wherein, each participant locally uses local training data to generate a local update U i needed to obtain a local model L i from the previous global model G r-1 and wherein each participant belonging to the same group k=1, . . . , g, executes a secure aggregation protocol to combine all of their updates U 1 k , . . . , U s k , to obtain the aggregated group update AU g , wherein the local update U i includes the size d i of the local training data;

comparing, by the server, the aggregated group updates and identifying suspicious aggregated group updates probabilistically using machine learning for the round r;

combining, by the server, the aggregated group updates by assigning a weight to each group update AU 1 , . . . , AU g , averaging the weighted group updates to obtain an aggregated update U final and adding the aggregated update to a previous parameter vector, wherein the weight assigned to suspicious aggregated group updates is lower than the weight assigned to group updates that are not suspicious;

deriving, by the server, a new global model G r from the previous model G r-1 and the aggregated update U final ; and

sharing, by the server, G r with the plurality of participants.

2. The method of claim 1 , further comprising:

locally training, by each participant, a model L i using local training data;

generating, by each participant, updates U i needed to obtain a local model L i from the previous global model G r-1 ; and

running, by all participants belonging to the same group k∈{1, . . . , g}, a secure aggregation protocol to combine all of their updates U 1 k , . . . , U s k , to obtain an aggregated group update AU k .

3. The method according to claim 1 , wherein the plurality of participants is greater than 10,000.

4. The method according to claim 1 , wherein the secure communications channel is a pairwise secure channel.

5. The method according to claim 1 , wherein all communication between the server and a participant is authenticated and confidential.

6. The method according to claim 1 , wherein the s groups contain differing numbers of participants.

7. The method according to claim 1 , wherein identifying suspicious aggregated group updates is performed deterministically.

8. The method according to claim 1 , further comprising aggregating the received updates by averaging all contributions.

9. A server comprising one or more processors which, alone or in combination, are configured to provide for performance of the following steps:

initializing a global model G 0 ;

sharing G 0 with a plurality of participants (N) using a secure communications channel;

selecting n out of N participants, according to filtering criteria, to contribute training for a round r;

partitioning the selected participants n into s groups;

informing each participant about the other participants belonging to the same group;

obtaining aggregated group updates AU 1 , . . . , AU g from each group for the round r, wherein, each participant locally uses local training data to generate a local update U i needed to obtain a local model L i from the previous global model G r-1 and wherein each participant belonging to the same group k=1, . . . , g, executes a secure aggregation protocol to combine all of their updates U 1 k , . . . , U s k , to obtain the aggregated group update AU g , wherein the local update U i includes the size d i of the local training data;

comparing the aggregated group updates and identifying suspicious aggregated group updates probabilistically using machine learning for the round r;

combining the aggregated group updates by assigning a weight to each group update AU 1 , . . . , AU g , averaging the weighted group updates to obtain an aggregated update U final and adding the aggregated update to a previous parameter vector, wherein the weight assigned to suspicious aggregated group updates is lower than the weight assigned to group updates that are not suspicious;

deriving a new global model G r from the previous model G r-1 and the aggregated update U final ; and

sharing G r with the plurality of participants.

10. A non-transitory computer readable medium storing instructions that when executed by a processor cause the following steps to be performed:

initializing a global model G 0 ;

sharing G 0 with a plurality of participants (N) using a secure communications channel;

selecting n out of N participants, according to filtering criteria, to contribute training for a round r;

partitioning the selected participants n into s groups;

informing each participant about the other participants belonging to the same group;

obtaining aggregated group updates AU 1 , . . . , AU g from each group for the round r, wherein, each participant locally uses local training data to generate a local update U i needed to obtain a local model L i from the previous global model G r-1 and wherein each participant belonging to the same group k=1, . . . , g, executes a secure aggregation protocol to combine all of their updates U 1 k , . . . , U s k , to obtain the aggregated group update AU g , wherein the local update U i includes the size d i of the local training data;

comparing the aggregated group updates and identifying suspicious aggregated group updates probabilistically using machine learning for the round r;

combining the aggregated group updates by assigning a weight to each group update AU 1 , . . . , AU g , averaging the weighted group updates to obtain an aggregated update U final and adding the aggregated update to a previous parameter vector, wherein the weight assigned to suspicious aggregated group updates is lower than the weight assigned to group updates that are not suspicious;

deriving a new global model G r from the previous model G r-1 and the aggregated update U final ; and

sharing G r with the plurality of participants.

11. The computer readable medium according to claim 10 , wherein the secure communications channel is a pairwise secure channel.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 27, 2023
From: NEC LABORATORIES EUROPE GMBH
To: NEC CORPORATION
Reel/Frame 065366/0289 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 15, 2019
From: SHARAD, KUMAR; KARAME, GHASSAN; MARSON, GIORGIA AZZURRA
To: NEC LABORATORIES EUROPE GMBH
Reel/Frame 048881/0273 →
Continuity (1)
Related Publication 20200285980A1 · Sep 10, 2020
Cited By (2)
US 12,699,882 US 12,705,499