Pith. sign in

REVIEW 6 cited by

Federated Meta-Learning with Fast Convergence and Efficient Communication

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 1802.07876 v2 pith:Q45IR2M5 submitted 2018-02-22 cs.LG cs.IR

classification cs.LGcs.IR
keywords federatedalgorithmfedmetalearningmeta-learningcommunicationconvergencedevices
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Statistical and systematic challenges in collaboratively training machine learning models across distributed networks of mobile devices have been the bottlenecks in the real-world application of federated learning. In this work, we show that meta-learning is a natural choice to handle these issues, and propose a federated meta-learning framework FedMeta, where a parameterized algorithm (or meta-learner) is shared, instead of a global model in previous approaches. We conduct an extensive empirical evaluation on LEAF datasets and a real-world production dataset, and demonstrate that FedMeta achieves a reduction in required communication cost by 2.82-4.33 times with faster convergence, and an increase in accuracy by 3.23%-14.84% as compared to Federated Averaging (FedAvg) which is a leading optimization algorithm in federated learning. Moreover, FedMeta preserves user privacy since only the parameterized algorithm is transmitted between mobile devices and central servers, and no raw data is collected onto the servers.

Discussion (0). Sign in to comment.

Forward citations

Cited by 6 Pith papers

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

  1. FedMeNF: Privacy-Preserving Federated Meta-Learning for Neural Fields

    cs.LG 2025-08 conditional novelty 7.0 of 10

    MDIR detects LLM weight homology from embedding matrices alone using polar decomposition and permutation matching, achieving perfect AUC and accuracy on LeaFBench and reconstructing layer-level transformations.

  2. Personalized Digital Health Modeling with Adaptive Support Users

    cs.AI 2026-05 unverdicted novelty 6.0 of 10

    A framework for personalizing digital health models by jointly learning adaptive weights on support users, using similarity-weighted transfer from similar users and contrastive regularization from dissimilar users to ...

  3. Personalized Digital Health Modeling with Adaptive Support Users

    cs.AI 2026-05 unverdicted novelty 6.0 of 10

    A new framework trains personal digital health models using adaptive weights on support users including dissimilar ones, achieving up to 25% lower RMSE in low-data settings.

  4. When To Adapt? Adapting the Model or Data in Federated Medical Imaging

    cs.CV 2026-04 unverdicted novelty 6.0 of 10

    Harmonization works better than personalization for appearance-based domain shifts in federated medical imaging while personalization is superior for structural shifts, with both performing similarly when shifts are small.

  5. Federated Learning with Heterogeneous and Private Label Sets

    cs.LG 2025-08 conditional novelty 6.0 of 10

    By averaging classifier weights per label across clients and tuning the central model on unlabeled data, federated learning can handle private, heterogeneous client label sets at accuracy close to the public-label setting.

  6. Joint Channel Estimation and Dynamics-Aware Grouping for Time-Varying RIS-Assisted OTA Federated Learning

    cs.IT 2026-07 conditional novelty 4.0 of 10

    A GRU-based channel predictor plus mobility-aware user grouping reduces CSI and over-the-air aggregation error in RIS-assisted federated learning under imperfect, time-varying channels.

Pith tools