Skip to main navigation Skip to search Skip to main content

RicciNet: Deep Clustering via A Riemannian Generative Model

  • Li Sun*
  • , Jingbin Hu
  • , Suyang Zhou
  • , Zhenhao Huang
  • , Junda Ye
  • , Hao Peng
  • , Zhengtao Yu
  • , Philip Yu
  • *Corresponding author for this work
  • North China Electric Power University
  • Beijing University of Posts and Telecommunications
  • Kunming University of Science and Technology
  • University of Illinois at Chicago

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In recent years, deep clustering has achieved encouraging results. However, existing deep clustering methods work with the traditional Euclidean space and thus present deficiency on clustering complex structures. On the contrary, Riemannian geometry provides an elegant framework to model complex structures as well as a powerful tool for clustering, i.e., the Ricci flow. In this paper, we rethink the problem of deep clustering, and introduce the Riemannian geometry to deep clustering for the first time. Deep clustering in Riemannian manifold still faces significant challenges: (1) Ricci flow itself is unaware of cluster membership, (2) Ricci curvature prevents the gradient backpropagation, and (3) learning the flow largely remains open in the manifold. To bridge these gaps, we propose a novel Riemannian generative model (RicciNet), a neural Ricci flow with several theoretical guarantees. The novelty is that we model the dynamic self-clustering process of Ricci flow: data points move to the respective clusters in the manifold, influenced by Ricci curvatures. The point's trajectory is characterized by a parametric velocity, taking the form of Ordinary Differential Equation (ODE). Specifically, we encode data points as samples of Gaussian mixture in the manifold where we propose two types of reparameterization approaches: Gumbel reparameterization, and geometric trick. We formulate a differentiable Ricci curvature parameterized by a Riemannian graph convolution. Thereafter, we propose a geometric learning approach in which we study the geometric regularity of the point's trajectory, and learn the flow via distance matching and velocity matching. Consequently, data points go along the shortest Ricci flow to complete clustering. Extensive empirical results show RicciNet outperforms Euclidean deep methods.

Original languageEnglish
Title of host publicationWWW 2024 - Proceedings of the ACM Web Conference
PublisherAssociation for Computing Machinery, Inc
Pages4071-4082
Number of pages12
ISBN (Electronic)9798400701719
DOIs
StatePublished - 13 May 2024
Event33rd ACM Web Conference, WWW 2024 - Singapore, Singapore
Duration: 13 May 202417 May 2024

Publication series

NameWWW 2024 - Proceedings of the ACM Web Conference

Conference

Conference33rd ACM Web Conference, WWW 2024
Country/TerritorySingapore
CitySingapore
Period13/05/2417/05/24

Keywords

  • deep clustering
  • generative learning
  • ordinary differential equation
  • riemannian geometry

Fingerprint

Dive into the research topics of 'RicciNet: Deep Clustering via A Riemannian Generative Model'. Together they form a unique fingerprint.

Cite this