Learning Graphs from Smooth and Graph-Stationary Signals with Hidden Variables

11/10/2021
by   Andrei Buciulea, et al.
0

Network-topology inference from (vertex) signal observations is a prominent problem across data-science and engineering disciplines. Most existing schemes assume that observations from all nodes are available, but in many practical environments, only a subset of nodes is accessible. A natural (and sometimes effective) approach is to disregard the role of unobserved nodes, but this ignores latent network effects, deteriorating the quality of the estimated graph. Differently, this paper investigates the problem of inferring the topology of a network from nodal observations while taking into account the presence of hidden (latent) variables. Our schemes assume the number of observed nodes is considerably larger than the number of hidden variables and build on recent graph signal processing models to relate the signals and the underlying graph. Specifically, we go beyond classical correlation and partial correlation approaches and assume that the signals are smooth and/or stationary in the sought graph. The assumptions are codified into different constrained optimization problems, with the presence of hidden variables being explicitly taken into account. Since the resulting problems are ill-conditioned and non-convex, the block matrix structure of the proposed formulations is leveraged and suitable convex-regularized relaxations are presented. Numerical experiments over synthetic and real-world datasets showcase the performance of the developed methods and compare them with existing alternatives.

READ FULL TEXT

page 1

page 10

research
12/04/2022

Joint graph learning from Gaussian observations in the presence of hidden nodes

Graph learning problems are typically approached by focusing on learning...
research
10/05/2021

Joint inference of multiple graphs with hidden variables from stationary graph signals

Learning graphs from sets of nodal observations represents a prominent p...
research
05/16/2018

Semi-Blind Inference of Topologies and Dynamical Processes over Graphs

Network science provides valuable insights across numerous disciplines i...
research
10/16/2020

Joint Inference of Multiple Graphs from Matrix Polynomials

Inferring graph structure from observations on the nodes is an important...
research
08/23/2020

Kernel-based Graph Learning from Smooth Signals: A Functional Viewpoint

The problem of graph learning concerns the construction of an explicit t...
research
09/17/2022

Joint Network Topology Inference via a Shared Graphon Model

We consider the problem of estimating the topology of multiple networks ...
research
03/15/2022

Learning Expanding Graphs for Signal Interpolation

Performing signal processing over graphs requires knowledge of the under...

Please sign up or login with your details

Forgot password? Click here to reset