具有指数族噪声的图拉普拉斯学习
Graph Laplacian Learning with Exponential Family Noise
AI总结:
针对图推断中噪声类型受限的问题,提出面向指数族噪声的通用图拉普拉斯学习框架,通过交替优化、变分扩展及时空建模提升估计性能。
摘要:
图信号处理(GSP)是分析非欧几里得域上信号的一个重要框架。图傅里叶变换(GFT)使用组合图拉普拉斯矩阵来揭示信号在图频域中的谱分解。然而,应用GSP方法的一个共同挑战是,在许多场景中,系统的基础图是未知的。在这种情况下的一种解决方案是从可用数据构建未观测到的图,这通常被称为图或网络推断。尽管存在不同的图推断方法,但这些方法局限于从平滑图信号或简单的加性高斯噪声中学习。其他类型的噪声数据,例如离散计数或二进制数字,在现实世界应用中相当常见,但在图推断中却研究不足。在本文中,我们提出了一个通用的图推断框架,用于从被指数族噪声破坏的图信号中学习。我们的框架将先前的方法从连续平滑图信号推广到各种数据类型。我们提出了一种交替算法,从噪声信号中联合估计图拉普拉斯和未观测到的平滑表示。我们还将我们的方法扩展为一种变分形式,以考虑潜在平滑表示的固有随机性。最后,由于现实世界的图信号通常是非独立且时间相关的,我们进一步将我们的原始设定调整为时间-顶点公式。我们在合成数据和现实世界数据上证明,我们的新算法优于那些受噪声模型不匹配影响的竞争性拉普拉斯估计方法。
英文摘要:
Graph signal processing (GSP) is a prominent framework for analyzing signals on non-Euclidean domains. The graph Fourier transform (GFT) uses the combinatorial graph Laplacian matrix to reveal the spectral decomposition of signals in the graph frequency domain. However, a common challenge in applying GSP methods is that in many scenarios the underlying graph of a system is unknown. A solution in such cases is to construct the unobserved graph from available data, which is commonly referred to as graph or network inference. Although different graph inference methods exist, these are restricted to learning from either smooth graph signals or simple additive Gaussian noise. Other types of noisy data, such as discrete counts or binary digits, are rather common in real-world applications, yet are underexplored in graph inference. In this paper, we propose a versatile graph inference framework for learning from graph signals corrupted by exponential family noise. Our framework generalizes previous methods from continuous smooth graph signals to various data types. We propose an alternating algorithm that jointly estimates the graph Laplacian and the unobserved smooth representation from the noisy signals. We also extend our approach to a variational form to account for the inherent stochasticity of the latent smooth representation. Finally, since real-world graph signals are frequently non-independent and temporally correlated, we further adapt our original setting to a time-vertex formulation. We demonstrate on synthetic and real-world data that our new algorithms outperform competing Laplacian estimation methods that suffer from noise model mismatch.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。