多任务图上的学习--第一部分:稳定性分析
Learning over Multitask Graphs -- Part I: Stability Analysis
摘要:
本文阐述了一个多任务优化问题,在网络中的代理有个别的目标,以满足,或个别参数向量估计,受平滑条件的图形。平滑条件软化相邻节点之间的任务中的过渡,并允许将关于图结构的信息并入推理问题的解决方案中。一个扩散策略的设计,响应流数据,并采用随机近似代替实际的梯度向量,这是一般不可用。该方法依赖于最小化的整体成本,包括由一个项,促进平滑正则化的个人成本的总和。我们表明,在这第一部分的工作,在步长参数的条件下,自适应策略引起的收缩映射,并导致小的估计误差的顺序小的步长。第二部分的结果将明确揭示网络拓扑结构和正则化强度对网络性能的影响,并为网络上分布式推理的有效多任务策略的设计提供见解。
英文摘要:
This paper formulates a multitask optimization problem where agents in the network have individual objectives to meet, or individual parameter vectors to estimate, subject to a smoothness condition over the graph. The smoothness condition softens the transition in the tasks among adjacent nodes and allows incorporating information about the graph structure into the solution of the inference problem. A diffusion strategy is devised that responds to streaming data and employs stochastic approximations in place of actual gradient vectors, which are generally unavailable. The approach relies on minimizing a global cost consisting of the aggregate sum of individual costs regularized by a term that promotes smoothness. We show in this Part I of the work, under conditions on the step-size parameter, that the adaptive strategy induces a contraction mapping and leads to small estimation errors on the order of the small step-size. The results in the accompanying Part II will reveal explicitly the influence of the network topology and the regularization strength on the network performance and will provide insights into the design of effective multitask strategies for distributed inference over networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。