Learning Sparse Graphs via Majorization-Minimization for Smooth Node Signals

02/06/2022
by   Ghania Fatima, et al.
0

In this letter, we propose an algorithm for learning a sparse weighted graph by estimating its adjacency matrix under the assumption that the observed signals vary smoothly over the nodes of the graph. The proposed algorithm is based on the principle of majorization-minimization (MM), wherein we first obtain a tight surrogate function for the graph learning objective and then solve the resultant surrogate problem which has a simple closed form solution. The proposed algorithm does not require tuning of any hyperparameter and it has the desirable feature of eliminating the inactive variables in the course of the iterations - which can help speeding up the algorithm. The numerical simulations conducted using both synthetic and real world (brain-network) data show that the proposed algorithm converges faster, in terms of the average number of iterations, than several existing methods in the literature.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/26/2020

Learning Product Graphs Underlying Smooth Graph Signals

Real-world data is often times associated with irregular structures that...
research
10/16/2021

PDMM: A novel Primal-Dual Majorization-Minimization algorithm for Poisson Phase-Retrieval problem

In this paper, we introduce a novel iterative algorithm for the problem ...
research
08/21/2020

Graph learning under spectral sparsity constraints

Graph inference plays an essential role in machine learning, pattern rec...
research
05/12/2019

Robust Learning from Noisy Side-information by Semidefinite Programming

Robustness recently becomes one of the major concerns among machine lear...
research
03/22/2023

GraphIT: Iterative reweighted ℓ_1 algorithm for sparse graph inference in state-space models

State-space models (SSMs) are a common tool for modeling multi-variate d...
research
06/02/2021

Refinement of Direction of Arrival Estimators by Majorization-Minimization Optimization on the Array Manifold

We propose a generalized formulation of direction of arrival estimation ...

Please sign up or login with your details

Forgot password? Click here to reset