arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2105.04210cs.LGeess.SP
收藏

Wasserstein不确定性下的鲁棒图学习

Robust Graph Learning Under Wasserstein Uncertainty

Southeast University(东南大学)

Xiang Zhang, Yinfei Xu, Qinghe Liu, Zhicheng Liu, Jian Lu, Qiao Wang

摘要:

图在不同的领域中发挥着至关重要的作用,因为它们是揭示信号之间内在关系的强大工具。在许多情况下,表示信号的准确图结构根本不可用,这促使人们直接从观察到的信号中学习可靠的图结构。然而,在现实生活中,由于噪声测量或有限的可观测性,不可避免地存在观测信号中的不确定性,这导致学习图的可靠性降低。为此,我们提出了一个图学习框架,使用Wasserstein分布鲁棒优化(WDRO),通过定义一个不确定性集的分布观察到的数据来处理数据中的不确定性。具体地说,建立了两个模型,一个假设不确定性集合中的所有分布都是高斯分布,另一个没有先验分布假设。我们提出了两种算法来求解相应的模型,而不是直接使用内点法,并表明我们的算法更节省时间。此外,我们还将这两个模型转化为半定规划(SDP),并说明了它们在大规模图的情况下是难以处理的。在合成数据和真实数据上进行了实验,结果表明,我们的方案可以在不确定性的背景下学习到可靠的图。

英文摘要:

Graphs are playing a crucial role in different fields since they are powerful tools to unveil intrinsic relationships among signals. In many scenarios, an accurate graph structure representing signals is not available at all and that motivates people to learn a reliable graph structure directly from observed signals. However, in real life, it is inevitable that there exists uncertainty in the observed signals due to noise measurements or limited observability, which causes a reduction in reliability of the learned graph. To this end, we propose a graph learning framework using Wasserstein distributionally robust optimization (WDRO) which handles uncertainty in data by defining an uncertainty set on distributions of the observed data. Specifically, two models are developed, one of which assumes all distributions in uncertainty set are Gaussian distributions and the other one has no prior distributional assumption. Instead of using interior point method directly, we propose two algorithms to solve the corresponding models and show that our algorithms are more time-saving. In addition, we also reformulate both two models into Semi-Definite Programming (SDP), and illustrate that they are intractable in the scenario of large-scale graph. Experiments on both synthetic and real world data are carried out to validate the proposed framework, which show that our scheme can learn a reliable graph in the context of uncertainty.

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

↑