Pith. sign in

REVIEW 2 cited by

Review of Mathematical Optimization in Federated Learning

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 2412.01630 v1 pith:PPYIJ7EE submitted 2024-12-02 cs.LG cs.DC

classification cs.LGcs.DC
keywords optimizationdistributedfederatedlearningmethodsresearchreviewaddress
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Federated Learning (FL) has been becoming a popular interdisciplinary research area in both applied mathematics and information sciences. Mathematically, FL aims to collaboratively optimize aggregate objective functions over distributed datasets while satisfying a variety of privacy and system constraints.Different from conventional distributed optimization methods, FL needs to address several specific issues (e.g., non-i.i.d. data distributions and differential private noises), which pose a set of new challenges in the problem formulation, algorithm design, and convergence analysis. In this paper, we will systematically review existing FL optimization research including their assumptions, formulations, methods, and theoretical results. Potential future directions are also discussed.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Federated Learning from Molecules to Processes: A Perspective

    cs.LG 2025-06 conditional novelty 6.0 of 10

    Federated learning lets chemical companies train shared models on private data, and two case studies show it approaches centralized accuracy while outperforming isolated training.

  2. Objective Value Change and Shape-Based Accelerated Optimization for the Neural Network Approximation

    cs.LG 2025-08 reject novelty 4.0 of 10

    Neural networks approximate low-variation regions of a function first, and a preprocessing trick that subtracts an interpolant speeds up training, per the paper's 'value change' analysis.

Pith tools