.png){kind=icon}
返回
A Regularization Framework for Learning Over Multitask Graphs
.png){kind=icon}
OA
AI
DOI：10.1109/LSP.2018.2889267.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This letter proposes a general regularization framework for inference over multitask networks. The optimization approach relies on minimizing a global cost consisting of the aggregate sum of individual costs regularized by a term that allows to incorporate global information about the graph structure and the individual parameter vectors into the solution of the inference problem. An adaptive strategy, which responds to streaming data and employs stochastic approximations in place of actual gradient vectors, is devised and studied. Methods allowing the distributed implementation of the regularization step are also discussed. This letter shows how to blend real-time adaptation with graph filtering and a generalized regularization framework to result in a graph diffusion strategy for distributed learning over multitask networks.
Keyword:
Multitask graphs
spectral based regularization
gradient noise
distributed implementation
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
TBM research project – Tolerances segmental lining / TVM‐Forschungsprojekt – Toleranzen TübbingausbauTBM研究项目——管片衬砌公差 / TVM-Forschungsprojekt – Tübbingausbau公差
.png){kind=icon}
PREAI
分享收藏分享收藏分享收藏
查看更多内容