Skip to main content
. 2023 Mar 10;25(3):485. doi: 10.3390/e25030485
Algorithm 1 PLDP-FL
Require: N is the number of local clients, γ is the local client selection factor, 0<γ1, E is the number of local epochs, B is the local mini-batch size, η is the learning rate, L is the loss function.
Ensure: The trained model W.
  •  1:

    ServerUpdate:

  •  2:

    Initialize the weight parameter w0 and send it to all clients;

  •  3:

    for each round t=1,2,,T do

  •  4:

       The server randomly selects γ·N local clients Pt;

  •  5:

       for each client Pi[N] in parallel do

  •  6:

         wi,t ClientUpdate (Pi,w¯t1) and sends the result to the server;

  •  7:

       end for

  •  8:

       w¯t1|Pt|iwi,t;

  •  9:

       return w¯t.

  •  10:

    end for

  •  11:

    ClientUpdate(Pi,w¯t1):

  •  12:

    tt+1;

  •  13:

    Receive the latest updates from the server: wi,tw¯t1;

  •  14:

    for each local epoch j=1,2,,E do

  •  15:

       for each batch bB do

  •  16:

          wi,twi,tη·L(wi,t;b);

  •  17:

       end for

  •  18:

    end for

  •  19:

    w˜i,tPersonalized(wi,t).