论文阅读-A_Low_Complexity_Algorithm_with_OgenTRegretandO1Constraint_Violations_for_Online_Convex_Optimization_with_Long_Term_Constraints
论文阅读
A Low Complexity Algorithm with O($\sqrt{T}$) Regret and O(1) Constraint Violations for Online Convex Optimization with Long Term Constraints（未完待续）题目：A Low Complexity Algorithm with O($\sqrt{T}$) Regret and O(1) Constraint Violations for Online Convex Optimization with Long Term Constraints
出处：JMLR
时间：2020
作者：Hao Yu eeyuhao@gmail.comDepartment of Electrical EngineeringUniversity of Southern CaliforniaLos Angeles, CA, 90089-2565, USA
Michael J. Neely mjneely@usc.eduDepartment of Electrical E ...
论文阅读模板
论文英文题目题目：
出处：
时间：
作者：
代码：
摘要结论研究背景研究目的论文贡献相关工作论文方法方法一方法二方法三实验与结果个人想法引用内容（自用）图片引用：
论文阅读_Online_Distributed_Optimization_with_Efficient_Communication_via_Temporal_Similarity
论文阅读
Online Distributed Optimization with Efficient Communication via Temporal Similarity题目：基于时间相似性的高效通信在线分布式优化
出处：CCFA-INFOCOM
时间：2023
作者：Juncheng Wang∗, Ben Liang∗, Min Dong†, Gary Boudreau‡, and Ali Afana‡∗Department of Electrical and Computer Engineering, University of Toronto, Canada,†Department of Electrical, Computer and Software Engineering, Ontario Tech University, Canada, ‡Ericsson Canada, Canada
摘要：考虑网络系统中的在线分布式优化，其中由服务器辅助的多个设备协同最小化可能随时间变化的全局损失函数序列的积累。为了减少通信量，设备向服务器发送量化和压缩的本地决策，从而产生嘈杂 ...