Generalized Matrix Means for Semi-Supervised Learning with Multilayer Graphs

Abstract

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.

Accepted in NeurIPS 2019

Cited by in corpus (4)

• Learning Multi-Modal Nonlinear Embeddings: Performance Bounds and an Algorithm
• Micro-supervised Disturbance Learning: A Perspective of Representation Probability Distribution
• Mask Combination of Multi-layer Graphs for Global Structure Inference
• Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix Vector Products