广义图信号处理中基于核的重建方法
Kernel Based Reconstruction for Generalized Graph Signal Processing
AI总结:
本文将广义图信号处理中的信号重建问题建模为核岭回归问题,通过设计合适核实现分布式求解,并提供随机傅里叶特征在线实现及真实数据验证。
摘要:
在广义图信号处理(GGSP)中,图中每个顶点关联的信号是希尔伯特空间中的一个元素。本文将 GGSP 信号重建问题研究为核岭回归(KRR)问题。通过设计一个合适的核,我们证明该问题存在一个可以分布式求解的解。我们从确定性视角和贝叶斯视角对该问题及其解进行解释,并将其与现有的图信号处理和 GGSP 框架联系起来。随后,我们通过随机傅里叶特征提供了一种在线实现方式。在贝叶斯框架下,我们研究了渐近采样方案下的统计性能。最后,我们在真实世界数据集上验证了我们的理论和方法。
英文摘要:
In generalized graph signal processing (GGSP), the signal associated with each vertex in a graph is an element from a Hilbert space. In this paper, we study GGSP signal reconstruction as a kernel ridge regression (KRR) problem. By devising an appropriate kernel, we show that this problem has a solution that can be evaluated in a distributed way. We interpret the problem and solution using both deterministic and Bayesian perspectives and link them to existing graph signal processing and GGSP frameworks. We then provide an online implementation via random Fourier features. Under the Bayesian framework, we investigate the statistical performance under the asymptotic sampling scheme. Finally, we validate our theory and methods on real-world datasets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。