基于事件广播的随机子梯度算法

Mani H. Dhullipalla, Hao Yu, Tongwen Chen
{"title":"基于事件广播的随机子梯度算法","authors":"Mani H. Dhullipalla, Hao Yu, Tongwen Chen","doi":"10.1109/EBCCSP53293.2021.9502363","DOIUrl":null,"url":null,"abstract":"Stochastic subgradient algorithms (SSAs) are widely studied owing to their applications in distributed and online learning. However, in a distributed setting, their sub-linear convergence rates tend to attract a large number of information exchanges that raise the overall communication burden. In order to reduce this burden, in this paper, we design two static stochastic event-based broadcasting protocols that operate in conjunction with SSAs to address a set-constrained distributed optimization problem (DOP). We address two notions of stochastic convergence, namely, almost sure and mean convergence; for each of these notions we design event-based broadcasting protocols, specifically, the stochastic event-thresholds. Subsequently, we illustrate the design via a numerical example and provide comparisons to evaluate its performance against the existing event-based protocols.","PeriodicalId":291826,"journal":{"name":"2021 7th International Conference on Event-Based Control, Communication, and Signal Processing (EBCCSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Event-Based Broadcasting for Stochastic Subgradient Algorithms\",\"authors\":\"Mani H. Dhullipalla, Hao Yu, Tongwen Chen\",\"doi\":\"10.1109/EBCCSP53293.2021.9502363\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Stochastic subgradient algorithms (SSAs) are widely studied owing to their applications in distributed and online learning. However, in a distributed setting, their sub-linear convergence rates tend to attract a large number of information exchanges that raise the overall communication burden. In order to reduce this burden, in this paper, we design two static stochastic event-based broadcasting protocols that operate in conjunction with SSAs to address a set-constrained distributed optimization problem (DOP). We address two notions of stochastic convergence, namely, almost sure and mean convergence; for each of these notions we design event-based broadcasting protocols, specifically, the stochastic event-thresholds. Subsequently, we illustrate the design via a numerical example and provide comparisons to evaluate its performance against the existing event-based protocols.\",\"PeriodicalId\":291826,\"journal\":{\"name\":\"2021 7th International Conference on Event-Based Control, Communication, and Signal Processing (EBCCSP)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 7th International Conference on Event-Based Control, Communication, and Signal Processing (EBCCSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EBCCSP53293.2021.9502363\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 7th International Conference on Event-Based Control, Communication, and Signal Processing (EBCCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EBCCSP53293.2021.9502363","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随机次梯度算法(SSAs)由于在分布式和在线学习中的应用而受到广泛的研究。然而,在分布式环境下,它们的亚线性收敛速度往往会吸引大量的信息交换,从而增加了整体的通信负担。为了减轻这种负担,在本文中,我们设计了两个基于静态随机事件的广播协议,它们与SSAs一起运行,以解决集约束分布式优化问题(DOP)。我们讨论了随机收敛的两个概念,即几乎确定收敛和平均收敛;对于这些概念,我们设计了基于事件的广播协议,特别是随机事件阈值。随后,我们通过一个数值例子说明了该设计,并提供了比较,以评估其性能与现有的基于事件的协议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Event-Based Broadcasting for Stochastic Subgradient Algorithms
Stochastic subgradient algorithms (SSAs) are widely studied owing to their applications in distributed and online learning. However, in a distributed setting, their sub-linear convergence rates tend to attract a large number of information exchanges that raise the overall communication burden. In order to reduce this burden, in this paper, we design two static stochastic event-based broadcasting protocols that operate in conjunction with SSAs to address a set-constrained distributed optimization problem (DOP). We address two notions of stochastic convergence, namely, almost sure and mean convergence; for each of these notions we design event-based broadcasting protocols, specifically, the stochastic event-thresholds. Subsequently, we illustrate the design via a numerical example and provide comparisons to evaluate its performance against the existing event-based protocols.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信