AI Paper Atlas

Research map / Federated learning and privacy / Privacy attacks and secure learning

Private federated aggregation

Secure aggregation and encrypted gradients for efficient, fair federated learning.

50 accepted papers at ICML, NeurIPS, ICLR, CVPR and AAAI (2021–2026) · an approach in Privacy attacks and secure learning, keyword cluster “preserving · vfl · encryption”

State History Tried Checklist Preprints Who Export

Where it stands

Not enough benchmark data Fewer than four papers report the same benchmark, so there is no record to follow.

25 papers in 2023–24 and 19 in 2025–26 (at ICML, NeurIPS, ICLR, CVPR and AAAI); its share of the topic shrank, from 19.1% to 13.4%.

How this is decided

A benchmark is tracked when at least four papers of this approach report their own method on the same dataset and metric in at least two different years. Its record is the best number reported up to 2024 compared with the best reported in 2025–26: still improving means at least 1% better, flat means at most 0.2% better with at least two papers from 2025–26 trying. Numbers on a different scale from the rest (a fraction among percentages) and far outliers are left out. Results come from different papers with different setups, so they are signals, not head-to-head comparisons. The share of papers is counted at ICML, NeurIPS, ICLR, CVPR and AAAI.

How it got here

2016: 0162017: 0172018: 0182019: 0192020: 0202021: 1212022: 5222023: 12232024: 13242025: 16252026: 326

Most cited paper of each year

Earliest papers here

What has been tried

44 papers here report 431 measured changes (a component added, removed or swapped, compared with a baseline): helped 58%, no clear effect 10%, hurt 27%, mixed 4%. Papers mostly publish changes that helped, so "helped" is over-represented.

Ablations in recent papers

What was changedMeasured onResultEffectPaper
Increase fairness budget βAcross datasets · disparity9% ∼ 67%HelpedNo Prejudice! Fair Federated Graph Neural Networks for Personalized Recommendation (AAAI 2024 · 32 citations)
add UCE instead of using Gradient Ascent on CEFMNIST after unlearning · R-Acc.163 -> .806HelpedFederated Unlearning with Gradient Descent and Conflict Mitigation (AAAI 2025 · 23 citations)
Use CLI to select sensitive layers instead of selecting layers randomlyCifar10 client unlearning · remaining-data accuracyHelpedUnlearning through Knowledge Overwriting: Reversible Federated Unlearning via Selective Sparse Adapter (CVPR 2025 · 22 citations)
Increase FedBary support size from S=100 to S=500Client evaluation, N=5, N=10, N=50 and N=100 · elapsed time1m / 2m; 2m / 4m; 14m / 30m; 21m / 1hHurtData Valuation and Detections in Federated Learning (CVPR 2024 · 15 citations)
Negate the convolution projection layerCaltech-101 · Avg. GapHelpedNoT: Federated Unlearning via Weight Negation (CVPR 2025 · 12 citations)
Use OR rather than the automatically selected AND connectorCUB · model accuracy89.49% -> 87.96%HurtLR-XFL: Logical Reasoning-Based Explainable Federated Learning (AAAI 2024 · 12 citations)
Add the orthogonal constraint to watermark trainingCIFAR-10 · ACC95.59 -> 95.68HelpedMFL-Owner: Ownership Protection for Multi-modal Federated Learning via Orthogonal Transform Watermark (AAAI 2025 · 10 citations)
add local graph transformation with information bottleneckCora, 2.6% · MIA AUC (%)76.4 -> 53.2HelpedFederated Graph Condensation with Information Bottleneck Principles (AAAI 2025 · 7 citations)
add semantic loss to the generatorCIFAR10 · classification accuracy69.19 -> 70.56HelpedPPIDSG: A Privacy-Preserving Image Distribution Sharing Scheme with GAN in Federated Learning (AAAI 2024 · 6 citations)
add tokenizationUlsan Pedal · HR@102.182% -> 7.329%HelpedGeneral Commerce Intelligence: Glocally Federated NLP-Based Engine for Privacy-Preserving and Sustainable Personalized Services of Multi-Merchants (AAAI 2024 · 5 citations)
Adjust training of the server update g0Model convergence experiments · accuracyHelpedEBS-CFL: Efficient and Byzantine-robust Secure Clustered Federated Learning (AAAI 2025 · 3 citations)
Remove the denominator from the Ferrari feature-sensitivity loss (Non-Lipschitz variant)Backdoor unlearning · accuracy on retain dataset Dr (%)Dr accuracy drops below 10%HurtFerrari: Federated Feature Unlearning via Optimizing Feature Sensitivity (NeurIPS 2024 · 3 citations)

What reviewers will expect

Datasets and baselines named in the 16 papers of this approach from 2025–2026 that have a full-text summary. Leaving out the common ones is a frequent review question.

Datasets

  • CIFAR-10 · 9 of 16 papers
  • CIFAR-100 · 6 of 16 papers
  • MNIST · 5 of 16 papers
  • FashionMNIST · 3 of 16 papers
  • Reddit · 2 of 16 papers

Baselines

  • FedEraser · 3 of 16 papers
  • FedAvg · 2 of 16 papers
  • Retraining · 2 of 16 papers
  • MoDe · 2 of 16 papers

Recent preprints

Loading recent arXiv preprints…

    Who publishes on it

    Institutions on the most papers of this approach since 2023 (of 44 papers; from OpenAlex and the papers' affiliations).

    Use it

    Download BibTeX of 28 key papersOpen the topic in the interactive map

    Get alerts. Describe your idea in scime atlas and save it (free scime account): you get a weekly email when new preprints land close to it.

    Same keyword cluster

    Elsewhere in the topic

    Benchmark numbers, ablations and baseline numbers are extracted by AI from each paper's full text and can be wrong; the paper is the authority. Data: results index of 2026-11-02, citation counts from OpenAlex (2026-10-09).

    Get the next scime Dispatch and a monthly field update

    Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy