返回
Adaptive Kernel Learning in Heterogeneous Networks
DOI:10.1109/TSIPN.2021.3087111.png)
摘要
En 中文
We consider learning in decentralized heterogeneous networks: agents seek to minimize a convex functional that aggregates data across the network, while only having access to their local data streams. We focus on the case where agents seek to estimate a regression function that belongs to a reproducing kernel Hilbert space (RKHS). To incentivize coordination while respecting network heterogeneity, we impose nonlinear proximity constraints. The resulting constrained stochastic optimization problem is solved using the functional variant of stochastic primal-dual (Arrow-Hurwicz) method which yields a decentralized algorithm. In order to avoid the model complexity from growing linearly over time, we project the primal iterates onto subspaces greedily constructed from kernel evaluations of agents' local observations. The resulting scheme, dubbed Heterogeneous Adaptive Learning with Kernels (HALK), allows us, for the first time, to characterize the precise trade-off between the optimality gap, constraint violation, and the model complexity. In particular, the proposed algorithm can be tuned to achieve zero constraint violation, an optimality gap of O(T-1/2 + alpha) after T iterations, where the number of elements retained in the dictionary is determined by 1/alpha. Simulations on a correlated spatio-temporal field estimation validate our theoretical results, which are corroborated in practice for networked oceanic sensing buoys estimating temperature and salinity from depth measurements.
Keyword:
Nonparametric regression
decentralized algorithm
statistical learning
kernel methods
stochastic optimization
online learning
stochastic primal-dual method
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.9
论文数:
728
被引数:
1.9K
机构
引用论文
Image denoising via sparse and redundant representations over learned dictionaries通过学习字典上的稀疏和冗余表示进行图像去噪

