Skip to Main content Skip to Navigation

SPECTRAL EMBEDDING OF REGULARIZED BLOCK MODELS

Abstract : Spectral embedding is a popular technique for the representation of graph data. Several regularization techniques have been proposed to improve the quality of the embedding with respect to downstream tasks like clustering. In this paper, we explain on a simple block model the impact of the complete graph regularization, whereby a constant is added to all entries of the adjacency matrix. Specifically, we show that the regularization forces the spectral embedding to focus on the largest blocks, making the representation less sensitive to noise or outliers. We illustrate these results on both on both synthetic and real data, showing how regularization improves standard clustering scores.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.telecom-paristech.fr/hal-02420827
Contributor : Thomas Bonald <>
Submitted on : Friday, December 20, 2019 - 10:24:04 AM
Last modification on : Saturday, February 1, 2020 - 1:52:53 AM
Document(s) archivé(s) le : Saturday, March 21, 2020 - 4:18:26 PM

Files

ICLR2020.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02420827, version 1
  • ARXIV : 1912.10903

Citation

Nathan de Lara, Thomas Bonald. SPECTRAL EMBEDDING OF REGULARIZED BLOCK MODELS. ICLR, 2020, Addis Abeba, Ethiopia. ⟨hal-02420827⟩

Share

Metrics

Record views

110

Files downloads

44