Log In Sign Up

Learning Graphs from Smooth Signals under Moment Uncertainty

by   Xiaolu Wang, et al.

We consider the problem of inferring the graph structure from a given set of smooth graph signals. The number of perceived graph signals is always finite and possibly noisy, thus the statistical properties of the data distribution is ambiguous. Traditional graph learning models do not take this distributional uncertainty into account, thus performance may be sensitive to different sets of data. In this paper, we propose a distributionally robust approach to graph learning, which incorporates the first and second moment uncertainty into the smooth graph learning model. Specifically, we cast our graph learning model as a minimax optimization problem, and further reformulate it as a nonconvex minimization problem with linear constraints. In our proposed formulation, we find a theoretical interpretation of the Laplacian regularizer, which is adopted in many existing works in an intuitive manner. Although the first moment uncertainty leads to an annoying square root term in the objective function, we prove that it enjoys the smoothness property with probability 1 over the entire constraint. We develop a efficient projected gradient descent (PGD) method and establish its global iterate convergence to a critical point. We conduct extensive experiments on both synthetic and real data to verify the effectiveness of our model and the efficiency of the PGD algorithm. Compared with the state-of-the-art smooth graph learning methods, our approach exhibits superior and more robust performance across different populations of signals in terms of various evaluation metrics.


page 1

page 11


How to learn a graph from smooth signals

We propose a framework that learns the graph structure underlying a set ...

Robust Graph Learning Under Wasserstein Uncertainty

Graphs are playing a crucial role in different fields since they are pow...

Nonsmooth Composite Nonconvex-Concave Minimax Optimization

Nonconvex-concave minimax optimization has received intense interest in ...

Robust Graph Embedding with Noisy Link Weights

We propose β-graph embedding for robustly learning feature vectors from ...

Robust Causal Graph Representation Learning against Confounding Effects

The prevailing graph neural network models have achieved significant pro...

Graph Learning for Inverse Landscape Genetics

The problem of inferring unknown graph edges from numerical data at a gr...

Learning heat diffusion graphs

Effective information analysis generally boils down to properly identify...