Generalized Matrix Means for Semi-Supervised Learning with Multilayer Graphs
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Oct 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 3.
4 papers.
- 2023Bures-Wasserstein Means of Graphscited by 6
- 2022Graph-based Multi-View Fusion and Local Adaptation: Mitigating Within-Household Confusability for Speaker Identificationcited by 1
- 2023Laplacian-based Semi-Supervised Learning in Multilayer Hypergraphs by Coordinate Descentcited by 0
- 2023Learning the Right Layers: a Data-Driven Layer-Aggregation Strategy for Semi-Supervised Learning on Multilayer Graphscited by 0
- 2023Learning the Right Layers: a Data-Driven Layer-Aggregation Strategy for Semi-Supervised Learning on Multilayer Graphs31 May 2023
- 2023Bures-Wasserstein Means of Graphs31 May 2023
- 2023Laplacian-based Semi-Supervised Learning in Multilayer Hypergraphs by Coordinate Descent28 Jan 2023
- 2022Graph-based Multi-View Fusion and Local Adaptation: Mitigating Within-Household Confusability for Speaker Identification8 Jul 2022