Pith. sign in

REVIEW 3 cited by

Peer-to-peer Federated Learning on Graphs

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 1901.11173 v1 pith:MSG55KAD submitted 2019-01-31 cs.LG stat.ML

Peer-to-peer Federated Learning on Graphs

classification cs.LG stat.ML
keywords learningmodelnodesalgorithmnetworktrainingbelieflearn
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We consider the problem of training a machine learning model over a network of nodes in a fully decentralized framework. The nodes take a Bayesian-like approach via the introduction of a belief over the model parameter space. We propose a distributed learning algorithm in which nodes update their belief by aggregate information from their one-hop neighbors to learn a model that best fits the observations over the entire network. In addition, we also obtain sufficient conditions to ensure that the probability of error is small for every node in the network. We discuss approximations required for applying this algorithm to train Deep Neural Networks (DNNs). Experiments on training linear regression model and on training a DNN show that the proposed learning rule algorithm provides a significant improvement in the accuracy compared to the case where nodes learn without cooperation.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

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

  1. Estimating Mixture Distributions via Stochastic Mirror Descent

    stat.ML 2026-05 unverdicted novelty 6.0

    Proposes stochastic mirror descent estimators for mixture models that scale to many components, avoid strict support bounds for discrete cases, and achieve near-optimal KL and l2 rates under mild conditions.

  2. Function-Space ADMM for Decentralized Federated Learning: A Control Theoretic Perspective

    cs.LG 2026-05 unverdicted novelty 6.0

    FedF-ADMM uses function-space ADMM updates projected via knowledge distillation plus a PI-like stabilization term to deliver faster, more stable convergence and higher accuracy than prior decentralized FL methods unde...

  3. DFedReweighting: A Unified Framework for Objective-Oriented Reweighting in Decentralized Federated Learning

    cs.LG 2025-12 unverdicted novelty 6.0

    DFedReweighting is a unified reweighting method for decentralized federated learning that customizes aggregation via target metrics and strategies to improve fairness, Byzantine robustness, and other objectives while ...