Towards More Efficient Stochastic Decentralized Learning更有效的随机分散学习: 快速收敛与稀疏通信

Towards More Efficient Stochastic Decentralized Learning更有效的随机分散学习: 快速收敛与稀疏通信

ID:39076708

大小:402.30 KB

页数:15页

时间:2019-06-24

Towards More Efficient Stochastic Decentralized Learning更有效的随机分散学习: 快速收敛与稀疏通信_第1页
Towards More Efficient Stochastic Decentralized Learning更有效的随机分散学习: 快速收敛与稀疏通信_第2页
Towards More Efficient Stochastic Decentralized Learning更有效的随机分散学习: 快速收敛与稀疏通信_第3页
Towards More Efficient Stochastic Decentralized Learning更有效的随机分散学习: 快速收敛与稀疏通信_第4页
Towards More Efficient Stochastic Decentralized Learning更有效的随机分散学习: 快速收敛与稀疏通信_第5页
资源描述:

《Towards More Efficient Stochastic Decentralized Learning更有效的随机分散学习: 快速收敛与稀疏通信》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、TowardsMoreEfficientStochasticDecentralizedLearning:FasterConvergenceandSparseCommunicationZebangShen1AryanMokhtari2TengfeiZhou1PeilinZhao3HuiQian1Abstractvariableofnoden,theproblemofinterestis()XN1XqRecently,thedecentralizedoptimizationproblemminfn(xn),fn,i(xn).(

2、1){xn}Nqisattractinggrowingattention.Mostexistingn=1n=1i=1s.t.x1=...=xNmethodsaredeterministicwithhighper-iterationcostandhaveaconvergenceratequadraticallyTheformulation(1)capturesproblemsinsensornetwork,dependingontheproblemconditionnumber.Be-mobilecomputation,a

3、ndmulti-agentcontrol,whereeithersides,thedensecommunicationisnecessarytoefficientlycentralizingdataorgloballyaggregateinterme-ensuretheconvergenceevenifthedatasetisdiateresultsisunfeasible(Johansson,2008;Bulloetal.,sparse.Inthispaper,wegeneralizethedecentral-2009;

4、Foreroetal.,2010;Ribeiro,2010).izedoptimizationproblemtoamonotoneopera-Developingefficientmethodsforsuchproblemhasbeentorrootfindingproblem,andproposeastochas-oneofthemajoreffortsinthemachinelearningcommunity.ticalgorithmnamedDSBAthat(i)convergesge-Whileearlyworkda

5、tesbackto1980’s(Tsitsiklisetal.,ometricallywitharatelinearlydependingonthe1986;Bertsekas&Tsitsiklis,1989),consensusbasedgradi-problemconditionnumber,and(ii)canbeimple-entdescentanddualaveragingmethodswithsublinearcon-mentedusingsparsecommunicationonly.Ad-vergence

6、havemadetheirdebut(Nedic&Ozdaglar,2009;ditionally,DSBAhandleslearningproblemslikeDuchietal.,2012),whichconsistoftwosteps:allnodes(i)AUC-maximizationwhichcannotbetackledeffi-gatherthe(usuallydense)iteratesfromtheirsneighborsviacientlyinthedecentralizedsetting.Exper

7、imentscommunicationtocomputeaweightedaverage,and(ii)up-onconvexminimizationandAUC-maximizationdatetheaveragebythefullgradientofthelocalfntoob-validatetheefficiencyofourmethod.tainnewiterates.Followingsuchprotocol,successorswithlinearconvergencehavebeenproposedrece

8、ntly(Shietal.,2015a;Mokhtarietal.,2016;Scamanetal.,2017).1.IntroductionDespitetheprogress,twoentangledchallenges,realizedbytheaboveinterlacingsteps,stillremain

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。