Generalized Matrix Means for Semi-Supervised Learning with Multilayer Graphs

by   Pedro Mercado, et al.

We study the task of semi-supervised learning on multilayer graphs by taking into account both labeled and unlabeled observations together with the information encoded by each individual graph layer. We propose a regularizer based on the generalized matrix mean, which is a one-parameter family of matrix means that includes the arithmetic, geometric and harmonic means as particular cases. We analyze it in expectation under a Multilayer Stochastic Block Model and verify numerically that it outperforms state of the art methods. Moreover, we introduce a matrix-free numerical scheme based on contour integral quadratures and Krylov subspace solvers that scales to large sparse multilayer graphs.


page 4

page 6


The Power Mean Laplacian for Multilayer Graph Clustering

Multilayer graphs encode different kind of interactions between the same...

Semi-supervised Learning for Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix Vector Products

We generalize a graph-based multiclass semi-supervised classification te...

A generalized linear joint trained framework for semi-supervised learning of sparse features

The elastic-net is among the most widely used types of regularization al...

A Simple Algorithm for Semi-supervised Learning with Improved Generalization Error Bound

In this work, we develop a simple algorithm for semi-supervised regressi...

Semi-Supervised Learning on Graphs with Feature-Augmented Graph Basis Functions

For semi-supervised learning on graphs, we study how initial kernels in ...

Semi-supervised Ranking Pursuit

We propose a novel sparse preference learning/ranking algorithm. Our alg...

Semi-Automatic Task Graph Construction for ℋ-Matrix Arithmetic

A new method to construct task graphs for -matrix arithmetic is introduc...