arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2303.07041eess.SP
收藏

基于高斯和平稳图信号的图学习

Graph Learning from Gaussian and Stationary Graph Signals

Andrei Buciulea, Antonio G. Marques

摘要:

图已经成为表示具有不规则支持的信息和数据集的普遍工具。然而,在许多情况下,底层图要么不可用,要么是天真地获得的,需要更先进的方法来估计它。事实上,从一组信号观测值估计网络结构的图拓扑推断方法具有悠久的历史。通过假设观测值是高斯分布且在搜索图中是平稳的,本文提出了一种从节点观测值学习网络的新方案。考虑到图的平稳性克服了经典的图形套索算法,这是限制到一个更具体的类的图形模型的一些限制。另一方面,高斯性允许我们正则化估计,需要比现有的基于图平稳性的方法更少的样本。虽然由此产生的估计(优化)问题是更复杂和非凸的,我们设计了一个交替凸的方法能够找到一个固定的解决方案。与合成和真实数据的数值试验,我们的方法的性能与现有的替代品进行了比较。

英文摘要:

Graphs have become pervasive tools to represent information and datasets with irregular support. However, in many cases, the underlying graph is either unavailable or naively obtained, calling for more advanced methods to its estimation. Indeed, graph topology inference methods that estimate the network structure from a set of signal observations have a long and well established history. By assuming that the observations are both Gaussian and stationary in the sought graph, this paper proposes a new scheme to learn the network from nodal observations. Consideration of graph stationarity overcomes some of the limitations of the classical Graphical Lasso algorithm, which is constrained to a more specific class of graphical models. On the other hand, Gaussianity allows us to regularize the estimation, requiring less samples than in existing graph stationarity-based approaches. While the resultant estimation (optimization) problem is more complex and non-convex, we design an alternating convex approach able to find a stationary solution. Numerical tests with synthetic and real data are presented, and the performance of our approach is compared with existing alternatives.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑