Lune

ICLR2020Top-tier venue

Spectral Embedding of Regularized Block Models

Nathan de Lara, Thomas Bonald

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.

Ask Lune

Know this paper in minutes, not an afternoon.

Lune can read every page of it and the top-tier papers that cite it, and gives you its claims, its evidence and its limits, each one cited to the paper it comes from. No skimming, no AI slop.

Questions to start from

Lune can draw on

the full paper · related work

Get the answer

Free to start. No credit card required.

Related papers

  1. Average Sensitivity of Spectral ClusteringPan Peng, Yuichi YoshidaKDD 2020 · 12 citations
  2. Handling Missing Data via Max-Entropy Regularized Graph AutoencoderZiqi Gao, Yifan Niu, Jiashun Cheng, Jianheng Tang et al.AAAI 2023 · 16 citations
  3. Fast and Simple Spectral Clustering in Theory and PracticePeter MacgregorNeurIPS 2023 · 12 citations
  4. Optimal Graph Clustering without Edge Density SignalsMaximilien Dreveton, Elaine Siyu Liu, Matthias Grossglauser, Patrick ThiranNeurIPS 2025
  5. Weighted Flow Diffusion for Local Graph Clustering with Node Attributes: an Algorithm and Statistical GuaranteesShenghao Yang, Kimon FountoulakisICML 2023 · 6 citations
Dusk over the sea between two cliffs drawn in fine vertical lines