Papers › FedLAP-DP: Federated Learning by Sharing Differentially Private Loss Approximations

FedLAP-DP: Federated Learning by Sharing Differentially Private Loss Approximations

2 Feb 2023arXiv:2302.01068archive 2025-07-28

Hui-Po Wang, Dingfan Chen, Raouf Kerkouche, Mario Fritz

Conventional gradient-sharing approaches for federated learning (FL), such as FedAvg, rely on aggregation of local models and often face performance degradation under differential privacy (DP) mechanisms or data heterogeneity, which can be attributed to the inconsistency between the local and global objectives. To address this issue, we propose FedLAP-DP, a novel privacy-preserving approach for FL. Our formulation involves clients synthesizing a small set of samples that approximate local loss landscapes by simulating the gradients of real images within a local region. Acting as loss surrogates, these synthetic samples are aggregated on the server side to uncover the global loss landscape and enable global optimization. Building upon these insights, we offer a new perspective to enforce record-level differential privacy in FL. A formal privacy analysis demonstrates that FedLAP-DP incurs the same privacy costs as typical gradient-sharing schemes while achieving an improved trade-off between privacy and utility. Extensive experiments validate the superiority of our approach across various datasets with highly skewed distributions in both DP and non-DP settings. Beyond the promising performance, our approach presents a faster convergence speed compared to typical gradient-sharing methods and opens up the possibility of trading communication costs for better performance by sending a larger set of synthetic images. The source is available at \url{https://github.com/hui-po-wang/FedLAP-DP}.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2302.01068")

Code

Syntology Ran 0 of 21 code samples harvested from 1 repository linked to this paper; 21 have no recorded run.

By repository: named in the paper: 21 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

hui-po-wang/fedlap-dp officialmentioned in papermentioned on GitHubpytorchMIT report
a514514772/fedlap-dp mentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

21 samples harvested; 0 ran; 0 honoured the contract we drafted; 21 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

21unverified

Licence: 0 of the 21 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from a514514772/fedlap-dp. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

DiffAugment a514514772/fedlap-dp/utils/augmentation.py named in the paper unverified MIT (permissive) · 6e636dbbdcaa0f16 · report
VGG11 a514514772/fedlap-dp/utils/networks.py named in the paper unverified MIT (permissive) · 8e1b179ef1f0fe03 · report
VGG11BN a514514772/fedlap-dp/utils/networks.py named in the paper unverified MIT (permissive) · cfab0fafbf988aa4 · report
VGG13 a514514772/fedlap-dp/utils/networks.py named in the paper unverified MIT (permissive) · 07962bf28fe347a0 · report
accumulate_grads a514514772/fedlap-dp/utils/analysis.py named in the paper unverified MIT (permissive) · 5a7f510dabadb84b · report
augment a514514772/fedlap-dp/utils/augmentation.py named in the paper unverified MIT (permissive) · 4ac684d789a25255 · report
compute_epsilon a514514772/fedlap-dp/RDP_record_level.py named in the paper unverified MIT (permissive) · dc4735db69f56c6c · report
compute_epsilon a514514772/fedlap-dp/rdp_accountant.py named in the paper unverified MIT (permissive) · 9e86773fdea3d6c0 · report
compute_model_diff a514514772/fedlap-dp/utils/utils.py named in the paper unverified MIT (permissive) · 06b378b3395f19b6 · report
compute_model_distance a514514772/fedlap-dp/utils/fl_utils.py named in the paper unverified MIT (permissive) · 464e8a98f11cf468 · report
compute_rdp a514514772/fedlap-dp/RDP_record_level.py named in the paper unverified MIT (permissive) · 9bc608b2340472d0 · report
create_server_opt a514514772/fedlap-dp/main_baseline.py named in the paper unverified MIT (permissive) · 3dd0838c983f6de8 · report
distance_wb a514514772/fedlap-dp/utils/ops.py named in the paper unverified MIT (permissive) · 05e4679ed899a619 · report
epoch a514514772/fedlap-dp/utils/ops.py named in the paper unverified MIT (permissive) · 68185a4f54101d97 · report
get_dataset a514514772/fedlap-dp/utils/misc.py named in the paper unverified MIT (permissive) · 5211c024ed09fb69 · report
get_global_opt a514514772/fedlap-dp/utils/analysis.py named in the paper unverified MIT (permissive) · 7840c088ad8dbbbb · report
get_network a514514772/fedlap-dp/utils/misc.py named in the paper unverified MIT (permissive) · 9559a2ae8eb12814 · report
get_privacy_spent a514514772/fedlap-dp/RDP_record_level.py named in the paper unverified MIT (permissive) · 2a4aad919ee70e6f · report
match_loss a514514772/fedlap-dp/utils/ops.py named in the paper unverified MIT (permissive) · b6b7ca954109fa0e · report
prepare_data a514514772/fedlap-dp/utils/misc.py named in the paper unverified MIT (permissive) · 247505620d52f110 · report
rand_scale a514514772/fedlap-dp/utils/augmentation.py named in the paper unverified MIT (permissive) · a7a3291ababdea1f · report

Tasks

Federated LearningPrivacy Preservingglobal-optimization

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

SPEED

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections