SwePub
Sök i LIBRIS databas

  Utökad sökning

onr:"swepub:oai:DiVA.org:kth-293401"
 

Sökning: onr:"swepub:oai:DiVA.org:kth-293401" > Coded Stochastic AD...

  • Chen, HaoKTH,Optical Network Laboratory (ON Lab) (författare)

Coded Stochastic ADMM for Decentralized Consensus Optimization With Edge Computing

  • Artikel/kapitelEngelska2021

Förlag, utgivningsår, omfång ...

  • Institute of Electrical and Electronics Engineers (IEEE),2021
  • electronicrdacarrier

Nummerbeteckningar

  • LIBRIS-ID:oai:DiVA.org:kth-293401
  • https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-293401URI
  • https://doi.org/10.1109/JIOT.2021.3058116DOI

Kompletterande språkuppgifter

  • Språk:engelska
  • Sammanfattning på:engelska

Ingår i deldatabas

Klassifikation

  • Ämneskategori:ref swepub-contenttype
  • Ämneskategori:art swepub-publicationtype

Anmärkningar

  • QC 20210426
  • Big data, including applications with high security requirements, are often collected and stored on multiple heterogeneous devices, such as mobile devices, drones, and vehicles. Due to the limitations of communication costs and security requirements, it is of paramount importance to analyze information in a decentralized manner instead of aggregating data to a fusion center. To train large-scale machine learning models, edge/fog computing is often leveraged as an alternative to centralized learning. We consider the problem of learning model parameters in a multiagent system with data locally processed via distributed edge nodes. A class of minibatch stochastic alternating direction method of multipliers (ADMMs) algorithms is explored to develop the distributed learning model. To address two main critical challenges in distributed learning systems, i.e., communication bottleneck and straggler nodes (nodes with slow responses), error-control-coding-based stochastic incremental ADMM is investigated. Given an appropriate minibatch size, we show that the minibatch stochastic ADMM-based method converges in a rate of O(1/root k), where k denotes the number of iterations. Through numerical experiments, it is revealed that the proposed algorithm is communication efficient, rapidly responding, and robust in the presence of straggler nodes compared with state-of-the-art algorithms.

Ämnesord och genrebeteckningar

Biuppslag (personer, institutioner, konferenser, titlar ...)

  • Ye, YuKTH,Teknisk informationsvetenskap(Swepub:kth)u1y1pv31 (författare)
  • Xiao, Ming,1975-KTH,Teknisk informationsvetenskap(Swepub:kth)u1iq6n9a (författare)
  • Skoglund, Mikael,1969-KTH,Teknisk informationsvetenskap(Swepub:kth)u1dbnyps (författare)
  • Poor, H. VincentPrinceton Univ, Dept Elect Engn, Princeton, NJ 08544 USA. (författare)
  • KTHOptical Network Laboratory (ON Lab) (creator_code:org_t)

Sammanhörande titlar

  • Ingår i:IEEE Internet of Things Journal: Institute of Electrical and Electronics Engineers (IEEE)8:7, s. 5360-53732327-4662

Internetlänk

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy