mlsanityData to 7 Oct 2026

Deep-Relative-Trust-Based Diffusion for Decentralized Deep Learning

arXiv 2501.03162 ↗First posted 6 Jan 2025cs.LG eess.SPcited by 0

Not on the map. Why?

Abstract (arXiv)

Decentralized learning strategies allow a collection of agents to learn efficiently from local data sets without the need for central aggregation or orchestration. Current decentralized learning paradigms typically rely on an averaging mechanism to encourage agreement in the parameter space. We argue that in the context of deep neural networks, which are often over-parameterized, encouraging consensus of the neural network outputs, as opposed to their parameters can be more appropriate. This motivates the development of a new decentralized learning algorithm, termed DRT diffusion, based on deep relative trust (DRT), a recently introduced similarity measure for neural networks. We provide convergence analysis for the proposed strategy, and numerically establish its benefit to generalization, especially with sparse topologies, in an image classification task.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 14 of its 19 references that are in the map. First posted on arXiv 6 Jan 2025.

Builds on

14 of 19 references.

References · 14

  1. 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 496
  2. 2014EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimizationcited by 160
  3. 2016Achieving Geometric Convergence for Distributed Optimization over Time-Varying Graphscited by 149
  4. 2016NEXT: In-Network Nonconvex Optimizationcited by 107
  5. 2017Exact Diffusion for Distributed Optimization and Learning --- Part I: Algorithm Developmentcited by 50
  6. 2021Consensus Control for Decentralized Deep Learningcited by 49
  7. 2020On the distance between two neural networks and the stability of learningcited by 46
  8. 2022Topology-aware Generalization of Decentralized SGDcited by 37
  9. 2019Distributed Learning in Non-Convex Environments -- Part I: Agreement at a Linear Ratecited by 22
  10. 2013On the Learning Behavior of Adaptive Networks - Part I: Transient Analysiscited by 20
  11. 2019Distributed Learning in Non-Convex Environments -- Part II: Polynomial Escape from Saddle-Pointscited by 13
  12. 2022Networked Signal and Information Processingcited by 10
2 more
  1. 2023Stability and Generalization of the Decentralized Stochastic Gradient Descent Ascent Algorithmcited by 8
  2. 2022AB/Push-Pull Method for Distributed Optimization in Time-Varying Directed Networkscited by 5

Built on by

Not cited yet.