Pith. sign in

REVIEW 21 cited by

Federated Learning Based on Dynamic Regularization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2111.04263 v2 pith:PXC3BEBI submitted 2021-11-08 cs.LG cs.DC

classification cs.LGcs.DC
keywords devicedevicesempiricalfederatedlearningdatadynamicglobal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose a novel federated learning method for distributively training neural network models, where the server orchestrates cooperation between a subset of randomly chosen devices in each round. We view Federated Learning problem primarily from a communication perspective and allow more device level computations to save transmission costs. We point out a fundamental dilemma, in that the minima of the local-device level empirical loss are inconsistent with those of the global empirical loss. Different from recent prior works, that either attempt inexact minimization or utilize devices for parallelizing gradient computation, we propose a dynamic regularizer for each device at each round, so that in the limit the global and device solutions are aligned. We demonstrate both through empirical results on real and synthetic data as well as analytical results that our scheme leads to efficient training, in both convex and non-convex settings, while being fully agnostic to device heterogeneity and robust to large number of devices, partial participation and unbalanced data.

Discussion (0). Sign in to comment.

Forward citations

Cited by 21 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. FedACT: Federated Adaptive Coordinate Trust Modulation for Robust Transformer Training under Data Heterogeneity

    cs.LG 2026-07 conditional novelty 6.5 of 10

    Global-aware coordinate trust modulation after corrected AdamW updates improves federated Transformer and LLM training under data heterogeneity over strong adaptive baselines.

  2. AS-FedBridge: Pseudo-Spike Bridge Distillation for Heterogeneous ANN-SNN Federated Learning

    cs.LG 2026-08 conditional novelty 6.0 of 10

    AS-FedBridge trains a shared pseudo-spike bridge so ANN and SNN clients in federated learning can align representations and improve collaborative accuracy.

  3. TriShield: Zero-Utility-Loss Defense Against Privacy Backdoors in Federated Language Model Fine-Tuning via Orthogonal Gradient Projection and Optimizer State Entanglement

    cs.LG 2026-07 reject novelty 6.0 of 10

    TriShield combines artifact detection, Adam momentum pre-entanglement, and SVD task-subspace projection to drive NeuroImprint reconstruction to 0% with claimed near-zero utility loss.

  4. FM$^2$: Unified Federated Foundation Models for Heterogeneous Multimodal Medical Imaging

    cs.CV 2026-07 reject novelty 6.0 of 10

    FM² uses dual mixture-of-experts (per-class local, per-modality shared) with a proximal alignment regularizer to train federated medical imaging models across overlapped and disjoint modality settings, reporting consi...

  5. Degree of Staleness-Aware Data Updating in Federated Learning

    cs.LG 2025-08 unverdicted novelty 6.0 of 10

    DUFL is a payment-based incentive mechanism that jointly balances data staleness and data volume via a Stackelberg game and derives a closed-form optimal client data update strategy.

  6. FedWCM: Unleashing the Potential of Momentum-based Federated Learning in Long-Tailed Scenarios

    cs.LG 2025-07 reject novelty 6.0 of 10

    FedWCM uses per-client data-distribution scores to adapt momentum and aggregation weights in federated learning, showing empirical gains over FedAvg and FedCM on long-tailed non-IID datasets, but its convergence proof...

  7. AFBS:Buffer Gradient Selection in Semi-asynchronous Federated Learning

    cs.LG 2025-06 conditional novelty 6.0 of 10

    AFBS scores buffered gradients by staleness and dataset size, discards low-value ones, and clusters clients through random-projection-encrypted label distributions before aggregation in semi-asynchronous federated learning.

  8. Mitigating Non-IID Drift in Zeroth-Order Federated LLM Fine-Tuning with Transferable Sparsity

    cs.LG 2025-06 reject novelty 6.0 of 10

    Sparse zeroth-order federated fine-tuning with shared seeds and GradIP-based early stopping matches or beats full-parameter ZO while using far less communication.

  9. Label-shift robust federated feature screening for high-dimensional classification

    stat.ML 2025-05 conditional novelty 6.0 of 10

    A new label-shift robust utility, LR-FFS, is proposed for federated feature screening, with a unifying framework, distributed estimation, and FDR control.

  10. HERO: A Heterogeneity-Aware Benchmark Library for Federated Continual Learning

    cs.LG 2026-06 conditional novelty 5.5 of 10

    HERO shows that FCL method rankings shift when client data skew and task-order mismatch are controlled separately, and that average accuracy can hide weak bottom-client performance.

  11. One Round Is All You Need: Analytic Federated Learning for Task-Heterogeneous Multi-Label Medical Image Classification

    cs.LG 2026-07 conditional novelty 5.0 of 10

    Per-class closed-form ridge aggregation reproduces the centralized balanced-label classifier in one round and outperforms gradient-based federated baselines on ChestXray14 under missing-class heterogeneity.

  12. Adaptive Federated Learning to Optimize Integrated Flows in Cyber-Physical Data Centers

    eess.SY 2025-11 conditional novelty 5.0 of 10

    An adaptive federated learning-to-optimization method with a rejection-capable acceptance rule and verifiable double aggregation achieves near-centralized cost for data center energy management without exposing local data.

  13. Dissecting Federated-Graph Aggregation under Domain Shift: Importance-Aware Aggregation via Empirical Analysis

    cs.LG 2025-09 conditional novelty 5.0 of 10

    A top-rho gradient masking plus influence-weighted averaging method (FedIA) improves federated graph learning accuracy and stability under domain shift.

  14. Multi-Hop Privacy Propagation for Differentially Private Federated Learning in Social Networks

    cs.LG 2025-08 unverdicted novelty 5.0 of 10

    A game-theoretic mechanism for differentially private federated learning that accounts for multi-hop privacy leakage over social networks, claimed to achieve near-optimal social welfare with lower server cost.

  15. Distilling A Universal Expert from Clustered Federated Learning

    cs.LG 2025-06 conditional novelty 5.0 of 10

    A federated learning method that distills a universal model from cluster-specific models using data-free knowledge distillation and adaptive label weighting.

  16. Towards Graph-Based Privacy-Preserving Federated Learning: ModelNet -- A ResNet-based Model Classification Dataset

    cs.LG 2025-05 conditional novelty 5.0 of 10

    ModelNet creates three CIFAR-100-based benchmarks with controlled semantic diversity across 5,000 client subsets.

  17. Avoid Forgetting by Preserving Global Knowledge Gradients in Federated Learning with Non-IID Data

    cs.LG 2025-05 conditional novelty 5.0 of 10

    FedProj combines client-side gradient projection onto a global-knowledge loss with server-side ensemble distillation and outperforms existing federated learning methods on non-IID image and NLP benchmarks.

  18. Distributionally Robust Federated Learning with Client Drift Minimization

    cs.LG 2025-05 reject novelty 5.0 of 10

    DRDM combines DRO and FedDyn-style dynamic regularization to improve worst-case client accuracy in federated learning, with a claimed O(1/T^{3/8}) duality-gap convergence rate.

  19. FedQuad: Federated Stochastic Quadruplet Learning to Mitigate Data Heterogeneity

    cs.LG 2025-09 conditional novelty 4.0 of 10

    A quadruplet-based loss for federated learning that aims to reduce representational collapse under data heterogeneity, with mixed empirical support.

  20. Generalizable Federated Learning using Client Adaptive Focal Modulation

    cs.CV 2025-08 reject novelty 4.0 of 10

    The abstract describes AdaptFED, a claimed federated learning method, but the full text is an unrelated graph theory paper, so the claimed results are absent from the submission.

  21. UniVarFL: Uniformity and Variance Regularized Federated Learning for Heterogeneous Data

    cs.LG 2025-06 reject novelty 4.0 of 10

    UniVarFL adds a classifier variance regularizer and a hyperspherical uniformity regularizer to local federated training, reporting improved accuracy on some non-IID benchmarks but not consistently across its own experiments.

Pith tools