Learning Sparse Graphs via Majorization-Minimization for Smooth Node Signals

doi:10.1109/LSP.2022.3165468

Learning Sparse Graphs via Majorization-Minimization for Smooth Node Signals

2022-01-01

5

OA

AI

DOI：10.1109/LSP.2022.3165468

Original

Original request for help

Save

Abstract

En 中文

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 be used to speed 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.

Keywords:

Signal processing algorithms

Convergence

Laplace equations

Sparse matrices

Signal processing

Numerical simulation

Minimization

Graph signal processing

majorization-minimiz- ation

sparse graph learning

smooth signals

Learning Sparse Graphs via Majorization-Minimization for Smooth Node Signals

Abstract

Journal

Organization